%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL684+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 : n010.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:47 PM UTC 2026 % Result : Theorem 0.13s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL684+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.08/0.36 % Computer : n010.cluster.edu % 0.08/0.36 % Model : x86_64 x86_64 % 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.36 % Memory : 8046.5625MB % 0.08/0.36 % OS : Linux 6.8.0-71-generic % 0.08/0.36 % CPULimit : 300 % 0.08/0.36 % WCLimit : 300 % 0.08/0.36 % DateTime : Sat Sep 5 16:33:09 UTC 2026 % 0.08/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 5 Number of unprocessed: 5 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 5 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 3 conjectures. % 0.13/0.39 # There are 3 start rule candidates: % 0.13/0.39 # Found 3 unit axioms. % 0.13/0.39 # Closed tableau found in foldup close cycle with 0 folds and 4 closures done. % 0.13/0.39 # Found closed tableau while making start rule % 0.13/0.39 # There were 0 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 0 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 0 successful branch saturations after the branch. % 0.13/0.39 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_4, negated_conjecture, (p201(esk1_0))). % 0.13/0.39 cnf(i_0_3, negated_conjecture, (p101(esk1_0))). % 0.13/0.39 cnf(i_0_1, plain, (r1(X1,X1))). % 0.13/0.39 cnf(i_0_5, negated_conjecture, (~p101(X1)|~p201(X1)|~r1(esk1_0,X2)|~r1(X2,X1))). % 0.13/0.39 cnf(i_0_2, plain, (r1(X1,X2)|~r1(X3,X2)|~r1(X1,X3))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_5, negated_conjecture, (~p101(esk1_0)|~p201(esk1_0)|~r1(esk1_0,esk1_0)|~r1(esk1_0,esk1_0)), inference(start_rule)). % 0.13/0.39 cnf(i_0_6, plain, (~p101(esk1_0)), inference(closure_rule, [i_0_3])). % 0.13/0.39 cnf(i_0_7, plain, (~p201(esk1_0)), inference(closure_rule, [i_0_4])). % 0.13/0.39 cnf(i_0_8, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.13/0.39 cnf(i_0_9, plain, (~r1(esk1_0,esk1_0)), inference(closure_rule, [i_0_1])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # NOT attempting initial tableau saturation % 0.13/0.39 # 1 start rule tableaux created. % 0.13/0.39 # 2 extension rule candidate clauses % 0.13/0.39 # 3 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------