%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL656+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 : n002.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:38 PM UTC 2026 % Result : Theorem 0.16s 0.49s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.04 % Problem : LCL656+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.06 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.16/0.42 % Computer : n002.cluster.edu % 0.16/0.42 % Model : x86_64 x86_64 % 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.42 % Memory : 8046.5625MB % 0.16/0.42 % OS : Linux 6.8.0-71-generic % 0.16/0.42 % CPULimit : 300 % 0.16/0.42 % WCLimit : 300 % 0.16/0.42 % DateTime : Sat Sep 5 02:17:20 UTC 2026 % 0.16/0.43 % CPUTime : % 0.16/0.48 # No SInE strategy applied % 0.16/0.48 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN % 0.16/0.48 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.16/0.48 # % 0.16/0.48 # Presaturation interreduction done % 0.16/0.48 # Number of axioms: 18 Number of unprocessed: 17 % 0.16/0.48 # Tableaux proof search. % 0.16/0.48 # APR header successfully linked. % 0.16/0.48 # Hello from C++ % 0.16/0.48 # The folding up rule is enabled... % 0.16/0.48 # Local unification is enabled... % 0.16/0.48 # Any saturation attempts will use folding labels... % 0.16/0.48 # 17 beginning clauses after preprocessing and clausification % 0.16/0.48 # Creating start rules for all 16 conjectures. % 0.16/0.48 # There are 16 start rule candidates: % 0.16/0.48 # Found 3 unit axioms. % 0.16/0.48 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.16/0.48 # 16 start rule tableaux created. % 0.16/0.48 # 14 extension rule candidate clauses % 0.16/0.48 # 3 unit axiom clauses % 0.16/0.48 % 0.16/0.48 # Requested 8, 32 cores available to the main process. % 0.16/0.49 # Closed tableau found in foldup close cycle with 3 folds and 4 closures done. % 0.16/0.49 # There were 0 total branch saturation attempts. % 0.16/0.49 # There were 0 of these attempts blocked. % 0.16/0.49 # There were 0 deferred branch saturation attempts. % 0.16/0.49 # There were 0 free duplicated saturations. % 0.16/0.49 # There were 0 total successful branch saturations. % 0.16/0.49 # There were 0 successful branch saturations in interreduction. % 0.16/0.49 # There were 0 successful branch saturations on the branch. % 0.16/0.49 # There were 0 successful branch saturations after the branch. % 0.16/0.49 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.16/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.16/0.49 # Begin clausification derivation % 0.16/0.49 % 0.16/0.49 # End clausification derivation % 0.16/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.16/0.49 cnf(i_0_2, negated_conjecture, (p100(esk1_0))). % 0.16/0.49 cnf(i_0_1, plain, (r1(X1,X1))). % 0.16/0.49 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))). % 0.16/0.49 cnf(i_0_18, negated_conjecture, (p2(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_5, negated_conjecture, (p101(X1)|~p102(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_4, negated_conjecture, (p100(X1)|~p101(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_12, negated_conjecture, (p101(X1)|p2(esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_16, negated_conjecture, (p101(X1)|~p100(X1)|~p2(esk2_1(X1))|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_15, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk2_1(X1))|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_11, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk3_1(X1))|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_14, negated_conjecture, (p101(esk2_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_10, negated_conjecture, (p101(esk3_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_17, negated_conjecture, (p101(X1)|r1(X1,esk2_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_13, negated_conjecture, (p101(X1)|r1(X1,esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_8, negated_conjecture, (p2(X1)|~p101(X1)|~p101(X2)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.16/0.49 cnf(i_0_6, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.16/0.49 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(esk1_0,X1)|~r1(X1,X2))). % 0.16/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.16/0.49 # Begin printing tableau % 0.16/0.49 # Found 15 steps % 0.16/0.49 cnf(i_0_17, negated_conjecture, (p101(esk1_0)|r1(esk1_0,esk2_1(esk1_0))|~p100(esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). % 0.16/0.49 cnf(i_0_40, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.16/0.49 cnf(i_0_42, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 0.16/0.49 cnf(i_0_43, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.16/0.49 cnf(i_0_41, plain, (r1(esk1_0,esk2_1(esk1_0))), inference(extension_rule, [i_0_8])). % 0.16/0.49 cnf(i_0_322, plain, (~r1(esk2_1(esk1_0),esk2_1(esk1_0))), inference(closure_rule, [i_0_1])). % 0.16/0.49 cnf(i_0_318, plain, (p2(esk2_1(esk1_0))), inference(extension_rule, [i_0_16])). % 0.16/0.49 cnf(i_0_347, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.16/0.49 cnf(i_0_348, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 0.16/0.49 cnf(i_0_350, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.16/0.49 cnf(i_0_319, plain, (~p101(esk2_1(esk1_0))), inference(extension_rule, [i_0_14])). % 0.16/0.49 cnf(i_0_364, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.16/0.49 cnf(i_0_365, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 0.16/0.49 cnf(i_0_366, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.16/0.49 cnf(i_0_320, plain, (~p101(esk2_1(esk1_0))), inference(closure_rule, [i_0_319])). % 0.16/0.49 # End printing tableau % 0.16/0.49 # SZS output end % 0.16/0.49 # Branches closed with saturation will be marked with an "s" % 0.16/0.49 # Closed tableau found in foldup close cycle with 1 folds and 3 closures done. % 0.16/0.49 # There were 0 total branch saturation attempts. % 0.16/0.49 # There were 0 of these attempts blocked. % 0.16/0.49 # There were 0 deferred branch saturation attempts. % 0.16/0.49 # There were 0 free duplicated saturations. % 0.16/0.49 # There were 0 total successful branch saturations. % 0.16/0.49 # There were 0 successful branch saturations in interreduction. % 0.16/0.49 # There were 0 successful branch saturations on the branch. % 0.16/0.49 # There were 0 successful branch saturations after the branch. % 0.16/0.49 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.16/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.16/0.49 # Begin clausification derivation % 0.16/0.49 % 0.16/0.49 # End clausification derivation % 0.16/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.16/0.49 cnf(i_0_2, negated_conjecture, (p100(esk1_0))). % 0.16/0.49 cnf(i_0_1, plain, (r1(X1,X1))). % 0.16/0.49 cnf(i_0_3, negated_conjecture, (~p101(esk1_0))). % 0.16/0.49 cnf(i_0_18, negated_conjecture, (p2(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_5, negated_conjecture, (p101(X1)|~p102(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_4, negated_conjecture, (p100(X1)|~p101(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_12, negated_conjecture, (p101(X1)|p2(esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_16, negated_conjecture, (p101(X1)|~p100(X1)|~p2(esk2_1(X1))|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_15, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk2_1(X1))|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_11, negated_conjecture, (p101(X1)|~p100(X1)|~p102(esk3_1(X1))|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_14, negated_conjecture, (p101(esk2_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_10, negated_conjecture, (p101(esk3_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_17, negated_conjecture, (p101(X1)|r1(X1,esk2_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_13, negated_conjecture, (p101(X1)|r1(X1,esk3_1(X1))|~p100(X1)|~r1(esk1_0,X1))). % 0.16/0.49 cnf(i_0_8, negated_conjecture, (p2(X1)|~p101(X1)|~p101(X2)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.16/0.49 cnf(i_0_6, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X1)|~p100(X2)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.16/0.49 cnf(i_0_7, negated_conjecture, (p1(X1)|~p1(X2)|~p100(X2)|~p100(X1)|~r1(esk1_0,X1)|~r1(X1,X2))). % 0.16/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.16/0.49 # Begin printing tableau % 0.16/0.49 # Found 15 steps % 0.16/0.49 cnf(i_0_14, negated_conjecture, (p101(esk2_1(esk1_0))|p101(esk1_0)|~p100(esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). % 0.16/0.49 cnf(i_0_49, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.16/0.49 cnf(i_0_50, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 0.16/0.49 cnf(i_0_51, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.16/0.49 cnf(i_0_48, plain, (p101(esk2_1(esk1_0))), inference(extension_rule, [i_0_8])). % 0.16/0.49 cnf(i_0_92, plain, (~p101(esk2_1(esk1_0))), inference(closure_rule, [i_0_48])). % 0.16/0.49 cnf(i_0_94, plain, (~r1(esk2_1(esk1_0),esk2_1(esk1_0))), inference(closure_rule, [i_0_1])). % 0.16/0.49 cnf(i_0_90, plain, (p2(esk2_1(esk1_0))), inference(extension_rule, [i_0_16])). % 0.16/0.49 cnf(i_0_131, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.16/0.49 cnf(i_0_132, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 0.16/0.49 cnf(i_0_134, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.16/0.49 cnf(i_0_93, plain, (~r1(esk1_0,esk2_1(esk1_0))), inference(extension_rule, [i_0_17])). % 0.16/0.49 cnf(i_0_151, plain, (p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.16/0.49 cnf(i_0_153, plain, (~p100(esk1_0)), inference(closure_rule, [i_0_2])). % 0.16/0.49 cnf(i_0_154, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.16/0.49 # End printing tableau % 0.16/0.49 # SZS output end % 0.16/0.49 # Branches closed with saturation will be marked with an "s" % 0.16/0.49 # Child (2382792) has found a proof. % 0.16/0.49 % 0.16/0.49 # Proof search is over... % 0.16/0.49 # Freeing feature tree %------------------------------------------------------------------------------