%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL654+1.001 : TPTP v9.3.1. Released v4.0.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 : n026.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:01:37 PM UTC 2026 % Result : Theorem 0.13s 0.44s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL654+1.001 : TPTP v9.3.1. Released v4.0.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.34 % Computer : n026.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Sat Sep 5 00:40:10 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 15 Number of unprocessed: 15 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 15 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 14 conjectures. % 0.13/0.38 # There are 14 start rule candidates: % 0.13/0.38 # Found 5 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 14 start rule tableaux created. % 0.13/0.38 # 10 extension rule candidate clauses % 0.13/0.38 # 5 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.44 # There were 5 total branch saturation attempts. % 0.13/0.44 # There were 0 of these attempts blocked. % 0.13/0.44 # There were 0 deferred branch saturation attempts. % 0.13/0.44 # There were 0 free duplicated saturations. % 0.13/0.44 # There were 5 total successful branch saturations. % 0.13/0.44 # There were 0 successful branch saturations in interreduction. % 0.13/0.44 # There were 0 successful branch saturations on the branch. % 0.13/0.44 # There were 5 successful branch saturations after the branch. % 0.13/0.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.44 # Begin clausification derivation % 0.13/0.44 % 0.13/0.44 # End clausification derivation % 0.13/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.44 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk7_0))). % 0.13/0.44 cnf(i_0_5, negated_conjecture, (r1(esk7_0,esk8_0))). % 0.13/0.44 cnf(i_0_4, negated_conjecture, (r1(esk8_0,esk9_0))). % 0.13/0.44 cnf(i_0_1, plain, (r1(X1,X1))). % 0.13/0.44 cnf(i_0_3, negated_conjecture, (~p1(esk9_0))). % 0.13/0.44 cnf(i_0_2, negated_conjecture, (p1(X1)|~r1(esk7_0,X1))). % 0.13/0.44 cnf(i_0_7, negated_conjecture, (r1(X1,esk6_1(X1))|~r1(esk1_0,X1))). % 0.13/0.44 cnf(i_0_14, negated_conjecture, (p1(esk2_2(X1,X2))|~p1(X1)|~r1(esk1_0,X1)|~r1(X1,X2))). % 0.13/0.44 cnf(i_0_15, negated_conjecture, (r1(X1,esk2_2(X2,X1))|~p1(X2)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.44 cnf(i_0_8, negated_conjecture, (p1(X1)|~p1(esk5_2(X2,X3))|~r1(esk4_2(X2,X4),X1)|~r1(esk1_0,X2)|~r1(X2,X4)|~r1(X2,X3))). % 0.13/0.44 cnf(i_0_12, negated_conjecture, (p1(X1)|~p1(esk3_3(X2,X3,X4))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X3,X4)|~r1(X2,X3))). % 0.13/0.44 cnf(i_0_10, negated_conjecture, (r1(X1,esk4_2(X2,X1))|~p1(esk5_2(X2,X3))|~r1(esk1_0,X2)|~r1(X2,X1)|~r1(X2,X3))). % 0.13/0.44 cnf(i_0_9, negated_conjecture, (p1(X1)|r1(X2,esk5_2(X3,X2))|~r1(esk4_2(X3,X4),X1)|~r1(esk1_0,X3)|~r1(X3,X4)|~r1(X3,X2))). % 0.13/0.44 cnf(i_0_11, negated_conjecture, (r1(X1,esk5_2(X2,X1))|r1(X3,esk4_2(X2,X3))|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X2,X1))). % 0.13/0.44 cnf(i_0_13, negated_conjecture, (p1(X1)|r1(X2,esk3_3(X3,X4,X2))|~r1(esk1_0,X3)|~r1(X4,X1)|~r1(X4,X2)|~r1(X3,X4))). % 0.13/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.44 # Begin printing tableau % 0.13/0.44 # Found 17 steps % 0.13/0.44 cnf(i_0_12, negated_conjecture, (p1(esk9_0)|~p1(esk3_3(esk1_0,esk9_0,esk9_0))|~r1(esk1_0,esk1_0)|~r1(esk9_0,esk9_0)|~r1(esk9_0,esk9_0)|~r1(esk1_0,esk9_0)), inference(start_rule)). % 0.13/0.44 cnf(i_0_38, plain, (p1(esk9_0)), inference(closure_rule, [i_0_3])). % 0.13/0.44 cnf(i_0_40, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_41, plain, (~r1(esk9_0,esk9_0)), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_42, plain, (~r1(esk9_0,esk9_0)), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_39, plain, (~p1(esk3_3(esk1_0,esk9_0,esk9_0))), inference(extension_rule, [i_0_13])). % 0.13/0.44 cnf(i_0_68, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_69, plain, (~r1(esk3_3(esk1_0,esk9_0,esk9_0),esk3_3(esk1_0,esk9_0,esk9_0))), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_70, plain, (~r1(esk3_3(esk1_0,esk9_0,esk9_0),esk3_3(esk1_0,esk9_0,esk9_0))), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_67, plain, (r1(esk3_3(esk1_0,esk9_0,esk9_0),esk3_3(esk1_0,esk3_3(esk1_0,esk9_0,esk9_0),esk3_3(esk1_0,esk9_0,esk9_0)))), inference(extension_rule, [i_0_12])). % 0.13/0.44 cnf(i_0_90, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_92, plain, (~r1(esk3_3(esk1_0,esk9_0,esk9_0),esk3_3(esk1_0,esk9_0,esk9_0))), inference(closure_rule, [i_0_1])). % 0.13/0.44 cnf(i_0_43, plain, (~r1(esk1_0,esk9_0)), inference(etableau_closure_rule, [i_0_43, ...])). % 0.13/0.44 cnf(i_0_71, plain, (~r1(esk1_0,esk3_3(esk1_0,esk9_0,esk9_0))), inference(etableau_closure_rule, [i_0_71, ...])). % 0.13/0.44 cnf(i_0_88, plain, (p1(esk3_3(esk1_0,esk3_3(esk1_0,esk9_0,esk9_0),esk3_3(esk1_0,esk9_0,esk9_0)))), inference(etableau_closure_rule, [i_0_88, ...])). % 0.13/0.44 cnf(i_0_89, plain, (~p1(esk3_3(esk1_0,esk3_3(esk1_0,esk9_0,esk9_0),esk3_3(esk1_0,esk9_0,esk9_0)))), inference(etableau_closure_rule, [i_0_89, ...])). % 0.13/0.44 cnf(i_0_93, plain, (~r1(esk1_0,esk3_3(esk1_0,esk9_0,esk9_0))), inference(etableau_closure_rule, [i_0_93, ...])). % 0.13/0.44 # End printing tableau % 0.13/0.44 # SZS output end % 0.13/0.44 # Branches closed with saturation will be marked with an "s" % 0.13/0.45 # Child (1212246) has found a proof. % 0.13/0.45 % 0.13/0.45 # Proof search is over... % 0.13/0.45 # Freeing feature tree %------------------------------------------------------------------------------