%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUN135-1.006 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 06:48:38 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN135-1.006 : TPTP v9.3.0. Released v9.3.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.16/0.34 % Computer : n015.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 04:49:01 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.18/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.18/0.37 #
% 0.18/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 1 conjectures.
% 0.18/0.37 # There are 1 start rule candidates:
% 0.18/0.37 # Found 14 unit axioms.
% 0.18/0.37 # 1 start rule tableaux created.
% 0.18/0.37 # 0 extension rule candidate clauses
% 0.18/0.37 # 14 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.37 # Creating equality axioms
% 0.18/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.37 # Returning from population with 29 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 29 tableaux to operate on
% 0.18/0.44 # There were 1 total branch saturation attempts.
% 0.18/0.44 # There were 0 of these attempts blocked.
% 0.18/0.44 # There were 0 deferred branch saturation attempts.
% 0.18/0.44 # There were 0 free duplicated saturations.
% 0.18/0.44 # There were 1 total successful branch saturations.
% 0.18/0.44 # There were 0 successful branch saturations in interreduction.
% 0.18/0.44 # There were 0 successful branch saturations on the branch.
% 0.18/0.44 # There were 1 successful branch saturations after the branch.
% 0.18/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Begin clausification derivation
% 0.18/0.44
% 0.18/0.44 # End clausification derivation
% 0.18/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.44 cnf(i_0_22, plain, (perfectp(zero)=false)).
% 0.18/0.44 cnf(i_0_28, negated_conjecture, (perfectp(X1)!=true)).
% 0.18/0.44 cnf(i_0_17, plain, ('<='(zero,X1)=true)).
% 0.18/0.44 cnf(i_0_15, plain, (minus(X1,zero)=X1)).
% 0.18/0.44 cnf(i_0_18, plain, ('<='(s(X1),zero)=false)).
% 0.18/0.44 cnf(i_0_16, plain, (minus(s(X1),s(X2))=minus(X1,X2))).
% 0.18/0.44 cnf(i_0_19, plain, ('<='(s(X1),s(X2))='<='(X1,X2))).
% 0.18/0.44 cnf(i_0_20, plain, (if(true,X1,X2)=X1)).
% 0.18/0.44 cnf(i_0_21, plain, (if(false,X1,X2)=X2)).
% 0.18/0.44 cnf(i_0_24, plain, (f(zero,X1,zero,X2)=true)).
% 0.18/0.44 cnf(i_0_25, plain, (f(zero,X1,s(X2),X3)=false)).
% 0.18/0.44 cnf(i_0_23, plain, (f(X1,s(zero),s(X1),s(X1))=perfectp(s(X1)))).
% 0.18/0.44 cnf(i_0_26, plain, (f(X1,X3,minus(X2,s(X1)),X3)=f(s(X1),zero,X2,X3))).
% 0.18/0.44 cnf(i_0_27, plain, (if('<='(X1,X2),f(s(X1),minus(X2,X1),X3,X4),f(X1,X4,X3,X4))=f(s(X1),s(X2),X3,X4))).
% 0.18/0.44 cnf(i_0_30, plain, (X5=X5)).
% 0.18/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.44 # Begin printing tableau
% 0.18/0.44 # Found 8 steps
% 0.18/0.44 cnf(i_0_22, plain, (perfectp(zero)=false), inference(start_rule)).
% 0.18/0.44 cnf(i_0_40, plain, (perfectp(zero)=false), inference(extension_rule, [i_0_39])).
% 0.18/0.44 cnf(i_0_77, plain, (perfectp(zero)!=false), inference(closure_rule, [i_0_22])).
% 0.18/0.44 cnf(i_0_79, plain, (perfectp(zero)!=false), inference(closure_rule, [i_0_22])).
% 0.18/0.44 cnf(i_0_80, plain, (perfectp(zero)!=false), inference(closure_rule, [i_0_22])).
% 0.18/0.44 cnf(i_0_76, plain, (f(perfectp(zero),perfectp(zero),perfectp(zero),perfectp(zero))=f(false,false,false,false)), inference(extension_rule, [i_0_33])).
% 0.18/0.44 cnf(i_0_87, plain, (f(false,false,false,false)!=minus(f(false,false,false,false),zero)), inference(closure_rule, [i_0_15])).
% 0.18/0.44 cnf(i_0_85, plain, (f(perfectp(zero),perfectp(zero),perfectp(zero),perfectp(zero))=minus(f(false,false,false,false),zero)), inference(etableau_closure_rule, [i_0_85, ...])).
% 0.18/0.44 # End printing tableau
% 0.18/0.44 # SZS output end
% 0.18/0.44 # Branches closed with saturation will be marked with an "s"
% 0.18/0.44 # Child (19009) has found a proof.
% 0.18/0.44
% 0.18/0.44 # Proof search is over...
% 0.18/0.44 # Freeing feature tree
%------------------------------------------------------------------------------