%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL002-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:27 PM UTC 2026 % Result : Unsatisfiable 0.95s 1.23s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL002-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.35 % Computer : n010.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Fri Sep 4 17:12:23 UTC 2026 % 0.09/0.36 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y % 0.12/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.38 # % 0.12/0.38 # Number of axioms: 3 Number of unprocessed: 3 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.90/1.18 # The folding up rule is enabled... % 0.90/1.18 # Local unification is enabled... % 0.90/1.18 # Any saturation attempts will use folding labels... % 0.90/1.18 # 3 beginning clauses after preprocessing and clausification % 0.90/1.18 # Creating start rules for all 1 conjectures. % 0.90/1.18 # There are 1 start rule candidates: % 0.90/1.18 # Found 2 unit axioms. % 0.90/1.18 # 1 start rule tableaux created. % 0.90/1.18 # 1 extension rule candidate clauses % 0.90/1.18 # 2 unit axiom clauses % 0.90/1.18 % 0.90/1.18 # Requested 8, 32 cores available to the main process. % 0.90/1.18 # There are not enough tableaux to fork, creating more from the initial 1 % 0.95/1.23 # There were 1 total branch saturation attempts. % 0.95/1.23 # There were 0 of these attempts blocked. % 0.95/1.23 # There were 0 deferred branch saturation attempts. % 0.95/1.23 # There were 0 free duplicated saturations. % 0.95/1.23 # There were 1 total successful branch saturations. % 0.95/1.23 # There were 0 successful branch saturations in interreduction. % 0.95/1.23 # There were 0 successful branch saturations on the branch. % 0.95/1.23 # There were 1 successful branch saturations after the branch. % 0.95/1.23 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.95/1.23 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.95/1.23 # Begin clausification derivation % 0.95/1.23 % 0.95/1.23 # End clausification derivation % 0.95/1.23 # Begin listing active clauses obtained from FOF to CNF conversion % 0.95/1.23 cnf(i_0_4, plain, (is_a_theorem(X2)|~is_a_theorem(X1)|~is_a_theorem(or(not(X1),X2)))). % 0.95/1.23 cnf(i_0_6, negated_conjecture, (~is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))))). % 0.95/1.23 cnf(i_0_5, plain, (is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X3,or(X4,X5)))),or(not(or(not(X4),X1)),or(X3,or(X5,X1))))))). % 0.95/1.23 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.95/1.23 # Begin printing tableau % 0.95/1.23 # Found 6 steps % 0.95/1.23 cnf(i_0_6, negated_conjecture, (~is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c))))), inference(start_rule)). % 0.95/1.23 cnf(i_0_7, plain, (~is_a_theorem(or(not(or(not(b),c)),or(not(or(a,b)),or(a,c))))), inference(extension_rule, [i_0_4])). % 0.95/1.23 cnf(i_0_9, plain, (~is_a_theorem(or(not(or(not(or(not(X12),X11)),or(X10,or(X9,X8)))),or(not(or(not(X9),X12)),or(X10,or(X8,X12)))))), inference(closure_rule, [i_0_5])). % 0.95/1.23 cnf(i_0_10, plain, (~is_a_theorem(or(not(or(not(or(not(or(not(X12),X11)),or(X10,or(X9,X8)))),or(not(or(not(X9),X12)),or(X10,or(X8,X12))))),or(not(or(not(b),c)),or(not(or(a,b)),or(a,c)))))), inference(extension_rule, [i_0_4])). % 0.95/1.23 cnf(i_0_12, plain, (~is_a_theorem(or(not(or(not(or(not(X1),X2)),or(X4,or(X5,X6)))),or(not(or(not(X5),X1)),or(X4,or(X6,X1)))))), inference(closure_rule, [i_0_5])). % 0.95/1.23 cnf(i_0_13, plain, (~is_a_theorem(or(not(or(not(or(not(or(not(X1),X2)),or(X4,or(X5,X6)))),or(not(or(not(X5),X1)),or(X4,or(X6,X1))))),or(not(or(not(or(not(or(not(X12),X11)),or(X10,or(X9,X8)))),or(not(or(not(X9),X12)),or(X10,or(X8,X12))))),or(not(or(not(b),c)),or(not(or(a,b)),or(a,c))))))), inference(etableau_closure_rule, [i_0_13, ...])). % 0.95/1.23 # End printing tableau % 0.95/1.23 # SZS output end % 0.95/1.23 # Branches closed with saturation will be marked with an "s" % 0.95/1.23 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux. % 0.95/1.23 # We now have 1 tableaux to operate on % 0.95/1.23 # Found closed tableau during pool population. % 0.95/1.23 # Proof search is over... % 0.95/1.23 # Freeing feature tree %------------------------------------------------------------------------------