%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL686+1.005 : 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 : n007.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:48 PM UTC 2026 % Result : Theorem 0.11s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL686+1.005 : 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.36 % Computer : n007.cluster.edu % 0.11/0.36 % Model : x86_64 x86_64 % 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.36 % Memory : 8046.5625MB % 0.11/0.36 % OS : Linux 6.8.0-71-generic % 0.11/0.36 % CPULimit : 300 % 0.11/0.36 % WCLimit : 300 % 0.11/0.36 % DateTime : Fri Sep 4 18:44:24 UTC 2026 % 0.11/0.36 % CPUTime : % 0.11/0.40 # No SInE strategy applied % 0.11/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.11/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.11/0.40 # % 0.11/0.40 # Presaturation interreduction done % 0.11/0.40 # Number of axioms: 76 Number of unprocessed: 76 % 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.40 # The folding up rule is enabled... % 0.11/0.40 # Local unification is enabled... % 0.11/0.40 # Any saturation attempts will use folding labels... % 0.11/0.40 # 76 beginning clauses after preprocessing and clausification % 0.11/0.40 # Creating start rules for all 6 conjectures. % 0.11/0.40 # There are 6 start rule candidates: % 0.11/0.40 # Found 6 unit axioms. % 0.11/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.40 # 6 start rule tableaux created. % 0.11/0.40 # 70 extension rule candidate clauses % 0.11/0.40 # 6 unit axiom clauses % 0.11/0.40 % 0.11/0.40 # Requested 8, 32 cores available to the main process. % 0.11/0.40 # There are not enough tableaux to fork, creating more from the initial 6 % 0.11/0.40 # Returning from population with 73 new_tableaux and 0 remaining starting tableaux. % 0.11/0.40 # We now have 73 tableaux to operate on % 0.11/0.42 # There were 4 total branch saturation attempts. % 0.11/0.42 # There were 0 of these attempts blocked. % 0.11/0.42 # There were 0 deferred branch saturation attempts. % 0.11/0.42 # There were 0 free duplicated saturations. % 0.11/0.42 # There were 4 total successful branch saturations. % 0.11/0.42 # There were 0 successful branch saturations in interreduction. % 0.11/0.42 # There were 0 successful branch saturations on the branch. % 0.11/0.42 # There were 4 successful branch saturations after the branch. % 0.11/0.42 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.42 # Begin clausification derivation % 0.11/0.42 % 0.11/0.42 # End clausification derivation % 0.11/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.42 cnf(i_0_7, negated_conjecture, (p15(esk2_0))). % 0.11/0.42 cnf(i_0_5, negated_conjecture, (p1(esk3_0))). % 0.11/0.42 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk2_0))). % 0.11/0.42 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk4_0))). % 0.11/0.42 cnf(i_0_6, negated_conjecture, (r1(esk2_0,esk3_0))). % 0.11/0.42 cnf(i_0_1, plain, (r1(X1,X1))). % 0.11/0.42 cnf(i_0_3, negated_conjecture, (epred1_1(X1)|~r1(esk4_0,X1))). % 0.11/0.42 cnf(i_0_36, plain, (~epred1_1(X1)|~p15(esk18_1(X1)))). % 0.11/0.42 cnf(i_0_9, plain, (~epred1_1(X1)|~p2(esk19_1(X1))|~p1(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_33, plain, (~epred1_1(X1)|~p13(esk19_1(X1))|~p14(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_31, plain, (~epred1_1(X1)|~p12(esk19_1(X1))|~p13(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_76, plain, (r1(X1,esk5_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_37, plain, (r1(X1,esk18_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_35, plain, (r1(X1,esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_29, plain, (~epred1_1(X1)|~p11(esk19_1(X1))|~p12(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_27, plain, (~epred1_1(X1)|~p10(esk19_1(X1))|~p11(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_10, plain, (p2(esk19_1(X1))|p1(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_75, plain, (r1(esk5_1(X1),esk6_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_25, plain, (~epred1_1(X1)|~p9(esk19_1(X1))|~p10(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_23, plain, (~epred1_1(X1)|~p8(esk19_1(X1))|~p9(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_21, plain, (~epred1_1(X1)|~p7(esk19_1(X1))|~p8(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_19, plain, (~epred1_1(X1)|~p6(esk19_1(X1))|~p7(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_74, plain, (r1(esk6_1(X1),esk7_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_17, plain, (~epred1_1(X1)|~p5(esk19_1(X1))|~p6(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_15, plain, (~epred1_1(X1)|~p4(esk19_1(X1))|~p5(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_13, plain, (~epred1_1(X1)|~p3(esk19_1(X1))|~p4(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_11, plain, (~epred1_1(X1)|~p2(esk19_1(X1))|~p3(esk19_1(X1)))). % 0.11/0.42 cnf(i_0_34, plain, (p13(esk19_1(X1))|p14(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_73, plain, (r1(esk7_1(X1),esk8_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_38, plain, (p2(X1)|~epred1_1(X2)|~p1(X1)|~r1(X2,X1))). % 0.11/0.42 cnf(i_0_62, plain, (p14(X1)|~epred1_1(X2)|~p13(X1)|~r1(esk16_1(X2),X1))). % 0.11/0.42 cnf(i_0_63, plain, (p13(X1)|~epred1_1(X2)|~p14(X1)|~r1(esk16_1(X2),X1))). % 0.11/0.42 cnf(i_0_60, plain, (p13(X1)|~epred1_1(X2)|~p12(X1)|~r1(esk15_1(X2),X1))). % 0.11/0.42 cnf(i_0_72, plain, (r1(esk8_1(X1),esk9_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_39, plain, (p1(X1)|~epred1_1(X2)|~p2(X1)|~r1(X2,X1))). % 0.11/0.42 cnf(i_0_71, plain, (r1(esk9_1(X1),esk10_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_70, plain, (r1(esk10_1(X1),esk11_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_69, plain, (r1(esk11_1(X1),esk12_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_32, plain, (p12(esk19_1(X1))|p13(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_68, plain, (r1(esk12_1(X1),esk13_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_61, plain, (p12(X1)|~epred1_1(X2)|~p13(X1)|~r1(esk15_1(X2),X1))). % 0.11/0.42 cnf(i_0_58, plain, (p12(X1)|~epred1_1(X2)|~p11(X1)|~r1(esk14_1(X2),X1))). % 0.11/0.42 cnf(i_0_59, plain, (p11(X1)|~epred1_1(X2)|~p12(X1)|~r1(esk14_1(X2),X1))). % 0.11/0.42 cnf(i_0_56, plain, (p11(X1)|~epred1_1(X2)|~p10(X1)|~r1(esk13_1(X2),X1))). % 0.11/0.42 cnf(i_0_67, plain, (r1(esk13_1(X1),esk14_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_66, plain, (r1(esk14_1(X1),esk15_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_65, plain, (r1(esk15_1(X1),esk16_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_64, plain, (r1(esk16_1(X1),esk17_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_57, plain, (p10(X1)|~epred1_1(X2)|~p11(X1)|~r1(esk13_1(X2),X1))). % 0.11/0.42 cnf(i_0_30, plain, (p11(esk19_1(X1))|p12(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_28, plain, (p10(esk19_1(X1))|p11(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_54, plain, (p10(X1)|~epred1_1(X2)|~p9(X1)|~r1(esk12_1(X2),X1))). % 0.11/0.42 cnf(i_0_55, plain, (p9(X1)|~epred1_1(X2)|~p10(X1)|~r1(esk12_1(X2),X1))). % 0.11/0.42 cnf(i_0_52, plain, (p9(X1)|~epred1_1(X2)|~p8(X1)|~r1(esk11_1(X2),X1))). % 0.11/0.42 cnf(i_0_53, plain, (p8(X1)|~epred1_1(X2)|~p9(X1)|~r1(esk11_1(X2),X1))). % 0.11/0.42 cnf(i_0_26, plain, (p9(esk19_1(X1))|p10(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_50, plain, (p8(X1)|~epred1_1(X2)|~p7(X1)|~r1(esk10_1(X2),X1))). % 0.11/0.42 cnf(i_0_51, plain, (p7(X1)|~epred1_1(X2)|~p8(X1)|~r1(esk10_1(X2),X1))). % 0.11/0.42 cnf(i_0_48, plain, (p7(X1)|~epred1_1(X2)|~p6(X1)|~r1(esk9_1(X2),X1))). % 0.11/0.42 cnf(i_0_49, plain, (p6(X1)|~epred1_1(X2)|~p7(X1)|~r1(esk9_1(X2),X1))). % 0.11/0.42 cnf(i_0_24, plain, (p8(esk19_1(X1))|p9(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_22, plain, (p7(esk19_1(X1))|p8(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_46, plain, (p6(X1)|~epred1_1(X2)|~p5(X1)|~r1(esk8_1(X2),X1))). % 0.11/0.42 cnf(i_0_47, plain, (p5(X1)|~epred1_1(X2)|~p6(X1)|~r1(esk8_1(X2),X1))). % 0.11/0.42 cnf(i_0_44, plain, (p5(X1)|~epred1_1(X2)|~p4(X1)|~r1(esk7_1(X2),X1))). % 0.11/0.42 cnf(i_0_45, plain, (p4(X1)|~epred1_1(X2)|~p5(X1)|~r1(esk7_1(X2),X1))). % 0.11/0.42 cnf(i_0_20, plain, (p6(esk19_1(X1))|p7(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_42, plain, (p4(X1)|~epred1_1(X2)|~p3(X1)|~r1(esk6_1(X2),X1))). % 0.11/0.42 cnf(i_0_43, plain, (p3(X1)|~epred1_1(X2)|~p4(X1)|~r1(esk6_1(X2),X1))). % 0.11/0.42 cnf(i_0_40, plain, (p3(X1)|~epred1_1(X2)|~p2(X1)|~r1(esk5_1(X2),X1))). % 0.11/0.42 cnf(i_0_41, plain, (p2(X1)|~epred1_1(X2)|~p3(X1)|~r1(esk5_1(X2),X1))). % 0.11/0.42 cnf(i_0_18, plain, (p5(esk19_1(X1))|p6(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_16, plain, (p4(esk19_1(X1))|p5(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))). % 0.11/0.42 cnf(i_0_14, plain, (p3(esk19_1(X1))|p4(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 cnf(i_0_12, plain, (p2(esk19_1(X1))|p3(esk19_1(X1))|~epred1_1(X1))). % 0.11/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.42 # Begin printing tableau % 0.11/0.42 # Found 9 steps % 0.11/0.42 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk2_0)), inference(start_rule)). % 0.11/0.42 cnf(i_0_81, plain, (r1(esk1_0,esk2_0)), inference(extension_rule, [i_0_38])). % 0.11/0.42 cnf(i_0_362, plain, (p2(esk2_0)), inference(extension_rule, [i_0_40])). % 0.11/0.42 cnf(i_0_363, plain, (~epred1_1(esk1_0)), inference(etableau_closure_rule, [i_0_363, ...])). % 0.11/0.42 cnf(i_0_364, plain, (~p1(esk2_0)), inference(etableau_closure_rule, [i_0_364, ...])). % 0.11/0.42 cnf(i_0_556, plain, (p3(esk2_0)), inference(etableau_closure_rule, [i_0_556, ...])). % 0.11/0.42 cnf(i_0_557, plain, (~epred1_1(esk4_0)), inference(extension_rule, [i_0_3])). % 0.11/0.42 cnf(i_0_1003, plain, (~r1(esk4_0,esk4_0)), inference(closure_rule, [i_0_1])). % 0.11/0.42 cnf(i_0_559, plain, (~r1(esk5_1(esk4_0),esk2_0)), inference(etableau_closure_rule, [i_0_559, ...])). % 0.11/0.42 # End printing tableau % 0.11/0.42 # SZS output end % 0.11/0.42 # Branches closed with saturation will be marked with an "s" % 0.11/0.42 # Child (3907502) has found a proof. % 0.11/0.42 % 0.11/0.43 # Proof search is over... % 0.11/0.43 # Freeing feature tree %------------------------------------------------------------------------------