%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL646+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 : n019.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:34 PM UTC 2026 % Result : Theorem 0.12s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.03 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.35 % Computer : n019.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Sat Sep 5 11:41:23 UTC 2026 % 0.09/0.36 % CPUTime : % 0.12/0.39 # No SInE strategy applied % 0.12/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.39 # % 0.12/0.39 # Presaturation interreduction done % 0.12/0.39 # Number of axioms: 12 Number of unprocessed: 11 % 0.12/0.39 # Tableaux proof search. % 0.12/0.39 # APR header successfully linked. % 0.12/0.39 # Hello from C++ % 0.12/0.39 # The folding up rule is enabled... % 0.12/0.39 # Local unification is enabled... % 0.12/0.39 # Any saturation attempts will use folding labels... % 0.12/0.39 # 11 beginning clauses after preprocessing and clausification % 0.12/0.39 # Creating start rules for all 11 conjectures. % 0.12/0.39 # There are 11 start rule candidates: % 0.12/0.39 # Found 8 unit axioms. % 0.12/0.39 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.12/0.39 # Found closed tableau while making start rule % 0.12/0.39 # There were 0 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 0 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 0 successful branch saturations after the branch. % 0.12/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_8, negated_conjecture, (r1(esk1_0,esk2_0))). % 0.12/0.39 cnf(i_0_6, negated_conjecture, (r1(esk1_0,esk3_0))). % 0.12/0.39 cnf(i_0_4, negated_conjecture, (r1(esk1_0,esk4_0))). % 0.12/0.39 cnf(i_0_2, negated_conjecture, (r1(esk1_0,esk5_0))). % 0.12/0.39 cnf(i_0_3, negated_conjecture, (~p2(esk4_0))). % 0.12/0.39 cnf(i_0_7, negated_conjecture, (~p5(esk2_0))). % 0.12/0.39 cnf(i_0_5, negated_conjecture, (~p3(esk3_0))). % 0.12/0.39 cnf(i_0_1, negated_conjecture, (~p1(esk5_0))). % 0.12/0.39 cnf(i_0_12, negated_conjecture, (p6(X1)|~r1(esk1_0,X1))). % 0.12/0.39 cnf(i_0_9, negated_conjecture, (p2(X1)|~r1(esk1_0,X1))). % 0.12/0.39 cnf(i_0_10, negated_conjecture, (p4(X1)|~r1(esk1_0,X1))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 3 steps % 0.12/0.39 cnf(i_0_9, negated_conjecture, (p2(esk4_0)|~r1(esk1_0,esk4_0)), inference(start_rule)). % 0.12/0.39 cnf(i_0_15, plain, (p2(esk4_0)), inference(closure_rule, [i_0_3])). % 0.12/0.39 cnf(i_0_16, plain, (~r1(esk1_0,esk4_0)), inference(closure_rule, [i_0_4])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # NOT attempting initial tableau saturation % 0.12/0.39 # 2 start rule tableaux created. % 0.12/0.39 # 3 extension rule candidate clauses % 0.12/0.39 # 8 unit axiom clauses % 0.12/0.39 % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------