%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL672+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 : 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:01:43 PM UTC 2026 % Result : Theorem 2.23s 0.72s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL672+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.35 % Computer : n028.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 14:35:59 UTC 2026 % 0.08/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 20 Number of unprocessed: 20 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 20 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 18 conjectures. % 0.14/0.39 # There are 18 start rule candidates: % 0.14/0.39 # Found 9 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 18 start rule tableaux created. % 0.14/0.39 # 11 extension rule candidate clauses % 0.14/0.39 # 9 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 2.23/0.72 # There were 4 total branch saturation attempts. % 2.23/0.72 # There were 0 of these attempts blocked. % 2.23/0.72 # There were 0 deferred branch saturation attempts. % 2.23/0.72 # There were 0 free duplicated saturations. % 2.23/0.72 # There were 4 total successful branch saturations. % 2.23/0.72 # There were 1 successful branch saturations in interreduction. % 2.23/0.72 # There were 0 successful branch saturations on the branch. % 2.23/0.72 # There were 3 successful branch saturations after the branch. % 2.23/0.72 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.23/0.72 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.23/0.72 # Begin clausification derivation % 2.23/0.72 % 2.23/0.72 # End clausification derivation % 2.23/0.72 # Begin listing active clauses obtained from FOF to CNF conversion % 2.23/0.72 cnf(i_0_11, negated_conjecture, (r1(esk1_0,esk7_0))). % 2.23/0.72 cnf(i_0_9, negated_conjecture, (r1(esk1_0,esk8_0))). % 2.23/0.72 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk11_0))). % 2.23/0.72 cnf(i_0_8, negated_conjecture, (r1(esk8_0,esk9_0))). % 2.23/0.72 cnf(i_0_1, plain, (r1(X1,X1))). % 2.23/0.72 cnf(i_0_6, negated_conjecture, (r1(esk8_0,esk10_0))). % 2.23/0.72 cnf(i_0_10, negated_conjecture, (~p2(esk7_0))). % 2.23/0.72 cnf(i_0_5, negated_conjecture, (~p1(esk10_0))). % 2.23/0.72 cnf(i_0_3, negated_conjecture, (~p1(esk11_0))). % 2.23/0.72 cnf(i_0_7, negated_conjecture, (p1(X1)|~r1(esk9_0,X1))). % 2.23/0.72 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))). % 2.23/0.72 cnf(i_0_12, negated_conjecture, (p1(X1)|p2(X2)|r1(X3,esk6_1(X3))|~r1(esk1_0,X1)|~r1(esk1_0,X3)|~r1(esk1_0,X2))). % 2.23/0.72 cnf(i_0_19, negated_conjecture, (p1(esk2_2(X1,X2))|p1(X3)|p2(X4)|~p1(X1)|~r1(esk1_0,X3)|~r1(esk1_0,X4)|~r1(esk1_0,X1)|~r1(X1,X2))). % 2.23/0.72 cnf(i_0_20, negated_conjecture, (p1(X1)|p2(X2)|r1(X3,esk2_2(X4,X3))|~p1(X4)|~r1(esk1_0,X1)|~r1(esk1_0,X2)|~r1(esk1_0,X4)|~r1(X4,X3))). % 2.23/0.72 cnf(i_0_13, negated_conjecture, (p1(X1)|p1(X2)|p2(X3)|~p1(esk5_2(X4,X5))|~r1(esk4_2(X4,X6),X1)|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(esk1_0,X4)|~r1(X4,X6)|~r1(X4,X5))). % 2.23/0.72 cnf(i_0_15, negated_conjecture, (p1(X1)|p2(X2)|r1(X3,esk4_2(X4,X3))|~p1(esk5_2(X4,X5))|~r1(esk1_0,X1)|~r1(esk1_0,X2)|~r1(esk1_0,X4)|~r1(X4,X3)|~r1(X4,X5))). % 2.23/0.72 cnf(i_0_16, negated_conjecture, (p1(X1)|p2(X2)|r1(X3,esk5_2(X4,X3))|r1(X5,esk4_2(X4,X5))|~r1(esk1_0,X1)|~r1(esk1_0,X2)|~r1(esk1_0,X4)|~r1(X4,X5)|~r1(X4,X3))). % 2.23/0.72 cnf(i_0_17, negated_conjecture, (p1(X1)|p1(X2)|p2(X3)|~p1(esk3_3(X4,X5,X6))|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(esk1_0,X4)|~r1(X5,X1)|~r1(X5,X6)|~r1(X4,X5))). % 2.23/0.72 cnf(i_0_14, negated_conjecture, (p1(X1)|p1(X2)|p2(X3)|r1(X4,esk5_2(X5,X4))|~r1(esk4_2(X5,X6),X1)|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(esk1_0,X5)|~r1(X5,X6)|~r1(X5,X4))). % 2.23/0.72 cnf(i_0_18, negated_conjecture, (p1(X1)|p1(X2)|p2(X3)|r1(X4,esk3_3(X5,X6,X4))|~r1(esk1_0,X2)|~r1(esk1_0,X3)|~r1(esk1_0,X5)|~r1(X6,X1)|~r1(X6,X4)|~r1(X5,X6))). % 2.23/0.72 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 2.23/0.72 # Begin printing tableau % 2.23/0.72 # Found 21 steps % 2.23/0.72 cnf(i_0_15, negated_conjecture, (p1(esk11_0)|p2(esk7_0)|r1(esk1_0,esk4_2(esk1_0,esk1_0))|~p1(esk5_2(esk1_0,esk1_0))|~r1(esk1_0,esk11_0)|~r1(esk1_0,esk7_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). % 2.23/0.72 cnf(i_0_60, plain, (p1(esk11_0)), inference(closure_rule, [i_0_3])). % 2.23/0.72 cnf(i_0_61, plain, (p2(esk7_0)), inference(closure_rule, [i_0_10])). % 2.23/0.72 cnf(i_0_64, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_4])). % 2.23/0.72 cnf(i_0_65, plain, (~r1(esk1_0,esk7_0)), inference(closure_rule, [i_0_11])). % 2.23/0.72 cnf(i_0_66, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 2.23/0.72 cnf(i_0_67, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 2.23/0.72 cnf(i_0_68, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 2.23/0.72 cnf(i_0_62, plain, (r1(esk1_0,esk4_2(esk1_0,esk1_0))), inference(extension_rule, [i_0_2])). % 2.23/0.72 cnf(i_0_111, plain, (r1(esk1_0,esk4_2(esk1_0,esk1_0))), inference(extension_rule, [i_0_18])). % 2.23/0.72 cnf(i_0_114, plain, (p1(esk11_0)), inference(closure_rule, [i_0_3])). % 2.23/0.72 cnf(i_0_116, plain, (p2(esk7_0)), inference(closure_rule, [i_0_10])). % 2.23/0.72 cnf(i_0_119, plain, (~r1(esk1_0,esk7_0)), inference(closure_rule, [i_0_11])). % 2.23/0.72 cnf(i_0_120, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 2.23/0.72 cnf(i_0_121, plain, (~r1(esk11_0,esk11_0)), inference(closure_rule, [i_0_1])). % 2.23/0.72 cnf(i_0_122, plain, (~r1(esk11_0,esk11_0)), inference(closure_rule, [i_0_1])). % 2.23/0.72 cnf(i_0_123, plain, (~r1(esk1_0,esk11_0)), inference(closure_rule, [i_0_4])). % 2.23/0.72 cnf(i_0_63, plain, (~p1(esk5_2(esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_63, ...])). % 2.23/0.72 cnf(i_0_113, plain, (~r1(esk1_0,esk1_0)), inference(etableau_closure_rule, [i_0_113, ...])). % 2.23/0.72 cnf(i_0_115, plain, (p1(esk4_2(esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_115, ...])). % 2.23/0.72 cnf(i_0_117, plain, (r1(esk11_0,esk3_3(esk1_0,esk11_0,esk11_0))), inference(etableau_closure_rule, [i_0_117, ...])). % 2.23/0.72 # End printing tableau % 2.23/0.72 # SZS output end % 2.23/0.72 # Branches closed with saturation will be marked with an "s" % 2.23/0.72 # Child (2028768) has found a proof. % 2.23/0.72 % 2.23/0.72 # Proof search is over... % 2.23/0.72 # Freeing feature tree %------------------------------------------------------------------------------