%------------------------------------------------------------------------------
% File     : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% Domain   : Software Verification
% Problem  : Simple test case for recursion
% Version  : Especial.
% English  :

% Refs     : [CST26] Claessen et al. (2026), Email to Geoff Sutcliffe
% Source   : [CST26]
% Names    : Rec_prop1.p [CST26]

% Status   : Unsatisfiable
% Rating   : 0.11 v9.3.0
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   7 RR)
%            Number of literals    :   13 (  13 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :    9 (   5 sgn)
% SPC      : CNF_UNS_RFO_PEQ_UEQ

% Comments :
%------------------------------------------------------------------------------
cnf(axiom,axiom,
    aux(Z,btrue) = bfalse ).

cnf(axiom_001,axiom,
    aux(Z,bfalse) = btrue ).

cnf(axiom_002,axiom,
    h(nil) = nil ).

cnf(axiom_003,axiom,
    h(cons(Y,Xs)) = Xs ).

cnf(axiom_004,axiom,
    g(btrue) = bfalse ).

cnf(axiom_005,axiom,
    g(bfalse) = btrue ).

cnf(axiom_006,axiom,
    f(nil) = btrue ).

cnf(axiom_007,axiom,
    f(cons(Y,Z)) = aux(Z,f(Z)) ).

cnf(axiom_008,axiom,
    prop1(X) = eq(f(X),bfalse) ).

cnf(axiom_009,axiom,
    eq(bfalse,btrue) = bfalse ).

cnf(axiom_010,axiom,
    eq(btrue,bfalse) = bfalse ).

cnf(axiom_011,axiom,
    eq(X,X) = btrue ).

cnf(goal,negated_conjecture,
    eq(prop1(X),bfalse) != btrue ).

%------------------------------------------------------------------------------