%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL652+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 : n029.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:36 PM UTC 2026 % Result : Theorem 29.48s 4.31s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL652+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.09/0.36 % Computer : n029.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.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 12:49:10 UTC 2026 % 0.09/0.37 % CPUTime : % 0.09/0.40 # No SInE strategy applied % 0.09/0.40 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.09/0.40 # and selection function SelectNewComplexAHP. % 0.09/0.40 # % 0.09/0.40 # Presaturation interreduction done % 0.09/0.40 # Number of axioms: 54 Number of unprocessed: 54 % 0.09/0.40 # Tableaux proof search. % 0.09/0.40 # APR header successfully linked. % 0.09/0.40 # Hello from C++ % 0.09/0.40 # The folding up rule is enabled... % 0.09/0.40 # Local unification is enabled... % 0.09/0.40 # Any saturation attempts will use folding labels... % 0.09/0.40 # 54 beginning clauses after preprocessing and clausification % 0.09/0.40 # Creating start rules for all 18 conjectures. % 0.09/0.40 # There are 18 start rule candidates: % 0.09/0.40 # Found 5 unit axioms. % 0.09/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.40 # 18 start rule tableaux created. % 0.09/0.40 # 49 extension rule candidate clauses % 0.09/0.40 # 5 unit axiom clauses % 0.09/0.40 % 0.09/0.40 # Requested 8, 32 cores available to the main process. % 7.23/1.44 # Ran out of tableaux, making start rules for all clauses % 29.48/4.30 # There were 5 total branch saturation attempts. % 29.48/4.30 # There were 0 of these attempts blocked. % 29.48/4.30 # There were 0 deferred branch saturation attempts. % 29.48/4.30 # There were 0 free duplicated saturations. % 29.48/4.30 # There were 5 total successful branch saturations. % 29.48/4.30 # There were 0 successful branch saturations in interreduction. % 29.48/4.30 # There were 0 successful branch saturations on the branch. % 29.48/4.30 # There were 5 successful branch saturations after the branch. % 29.48/4.31 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 29.48/4.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 29.48/4.31 # Begin clausification derivation % 29.48/4.31 % 29.48/4.31 # End clausification derivation % 29.48/4.31 # Begin listing active clauses obtained from FOF to CNF conversion % 29.48/4.31 cnf(i_0_10, negated_conjecture, (r1(esk1_0,esk5_0))). % 29.48/4.31 cnf(i_0_5, negated_conjecture, (r1(esk1_0,esk8_0))). % 29.48/4.31 cnf(i_0_9, negated_conjecture, (r1(esk5_0,esk6_0))). % 29.48/4.31 cnf(i_0_7, negated_conjecture, (r1(esk5_0,esk7_0))). % 29.48/4.31 cnf(i_0_6, negated_conjecture, (~p1(esk7_0))). % 29.48/4.31 cnf(i_0_8, negated_conjecture, (p1(X1)|~r1(esk6_0,X1))). % 29.48/4.31 cnf(i_0_13, negated_conjecture, (epred1_1(X1)|~r1(esk1_0,X1))). % 29.48/4.31 cnf(i_0_18, negated_conjecture, (~p4(X1)|~r1(esk1_0,X1))). % 29.48/4.31 cnf(i_0_3, negated_conjecture, (~p2(esk9_1(X1))|~r1(esk8_0,X1))). % 29.48/4.31 cnf(i_0_52, plain, (~epred1_1(X1)|~p3(esk12_2(X1,X2))|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_21, plain, (~epred1_1(X1)|~p2(X2)|~p3(esk23_1(X1))|~r1(esk24_1(X1),X2))). % 29.48/4.31 cnf(i_0_4, negated_conjecture, (r1(X1,esk9_1(X1))|~r1(esk8_0,X1))). % 29.48/4.31 cnf(i_0_11, negated_conjecture, (p1(X1)|~p1(esk4_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_54, plain, (r1(X1,esk11_2(X2,X1))|~epred1_1(X2)|~r1(X2,X1))). % 29.48/4.31 cnf(i_0_1, negated_conjecture, (p1(esk10_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))). % 29.48/4.31 cnf(i_0_51, plain, (p2(esk11_2(X1,X2))|~epred1_1(X1)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_20, plain, (p2(esk22_1(X1))|r1(X1,esk24_1(X1))|~epred1_1(X1))). % 29.48/4.31 cnf(i_0_26, plain, (r1(X1,esk24_1(X1))|r1(X1,esk22_1(X1))|~epred1_1(X1))). % 29.48/4.31 cnf(i_0_22, plain, (r1(X1,esk24_1(X1))|~epred1_1(X1)|~p3(esk23_1(X1)))). % 29.48/4.31 cnf(i_0_25, plain, (r1(X1,esk22_1(X1))|~epred1_1(X1)|~p2(X2)|~r1(esk24_1(X1),X2))). % 29.48/4.31 cnf(i_0_19, plain, (p2(esk22_1(X1))|~epred1_1(X1)|~p2(X2)|~r1(esk24_1(X1),X2))). % 29.48/4.31 cnf(i_0_23, plain, (r1(esk22_1(X1),esk23_1(X1))|~epred1_1(X1)|~p2(X2)|~r1(esk24_1(X1),X2))). % 29.48/4.31 cnf(i_0_24, plain, (r1(esk22_1(X1),esk23_1(X1))|r1(X1,esk24_1(X1))|~epred1_1(X1))). % 29.48/4.31 cnf(i_0_2, negated_conjecture, (r1(X1,esk10_1(X1))|~p1(X2)|~r1(esk1_0,X1)|~r1(X3,X2)|~r1(X1,X3))). % 29.48/4.31 cnf(i_0_12, negated_conjecture, (p1(X1)|r1(X2,esk4_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_53, plain, (r1(esk11_2(X1,X2),esk12_2(X1,X2))|~epred1_1(X1)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_31, plain, (r1(X1,esk19_2(X2,X1))|~epred1_1(X2)|~p2(X3)|~r1(esk18_2(X2,X1),X3)|~r1(X2,X1))). % 29.48/4.31 cnf(i_0_36, plain, (r1(X1,esk19_2(X2,X1))|r1(X1,esk18_2(X2,X1))|~epred1_1(X2)|~r1(X2,X1))). % 29.48/4.31 cnf(i_0_15, negated_conjecture, (p1(esk2_3(X1,X2,X3))|r1(X1,esk3_1(X1))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_39, plain, (~epred1_1(X1)|~p2(X2)|~p3(esk16_3(X1,X3,X4))|~r1(esk17_1(X1),X2)|~r1(X3,X4)|~r1(X1,X3))). % 29.48/4.31 cnf(i_0_40, plain, (r1(X1,esk17_1(X1))|~epred1_1(X1)|~p3(esk16_3(X1,X2,X3))|~r1(X2,X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_28, plain, (~epred1_1(X1)|~p2(X2)|~p3(esk21_3(X1,X3,X4))|~r1(esk18_2(X1,X3),X2)|~r1(esk19_2(X1,X3),X4)|~r1(X1,X3))). % 29.48/4.31 cnf(i_0_43, plain, (r1(X1,esk15_3(X2,X3,X1))|~epred1_1(X2)|~p2(X4)|~r1(esk17_1(X2),X4)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_44, plain, (r1(X1,esk15_3(X2,X3,X1))|r1(X2,esk17_1(X2))|~epred1_1(X2)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_16, negated_conjecture, (r1(X1,esk2_3(X2,X3,X1))|~p1(X4)|~r1(esk3_1(X2),X4)|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_14, negated_conjecture, (p1(esk2_3(X1,X2,X3))|~p1(X4)|~r1(esk3_1(X1),X4)|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_45, plain, (p2(X1)|~epred1_1(X2)|~p2(X3)|~p2(X4)|~r1(esk14_3(X2,X4,X5),X3)|~r1(X4,X1)|~r1(X4,X5)|~r1(X2,X4))). % 29.48/4.31 cnf(i_0_38, plain, (p2(esk15_3(X1,X2,X3))|r1(X1,esk17_1(X1))|~epred1_1(X1)|~r1(X2,X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_37, plain, (p2(esk15_3(X1,X2,X3))|~epred1_1(X1)|~p2(X4)|~r1(esk17_1(X1),X4)|~r1(X2,X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_17, negated_conjecture, (r1(X1,esk2_3(X2,X3,X1))|r1(X2,esk3_1(X2))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_33, plain, (r1(X1,esk18_2(X2,X1))|~epred1_1(X2)|~p3(esk21_3(X2,X1,X3))|~r1(esk19_2(X2,X1),X3)|~r1(X2,X1))). % 29.48/4.31 cnf(i_0_47, plain, (~epred1_1(X1)|~p2(X2)|~p2(X3)|~p3(esk13_3(X1,X3,X4))|~r1(esk14_3(X1,X3,X5),X2)|~r1(X3,X4)|~r1(X3,X5)|~r1(X1,X3))). % 29.48/4.31 cnf(i_0_30, plain, (r1(X1,esk20_3(X2,X3,X1))|~epred1_1(X2)|~p2(X4)|~r1(esk18_2(X2,X3),X4)|~r1(esk19_2(X2,X3),X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_46, plain, (p2(X1)|r1(X2,esk14_3(X3,X4,X2))|~epred1_1(X3)|~p2(X4)|~r1(X4,X1)|~r1(X4,X2)|~r1(X3,X4))). % 29.48/4.31 cnf(i_0_35, plain, (r1(X1,esk20_3(X2,X3,X1))|r1(X3,esk18_2(X2,X3))|~epred1_1(X2)|~r1(esk19_2(X2,X3),X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_41, plain, (r1(esk15_3(X1,X2,X3),esk16_3(X1,X2,X3))|~epred1_1(X1)|~p2(X4)|~r1(esk17_1(X1),X4)|~r1(X2,X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_27, plain, (p2(esk20_3(X1,X2,X3))|~epred1_1(X1)|~p2(X4)|~r1(esk18_2(X1,X2),X4)|~r1(esk19_2(X1,X2),X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_42, plain, (r1(esk15_3(X1,X2,X3),esk16_3(X1,X2,X3))|r1(X1,esk17_1(X1))|~epred1_1(X1)|~r1(X2,X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_32, plain, (p2(esk20_3(X1,X2,X3))|r1(X2,esk18_2(X1,X2))|~epred1_1(X1)|~r1(esk19_2(X1,X2),X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_50, plain, (r1(X1,esk14_3(X2,X3,X1))|r1(X4,esk13_3(X2,X3,X4))|~epred1_1(X2)|~p2(X3)|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_34, plain, (r1(esk20_3(X1,X2,X3),esk21_3(X1,X2,X3))|r1(X2,esk18_2(X1,X2))|~epred1_1(X1)|~r1(esk19_2(X1,X2),X3)|~r1(X1,X2))). % 29.48/4.31 cnf(i_0_48, plain, (r1(X1,esk14_3(X2,X3,X1))|~epred1_1(X2)|~p2(X3)|~p3(esk13_3(X2,X3,X4))|~r1(X3,X4)|~r1(X3,X1)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_49, plain, (r1(X1,esk13_3(X2,X3,X1))|~epred1_1(X2)|~p2(X4)|~p2(X3)|~r1(esk14_3(X2,X3,X5),X4)|~r1(X3,X1)|~r1(X3,X5)|~r1(X2,X3))). % 29.48/4.31 cnf(i_0_29, plain, (r1(esk20_3(X1,X2,X3),esk21_3(X1,X2,X3))|~epred1_1(X1)|~p2(X4)|~r1(esk18_2(X1,X2),X4)|~r1(esk19_2(X1,X2),X3)|~r1(X1,X2))). % 29.48/4.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 29.48/4.31 # Begin printing tableau % 29.48/4.31 # Found 12 steps % 29.48/4.31 cnf(i_0_2, negated_conjecture, (r1(esk8_0,esk10_1(esk8_0))|~p1(esk7_0)|~r1(esk1_0,esk8_0)|~r1(esk5_0,esk7_0)|~r1(esk8_0,esk5_0)), inference(start_rule)). % 29.48/4.31 cnf(i_0_84, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_5])). % 29.48/4.31 cnf(i_0_85, plain, (~r1(esk5_0,esk7_0)), inference(closure_rule, [i_0_7])). % 29.48/4.31 cnf(i_0_83, plain, (~p1(esk7_0)), inference(extension_rule, [i_0_12])). % 29.48/4.31 cnf(i_0_1249, plain, (~r1(esk1_0,esk8_0)), inference(closure_rule, [i_0_5])). % 29.48/4.31 cnf(i_0_1250, plain, (~r1(esk5_0,esk7_0)), inference(closure_rule, [i_0_7])). % 29.48/4.31 cnf(i_0_1248, plain, (r1(esk8_0,esk4_1(esk8_0))), inference(extension_rule, [i_0_54])). % 29.48/4.31 cnf(i_0_86, plain, (~r1(esk8_0,esk5_0)), inference(etableau_closure_rule, [i_0_86, ...])). % 29.48/4.31 cnf(i_0_82, plain, (r1(esk8_0,esk10_1(esk8_0))), inference(etableau_closure_rule, [i_0_82, ...])). % 29.48/4.31 cnf(i_0_1251, plain, (~r1(esk8_0,esk5_0)), inference(etableau_closure_rule, [i_0_1251, ...])). % 29.48/4.31 cnf(i_0_1256, plain, (r1(esk4_1(esk8_0),esk11_2(esk8_0,esk4_1(esk8_0)))), inference(etableau_closure_rule, [i_0_1256, ...])). % 29.48/4.31 cnf(i_0_1257, plain, (~epred1_1(esk8_0)), inference(etableau_closure_rule, [i_0_1257, ...])). % 29.48/4.31 # End printing tableau % 29.48/4.31 # SZS output end % 29.48/4.31 # Branches closed with saturation will be marked with an "s" % 29.48/4.31 # Child (1910746) has found a proof. % 29.48/4.31 % 29.48/4.31 # Proof search is over... % 29.48/4.31 # Freeing feature tree %------------------------------------------------------------------------------