%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL668+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 : n017.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:42 PM UTC 2026 % Result : Theorem 28.28s 4.25s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL668+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.11/0.37 % Computer : n017.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.37 % WCLimit : 300 % 0.11/0.37 % DateTime : Sat Sep 5 06:56:51 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.40 # No SInE strategy applied % 0.11/0.40 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.11/0.40 # and selection function SelectNewComplexAHP. % 0.11/0.40 # % 0.11/0.40 # Presaturation interreduction done % 0.11/0.40 # Number of axioms: 35 Number of unprocessed: 35 % 0.11/0.40 # Tableaux proof search. % 0.11/0.40 # APR header successfully linked. % 0.11/0.40 # Hello from C++ % 0.11/0.41 # The folding up rule is enabled... % 0.11/0.41 # Local unification is enabled... % 0.11/0.41 # Any saturation attempts will use folding labels... % 0.11/0.41 # 35 beginning clauses after preprocessing and clausification % 0.11/0.41 # Creating start rules for all 34 conjectures. % 0.11/0.41 # There are 34 start rule candidates: % 0.11/0.41 # Found 15 unit axioms. % 0.11/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.41 # 34 start rule tableaux created. % 0.11/0.41 # 20 extension rule candidate clauses % 0.11/0.41 # 15 unit axiom clauses % 0.11/0.41 % 0.11/0.41 # Requested 8, 32 cores available to the main process. % 28.28/4.25 # Closed tableau found in foldup close cycle with 0 folds and 9 closures done. % 28.28/4.25 # There were 3 total branch saturation attempts. % 28.28/4.25 # There were 0 of these attempts blocked. % 28.28/4.25 # There were 0 deferred branch saturation attempts. % 28.28/4.25 # There were 0 free duplicated saturations. % 28.28/4.25 # There were 1 total successful branch saturations. % 28.28/4.25 # There were 0 successful branch saturations in interreduction. % 28.28/4.25 # There were 0 successful branch saturations on the branch. % 28.28/4.25 # There were 1 successful branch saturations after the branch. % 28.28/4.25 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 28.28/4.25 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 28.28/4.25 # Begin clausification derivation % 28.28/4.25 % 28.28/4.25 # End clausification derivation % 28.28/4.25 # Begin listing active clauses obtained from FOF to CNF conversion % 28.28/4.25 cnf(i_0_35, negated_conjecture, (r1(esk1_0,esk2_0))). % 28.28/4.25 cnf(i_0_28, negated_conjecture, (r1(esk1_0,esk8_0))). % 28.28/4.25 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk13_0))). % 28.28/4.25 cnf(i_0_34, negated_conjecture, (r1(esk2_0,esk3_0))). % 28.28/4.25 cnf(i_0_33, negated_conjecture, (r1(esk3_0,esk4_0))). % 28.28/4.25 cnf(i_0_32, negated_conjecture, (r1(esk4_0,esk5_0))). % 28.28/4.25 cnf(i_0_31, negated_conjecture, (r1(esk5_0,esk6_0))). % 28.28/4.25 cnf(i_0_30, negated_conjecture, (r1(esk6_0,esk7_0))). % 28.28/4.25 cnf(i_0_7, negated_conjecture, (r1(esk13_0,esk14_0))). % 28.28/4.25 cnf(i_0_6, negated_conjecture, (r1(esk14_0,esk15_0))). % 28.28/4.25 cnf(i_0_5, negated_conjecture, (r1(esk15_0,esk16_0))). % 28.28/4.25 cnf(i_0_4, negated_conjecture, (r1(esk16_0,esk17_0))). % 28.28/4.25 cnf(i_0_3, negated_conjecture, (r1(esk17_0,esk18_0))). % 28.28/4.25 cnf(i_0_1, plain, (r1(X1,X1))). % 28.28/4.25 cnf(i_0_27, negated_conjecture, (~p7(esk8_0))). % 28.28/4.25 cnf(i_0_23, negated_conjecture, (~p6(esk9_1(X1))|~r1(esk1_0,X1))). % 28.28/4.25 cnf(i_0_2, negated_conjecture, (~p3(esk18_0)|~p1(esk18_0)|~p5(esk18_0)|~p2(esk18_0)|~p4(esk18_0)|~p6(esk18_0))). % 28.28/4.25 cnf(i_0_24, negated_conjecture, (r1(X1,esk9_1(X1))|~r1(esk1_0,X1))). % 28.28/4.25 cnf(i_0_19, negated_conjecture, (~p5(esk10_2(X1,X2))|~r1(esk1_0,X1)|~r1(X1,X2))). % 28.28/4.25 cnf(i_0_15, negated_conjecture, (~p4(esk11_3(X1,X2,X3))|~r1(esk1_0,X1)|~r1(X2,X3)|~r1(X1,X2))). % 28.28/4.25 cnf(i_0_20, negated_conjecture, (r1(X1,esk10_2(X2,X1))|~r1(esk1_0,X2)|~r1(X2,X1))). % 28.28/4.25 cnf(i_0_11, negated_conjecture, (~p3(esk12_4(X1,X2,X3,X4))|~r1(esk1_0,X1)|~r1(X3,X4)|~r1(X2,X3)|~r1(X1,X2))). % 28.28/4.25 cnf(i_0_29, negated_conjecture, (p2(esk7_0)|p4(esk7_0)|p6(esk7_0)|p8(esk7_0)|p10(esk7_0)|p12(esk7_0))). % 28.28/4.25 cnf(i_0_16, negated_conjecture, (r1(X1,esk11_3(X2,X3,X1))|~r1(esk1_0,X2)|~r1(X3,X1)|~r1(X2,X3))). % 28.28/4.25 cnf(i_0_21, negated_conjecture, (~p5(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_17, negated_conjecture, (~p3(X1)|~p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_9, negated_conjecture, (~p1(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_22, negated_conjecture, (p5(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_12, negated_conjecture, (r1(X1,esk12_4(X2,X3,X4,X1))|~r1(esk1_0,X2)|~r1(X4,X1)|~r1(X3,X4)|~r1(X2,X3))). % 28.28/4.25 cnf(i_0_13, negated_conjecture, (~p3(X1)|~p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_25, negated_conjecture, (~p1(X1)|~p5(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_18, negated_conjecture, (p3(X1)|p4(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_10, negated_conjecture, (p1(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_14, negated_conjecture, (p3(X1)|p2(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 cnf(i_0_26, negated_conjecture, (p1(X1)|p5(X1)|~r1(esk1_0,X2)|~r1(X2,X3)|~r1(X3,X4)|~r1(X4,X5)|~r1(X5,X6)|~r1(X6,X7)|~r1(X7,X8)|~r1(X8,X1))). % 28.28/4.25 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 28.28/4.25 # Begin printing tableau % 28.28/4.25 # Found 51 steps % 28.28/4.25 cnf(i_0_12, negated_conjecture, (r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). % 28.28/4.25 cnf(i_0_97, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_98, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_99, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_100, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_96, plain, (r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_26])). % 28.28/4.25 cnf(i_0_193, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_194, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_195, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_196, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_197, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_198, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_199, plain, (~r1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0),esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_190, plain, (p1(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_9])). % 28.28/4.25 cnf(i_0_267, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_268, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_269, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_270, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_271, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_272, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_273, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_274, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])). % 28.28/4.25 cnf(i_0_266, plain, (~p2(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_14])). % 28.28/4.25 cnf(i_0_22004, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22005, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22006, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22007, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22008, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22009, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22010, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22011, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])). % 28.28/4.25 cnf(i_0_191, plain, (p5(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_21])). % 28.28/4.25 cnf(i_0_22079, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22080, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22081, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22082, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22083, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22084, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22085, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_22086, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])). % 28.28/4.25 cnf(i_0_22002, plain, (p3(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(etableau_closure_rule, [i_0_22002, ...])). % 28.28/4.25 cnf(i_0_22078, plain, (~p4(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(extension_rule, [i_0_18])). % 28.28/4.25 cnf(i_0_39904, plain, (p3(esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_547])). % 28.28/4.25 cnf(i_0_39906, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_39907, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_39908, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_39909, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_39910, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_39911, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_39912, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 28.28/4.25 cnf(i_0_39913, plain, (~r1(esk1_0,esk12_4(esk1_0,esk1_0,esk1_0,esk1_0))), inference(closure_rule, [i_0_96])). % 28.28/4.25 # End printing tableau % 28.28/4.25 # SZS output end % 28.28/4.25 # Branches closed with saturation will be marked with an "s" % 28.28/4.27 # Child (739443) has found a proof. % 28.28/4.27 % 28.28/4.27 # Proof search is over... % 28.28/4.27 # Freeing feature tree %------------------------------------------------------------------------------