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