%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL894+1 : TPTP v9.3.1. Released v5.5.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 : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 12:02:12 PM UTC 2026
% Result : Theorem 0.02s 0.46s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL894+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.09/0.36 % Computer : n028.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.02/0.36 % CPULimit : 300
% 0.02/0.36 % WCLimit : 300
% 0.02/0.36 % DateTime : Sat Sep 5 21:10:44 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.38 # No SInE strategy applied
% 0.02/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.02/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.02/0.38 #
% 0.02/0.38 # Presaturation interreduction done
% 0.02/0.38 # Number of axioms: 16 Number of unprocessed: 16
% 0.02/0.38 # Tableaux proof search.
% 0.02/0.38 # APR header successfully linked.
% 0.02/0.38 # Hello from C++
% 0.02/0.38 # The folding up rule is enabled...
% 0.02/0.38 # Local unification is enabled...
% 0.02/0.38 # Any saturation attempts will use folding labels...
% 0.02/0.38 # 16 beginning clauses after preprocessing and clausification
% 0.02/0.38 # Creating start rules for all 3 conjectures.
% 0.02/0.38 # There are 3 start rule candidates:
% 0.02/0.38 # Found 6 unit axioms.
% 0.02/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.02/0.38 # 3 start rule tableaux created.
% 0.02/0.38 # 10 extension rule candidate clauses
% 0.02/0.38 # 6 unit axiom clauses
% 0.02/0.38
% 0.02/0.38 # Requested 8, 32 cores available to the main process.
% 0.02/0.38 # There are not enough tableaux to fork, creating more from the initial 3
% 0.02/0.38 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.02/0.38 # We now have 16 tableaux to operate on
% 0.02/0.46 # There were 3 total branch saturation attempts.
% 0.02/0.46 # There were 0 of these attempts blocked.
% 0.02/0.46 # There were 0 deferred branch saturation attempts.
% 0.02/0.46 # There were 0 free duplicated saturations.
% 0.02/0.46 # There were 3 total successful branch saturations.
% 0.02/0.46 # There were 0 successful branch saturations in interreduction.
% 0.02/0.46 # There were 0 successful branch saturations on the branch.
% 0.02/0.46 # There were 3 successful branch saturations after the branch.
% 0.02/0.46 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.46 # Begin clausification derivation
% 0.02/0.46
% 0.02/0.46 # End clausification derivation
% 0.02/0.46 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.02/0.46 cnf(i_0_9, plain, ('>='(X1,'0'))).
% 0.02/0.46 cnf(i_0_4, plain, ('>='(X1,X1))).
% 0.02/0.46 cnf(i_0_3, plain, ('+'(X1,'0')=X1)).
% 0.02/0.46 cnf(i_0_1, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
% 0.02/0.46 cnf(i_0_2, plain, ('+'(X1,X2)='+'(X2,X1))).
% 0.02/0.46 cnf(i_0_13, plain, ('+'(X1,'==>'(X1,X2))='+'(X2,'==>'(X2,X1)))).
% 0.02/0.46 cnf(i_0_16, negated_conjecture, (~'>='(c,'+'(a,'==>'(a,b)))|~'>='(c,a)|~'>='(c,b))).
% 0.02/0.46 cnf(i_0_15, negated_conjecture, ('>='(c,'+'(a,'==>'(a,b)))|'>='(c,a))).
% 0.02/0.46 cnf(i_0_14, negated_conjecture, ('>='(c,'+'(a,'==>'(a,b)))|'>='(c,b))).
% 0.02/0.46 cnf(i_0_6, plain, (X1=X2|~'>='(X2,X1)|~'>='(X1,X2))).
% 0.02/0.46 cnf(i_0_5, plain, ('>='(X1,X2)|~'>='(X3,X2)|~'>='(X1,X3))).
% 0.02/0.46 cnf(i_0_7, plain, ('>='('+'(X1,X2),X3)|~'>='(X2,'==>'(X1,X3)))).
% 0.02/0.46 cnf(i_0_8, plain, ('>='(X1,'==>'(X2,X3))|~'>='('+'(X2,X1),X3))).
% 0.02/0.46 cnf(i_0_10, plain, ('>='('+'(X1,X2),'+'(X3,X2))|~'>='(X1,X3))).
% 0.02/0.46 cnf(i_0_12, plain, ('>='('==>'(X1,X2),'==>'(X1,X3))|~'>='(X2,X3))).
% 0.02/0.46 cnf(i_0_11, plain, ('>='('==>'(X1,X2),'==>'(X3,X2))|~'>='(X3,X1))).
% 0.02/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.02/0.46 # Begin printing tableau
% 0.02/0.46 # Found 7 steps
% 0.02/0.46 cnf(i_0_14, negated_conjecture, ('>='(c,'+'(a,'==>'(a,b)))|'>='(c,b)), inference(start_rule)).
% 0.02/0.46 cnf(i_0_18, plain, ('>='(c,b)), inference(extension_rule, [i_0_5])).
% 0.02/0.46 cnf(i_0_50, plain, ('>='(c,b)), inference(extension_rule, [i_0_6])).
% 0.02/0.46 cnf(i_0_52, plain, (~'>='(c,c)), inference(closure_rule, [i_0_4])).
% 0.02/0.46 cnf(i_0_17, plain, ('>='(c,'+'(a,'==>'(a,b)))), inference(etableau_closure_rule, [i_0_17, ...])).
% 0.02/0.46 cnf(i_0_70, plain, (b=c), inference(etableau_closure_rule, [i_0_70, ...])).
% 0.02/0.46 cnf(i_0_72, plain, (~'>='(b,c)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.02/0.46 # End printing tableau
% 0.02/0.46 # SZS output end
% 0.02/0.46 # Branches closed with saturation will be marked with an "s"
% 0.02/0.46 # Child (2324367) has found a proof.
% 0.02/0.46
% 0.02/0.46 # Proof search is over...
% 0.02/0.46 # Freeing feature tree
%------------------------------------------------------------------------------