%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL059-1 : TPTP v9.3.1. Released v1.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:00:31 PM UTC 2026 % Result : Unsatisfiable 7.36s 7.63s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL059-1 : TPTP v9.3.1. Released v1.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.36 % Computer : n010.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Fri Sep 4 14:00:53 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.39 # No SInE strategy applied % 0.09/0.39 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V % 0.09/0.39 # and selection function PSelectComplexExceptRRHorn. % 0.09/0.39 # % 0.09/0.39 # Presaturation interreduction done % 0.09/0.39 # Number of axioms: 5 Number of unprocessed: 5 % 0.09/0.39 # Tableaux proof search. % 0.09/0.39 # APR header successfully linked. % 0.09/0.39 # Hello from C++ % 0.57/0.87 # The folding up rule is enabled... % 0.57/0.87 # Local unification is enabled... % 0.57/0.87 # Any saturation attempts will use folding labels... % 0.57/0.87 # 5 beginning clauses after preprocessing and clausification % 0.57/0.87 # Creating start rules for all 1 conjectures. % 0.57/0.87 # There are 1 start rule candidates: % 0.57/0.87 # Found 4 unit axioms. % 0.57/0.87 # 1 start rule tableaux created. % 0.57/0.87 # 1 extension rule candidate clauses % 0.57/0.87 # 4 unit axiom clauses % 0.57/0.87 % 0.57/0.87 # Requested 8, 32 cores available to the main process. % 0.57/0.87 # There are not enough tableaux to fork, creating more from the initial 1 % 1.56/1.88 # Ran out of tableaux, making start rules for all clauses % 7.36/7.63 # There were 13 total branch saturation attempts. % 7.36/7.63 # There were 0 of these attempts blocked. % 7.36/7.63 # There were 0 deferred branch saturation attempts. % 7.36/7.63 # There were 0 free duplicated saturations. % 7.36/7.63 # There were 1 total successful branch saturations. % 7.36/7.63 # There were 0 successful branch saturations in interreduction. % 7.36/7.63 # There were 0 successful branch saturations on the branch. % 7.36/7.63 # There were 1 successful branch saturations after the branch. % 7.36/7.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.36/7.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.36/7.63 # Begin clausification derivation % 7.36/7.63 % 7.36/7.63 # End clausification derivation % 7.36/7.63 # Begin listing active clauses obtained from FOF to CNF conversion % 7.36/7.63 cnf(i_0_9, plain, (is_a_theorem(implies(X1,implies(not(X1),X2))))). % 7.36/7.63 cnf(i_0_8, plain, (is_a_theorem(implies(implies(not(X1),X1),X1)))). % 7.36/7.63 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))). % 7.36/7.63 cnf(i_0_10, negated_conjecture, (~is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))))). % 7.36/7.63 cnf(i_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). % 7.36/7.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.36/7.63 # Begin printing tableau % 7.36/7.63 # Found 6 steps % 7.36/7.63 cnf(i_0_7, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(start_rule)). % 7.36/7.63 cnf(i_0_57548, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(extension_rule, [i_0_6])). % 7.36/7.63 cnf(i_0_387161, plain, (is_a_theorem(implies(implies(not(a),not(b)),implies(b,a)))), inference(closure_rule, [i_0_10])). % 7.36/7.63 cnf(i_0_387162, plain, (~is_a_theorem(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a))))), inference(extension_rule, [i_0_6])). % 7.36/7.63 cnf(i_0_387165, plain, (~is_a_theorem(implies(implies(not(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))))), inference(closure_rule, [i_0_8])). % 7.36/7.63 cnf(i_0_387166, plain, (~is_a_theorem(implies(not(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(not(a),not(b)),implies(b,a)))))), inference(etableau_closure_rule, [i_0_387166, ...])). % 7.36/7.63 # End printing tableau % 7.36/7.63 # SZS output end % 7.36/7.63 # Branches closed with saturation will be marked with an "s" % 7.36/7.63 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 7.36/7.63 # We now have 4 tableaux to operate on % 7.36/7.63 # Found closed tableau during pool population. % 7.36/7.63 # Proof search is over... % 7.36/7.63 # Freeing feature tree %------------------------------------------------------------------------------