%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL116-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 : n012.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:38 PM UTC 2026 % Result : Unsatisfiable 51.77s 52.05s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.01 % Problem : LCL116-1 : TPTP v9.3.1. Released v1.0.0. % 0.00/0.02 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.03/0.29 % Computer : n012.cluster.edu % 0.03/0.29 % Model : x86_64 x86_64 % 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.03/0.29 % Memory : 8046.5625MB % 0.03/0.29 % OS : Linux 6.8.0-71-generic % 0.03/0.29 % CPULimit : 300 % 0.03/0.29 % WCLimit : 300 % 0.03/0.29 % DateTime : Sat Sep 5 04:00:57 UTC 2026 % 0.03/0.29 % CPUTime : % 0.03/0.31 # No SInE strategy applied % 0.03/0.31 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I % 0.03/0.31 # and selection function SelectCQArEqLast. % 0.03/0.31 # % 0.03/0.31 # Presaturation interreduction done % 0.03/0.31 # Number of axioms: 6 Number of unprocessed: 6 % 0.03/0.31 # Tableaux proof search. % 0.03/0.31 # APR header successfully linked. % 0.03/0.31 # Hello from C++ % 3.16/3.40 # The folding up rule is enabled... % 3.16/3.40 # Local unification is enabled... % 3.16/3.40 # Any saturation attempts will use folding labels... % 3.16/3.40 # 6 beginning clauses after preprocessing and clausification % 3.16/3.40 # Creating start rules for all 1 conjectures. % 3.16/3.40 # There are 1 start rule candidates: % 3.16/3.40 # Found 5 unit axioms. % 3.16/3.40 # 1 start rule tableaux created. % 3.16/3.40 # 1 extension rule candidate clauses % 3.16/3.40 # 5 unit axiom clauses % 3.16/3.40 % 3.16/3.40 # Requested 8, 32 cores available to the main process. % 3.16/3.40 # There are not enough tableaux to fork, creating more from the initial 1 % 11.77/12.11 # Ran out of tableaux, making start rules for all clauses % 51.77/52.05 # There were 12 total branch saturation attempts. % 51.77/52.05 # There were 0 of these attempts blocked. % 51.77/52.05 # There were 0 deferred branch saturation attempts. % 51.77/52.05 # There were 0 free duplicated saturations. % 51.77/52.05 # There were 1 total successful branch saturations. % 51.77/52.05 # There were 0 successful branch saturations in interreduction. % 51.77/52.05 # There were 0 successful branch saturations on the branch. % 51.77/52.05 # There were 1 successful branch saturations after the branch. % 51.77/52.05 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 51.77/52.05 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 51.77/52.05 # Begin clausification derivation % 51.77/52.05 % 51.77/52.05 # End clausification derivation % 51.77/52.05 # Begin listing active clauses obtained from FOF to CNF conversion % 51.77/52.05 cnf(i_0_8, plain, (is_a_theorem(implies(X1,implies(X2,X1))))). % 51.77/52.05 cnf(i_0_11, plain, (is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 51.77/52.05 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))). % 51.77/52.05 cnf(i_0_10, plain, (is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))))). % 51.77/52.05 cnf(i_0_12, negated_conjecture, (~is_a_theorem(implies(not(a),implies(b,not(implies(b,a))))))). % 51.77/52.05 cnf(i_0_7, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). % 51.77/52.05 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 51.77/52.05 # Begin printing tableau % 51.77/52.05 # Found 8 steps % 51.77/52.05 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(start_rule)). % 51.77/52.05 cnf(i_0_1423414, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(extension_rule, [i_0_7])). % 51.77/52.05 cnf(i_0_6775065, plain, (is_a_theorem(implies(not(a),implies(b,not(implies(b,a)))))), inference(closure_rule, [i_0_12])). % 51.77/52.05 cnf(i_0_6775066, plain, (~is_a_theorem(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(not(a),implies(b,not(implies(b,a))))))), inference(extension_rule, [i_0_7])). % 51.77/52.05 cnf(i_0_6775069, plain, (~is_a_theorem(implies(implies(not(a),implies(b,not(implies(b,a)))),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(not(a),implies(b,not(implies(b,a)))))))), inference(closure_rule, [i_0_8])). % 51.77/52.05 cnf(i_0_6775070, plain, (~is_a_theorem(implies(not(a),implies(b,not(implies(b,a)))))), inference(extension_rule, [i_0_7])). % 51.77/52.05 cnf(i_0_7484819, plain, (~is_a_theorem(implies(implies(b,not(implies(b,a))),implies(not(a),implies(b,not(implies(b,a))))))), inference(closure_rule, [i_0_8])). % 51.77/52.05 cnf(i_0_7484820, plain, (~is_a_theorem(implies(b,not(implies(b,a))))), inference(etableau_closure_rule, [i_0_7484820, ...])). % 51.77/52.05 # End printing tableau % 51.77/52.05 # SZS output end % 51.77/52.05 # Branches closed with saturation will be marked with an "s" % 51.77/52.05 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 51.77/52.05 # We now have 5 tableaux to operate on % 51.77/52.05 # Found closed tableau during pool population. % 51.77/52.05 # Proof search is over... % 51.77/52.05 # Freeing feature tree %------------------------------------------------------------------------------