%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL678+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 : n008.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:45 PM UTC 2026 % Result : Theorem 0.09s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL678+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.37 % Computer : n008.cluster.edu % 0.09/0.37 % Model : x86_64 x86_64 % 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.37 % Memory : 8046.5625MB % 0.09/0.37 % OS : Linux 6.8.0-71-generic % 0.09/0.37 % CPULimit : 300 % 0.09/0.37 % WCLimit : 300 % 0.09/0.37 % DateTime : Sat Sep 5 23:56:53 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___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.40 # % 0.09/0.40 # Presaturation interreduction done % 0.09/0.40 # Number of axioms: 6 Number of unprocessed: 6 % 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 # 6 beginning clauses after preprocessing and clausification % 0.09/0.40 # Creating start rules for all 4 conjectures. % 0.09/0.40 # There are 4 start rule candidates: % 0.09/0.40 # Found 1 unit axioms. % 0.09/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.40 # 4 start rule tableaux created. % 0.09/0.40 # 5 extension rule candidate clauses % 0.09/0.40 # 1 unit axiom clauses % 0.09/0.40 % 0.09/0.40 # Requested 8, 32 cores available to the main process. % 0.09/0.40 # There are not enough tableaux to fork, creating more from the initial 4 % 0.09/0.40 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.09/0.40 # We now have 9 tableaux to operate on % 0.09/0.40 # There were 1 total branch saturation attempts. % 0.09/0.40 # There were 0 of these attempts blocked. % 0.09/0.40 # There were 0 deferred branch saturation attempts. % 0.09/0.40 # There were 0 free duplicated saturations. % 0.09/0.40 # There were 1 total successful branch saturations. % 0.09/0.40 # There were 1 successful branch saturations in interreduction. % 0.09/0.40 # There were 0 successful branch saturations on the branch. % 0.09/0.40 # There were 0 successful branch saturations after the branch. % 0.09/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.40 # Begin clausification derivation % 0.09/0.40 % 0.09/0.40 # End clausification derivation % 0.09/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.09/0.40 cnf(i_0_1, plain, (r1(X1,X1))). % 0.09/0.40 cnf(i_0_4, negated_conjecture, (~p1(esk3_1(X1))|~r1(esk1_0,X1))). % 0.09/0.40 cnf(i_0_6, negated_conjecture, (r1(X1,esk2_1(X1))|~r1(esk1_0,X1))). % 0.09/0.40 cnf(i_0_3, negated_conjecture, (p1(X1)|~r1(esk2_1(X2),X1)|~r1(esk1_0,X2))). % 0.09/0.40 cnf(i_0_5, negated_conjecture, (r1(esk2_1(X1),esk3_1(X1))|~r1(esk1_0,X1))). % 0.09/0.40 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))). % 0.09/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.09/0.40 # Begin printing tableau % 0.09/0.40 # Found 8 steps % 0.09/0.40 cnf(i_0_4, negated_conjecture, (~p1(esk3_1(esk1_0))|~r1(esk1_0,esk1_0)), inference(start_rule)). % 0.09/0.40 cnf(i_0_15, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.09/0.40 cnf(i_0_14, plain, (~p1(esk3_1(esk1_0))), inference(extension_rule, [i_0_3])). % 0.09/0.40 cnf(i_0_59, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.09/0.40 cnf(i_0_58, plain, (~r1(esk2_1(esk1_0),esk3_1(esk1_0))), inference(extension_rule, [i_0_2])). % 0.09/0.40 cnf(i_0_61, plain, (~r1(esk2_1(esk1_0),esk3_1(esk1_0))), inference(extension_rule, [i_0_5])). % 0.09/0.40 cnf(i_0_64, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.09/0.40 cnf(i_0_62, plain, (~r1(esk2_1(esk1_0),esk2_1(esk1_0))), inference(etableau_closure_rule, [i_0_62, ...])). % 0.09/0.40 # End printing tableau % 0.09/0.40 # SZS output end % 0.09/0.40 # Branches closed with saturation will be marked with an "s" % 0.09/0.41 # Child (1181877) has found a proof. % 0.09/0.41 % 0.09/0.41 # Ran out of tableaux, making start rules for all clauses % 0.09/0.41 # Proof search is over... % 0.09/0.41 # Freeing feature tree %------------------------------------------------------------------------------