%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL072-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 : n005.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:33 PM UTC 2026 % Result : Unsatisfiable 1.57s 1.89s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL072-1 : TPTP v9.3.1. Released v1.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.08/0.35 % Computer : n005.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 10:02:50 UTC 2026 % 0.13/0.36 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V % 0.13/0.39 # and selection function PSelectComplexExceptRRHorn. % 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.67/0.93 # The folding up rule is enabled... % 0.67/0.93 # Local unification is enabled... % 0.67/0.93 # Any saturation attempts will use folding labels... % 0.67/0.93 # 5 beginning clauses after preprocessing and clausification % 0.67/0.93 # Creating start rules for all 1 conjectures. % 0.67/0.93 # There are 1 start rule candidates: % 0.67/0.93 # Found 4 unit axioms. % 0.67/0.93 # 1 start rule tableaux created. % 0.67/0.93 # 1 extension rule candidate clauses % 0.67/0.93 # 4 unit axiom clauses % 0.67/0.93 % 0.67/0.93 # Requested 8, 32 cores available to the main process. % 0.67/0.93 # There are not enough tableaux to fork, creating more from the initial 1 % 1.57/1.87 # Ran out of tableaux, making start rules for all clauses % 1.57/1.89 # There were 3 total branch saturation attempts. % 1.57/1.89 # There were 0 of these attempts blocked. % 1.57/1.89 # There were 0 deferred branch saturation attempts. % 1.57/1.89 # There were 0 free duplicated saturations. % 1.57/1.89 # There were 1 total successful branch saturations. % 1.57/1.89 # There were 0 successful branch saturations in interreduction. % 1.57/1.89 # There were 0 successful branch saturations on the branch. % 1.57/1.89 # There were 1 successful branch saturations after the branch. % 1.57/1.89 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.57/1.89 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.57/1.89 # Begin clausification derivation % 1.57/1.89 % 1.57/1.89 # End clausification derivation % 1.57/1.89 # Begin listing active clauses obtained from FOF to CNF conversion % 1.57/1.89 cnf(i_0_7, plain, (is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))))). % 1.57/1.89 cnf(i_0_8, plain, (is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))))). % 1.57/1.89 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))))). % 1.57/1.89 cnf(i_0_10, negated_conjecture, (~is_a_theorem(implies(a,implies(not(a),b))))). % 1.57/1.89 cnf(i_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). % 1.57/1.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.57/1.89 # Begin printing tableau % 1.57/1.89 # Found 6 steps % 1.57/1.89 cnf(i_0_7, plain, (is_a_theorem(implies(implies(implies(X7,X6),X5),implies(X6,X5)))), inference(start_rule)). % 1.57/1.89 cnf(i_0_78678, plain, (is_a_theorem(implies(implies(implies(X7,X6),X5),implies(X6,X5)))), inference(extension_rule, [i_0_6])). % 1.57/1.89 cnf(i_0_78685, plain, (is_a_theorem(implies(a,implies(not(a),b)))), inference(closure_rule, [i_0_10])). % 1.57/1.89 cnf(i_0_78686, plain, (~is_a_theorem(implies(implies(implies(implies(X7,X6),X5),implies(X6,X5)),implies(a,implies(not(a),b))))), inference(extension_rule, [i_0_6])). % 1.57/1.89 cnf(i_0_78689, plain, (~is_a_theorem(implies(implies(implies(X1,implies(implies(implies(X7,X6),X5),implies(X6,X5))),implies(a,implies(not(a),b))),implies(implies(implies(implies(X7,X6),X5),implies(X6,X5)),implies(a,implies(not(a),b)))))), inference(closure_rule, [i_0_7])). % 1.57/1.89 cnf(i_0_78690, plain, (~is_a_theorem(implies(implies(X1,implies(implies(implies(X7,X6),X5),implies(X6,X5))),implies(a,implies(not(a),b))))), inference(etableau_closure_rule, [i_0_78690, ...])). % 1.57/1.89 # End printing tableau % 1.57/1.89 # SZS output end % 1.57/1.89 # Branches closed with saturation will be marked with an "s" % 1.57/1.89 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 1.57/1.89 # We now have 6 tableaux to operate on % 1.57/1.89 # Found closed tableau during pool population. % 1.57/1.89 # Proof search is over... % 1.57/1.89 # Freeing feature tree %------------------------------------------------------------------------------