%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL077-2 : 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 : n031.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 0.12s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL077-2 : 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.34 % Computer : n031.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Sat Sep 5 05:45:39 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V % 0.12/0.37 # and selection function PSelectComplexExceptRRHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 6 Number of unprocessed: 6 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.40 # The folding up rule is enabled... % 0.12/0.40 # Local unification is enabled... % 0.12/0.40 # Any saturation attempts will use folding labels... % 0.12/0.40 # 6 beginning clauses after preprocessing and clausification % 0.12/0.40 # Creating start rules for all 1 conjectures. % 0.12/0.40 # There are 1 start rule candidates: % 0.12/0.40 # Found 4 unit axioms. % 0.12/0.40 # 1 start rule tableaux created. % 0.12/0.40 # 2 extension rule candidate clauses % 0.12/0.40 # 4 unit axiom clauses % 0.12/0.40 % 0.12/0.40 # Requested 8, 32 cores available to the main process. % 0.12/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.40 # There were 1 total branch saturation attempts. % 0.12/0.40 # There were 0 of these attempts blocked. % 0.12/0.40 # There were 0 deferred branch saturation attempts. % 0.12/0.40 # There were 0 free duplicated saturations. % 0.12/0.40 # There were 1 total successful branch saturations. % 0.12/0.40 # There were 0 successful branch saturations in interreduction. % 0.12/0.40 # There were 0 successful branch saturations on the branch. % 0.12/0.40 # There were 1 successful branch saturations after the branch. % 0.12/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.40 # Begin clausification derivation % 0.12/0.40 % 0.12/0.40 # End clausification derivation % 0.12/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.40 cnf(i_0_8, plain, (is_a_theorem(implies(X1,implies(X2,X1))))). % 0.12/0.40 cnf(i_0_10, plain, (is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))))). % 0.12/0.40 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))). % 0.12/0.40 cnf(i_0_12, negated_conjecture, (~is_a_theorem(implies(not(not(a)),a)))). % 0.12/0.40 cnf(i_0_7, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). % 0.12/0.40 cnf(i_0_11, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X1,X3)))). % 0.12/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.40 # Begin printing tableau % 0.12/0.40 # Found 6 steps % 0.12/0.40 cnf(i_0_12, negated_conjecture, (~is_a_theorem(implies(not(not(a)),a))), inference(start_rule)). % 0.12/0.40 cnf(i_0_13, plain, (~is_a_theorem(implies(not(not(a)),a))), inference(extension_rule, [i_0_11])). % 0.12/0.40 cnf(i_0_19, plain, (~is_a_theorem(implies(not(not(a)),implies(X5,not(not(a)))))), inference(closure_rule, [i_0_8])). % 0.12/0.40 cnf(i_0_18, plain, (~is_a_theorem(implies(implies(X5,not(not(a))),a))), inference(extension_rule, [i_0_7])). % 0.12/0.40 cnf(i_0_21, plain, (~is_a_theorem(implies(a,implies(implies(X5,not(not(a))),a)))), inference(closure_rule, [i_0_8])). % 0.12/0.40 cnf(i_0_22, plain, (~is_a_theorem(a)), inference(etableau_closure_rule, [i_0_22, ...])). % 0.12/0.40 # End printing tableau % 0.12/0.40 # SZS output end % 0.12/0.40 # Branches closed with saturation will be marked with an "s" % 0.12/0.40 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.12/0.40 # We now have 2 tableaux to operate on % 0.12/0.40 # Found closed tableau during pool population. % 0.12/0.40 # Proof search is over... % 0.12/0.40 # Freeing feature tree %------------------------------------------------------------------------------