%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL262-3 : TPTP v9.3.1. Released v2.3.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:57 PM UTC 2026 % Result : Unsatisfiable 1.65s 1.95s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL262-3 : TPTP v9.3.1. Released v2.3.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 : Fri Sep 4 17:40:36 UTC 2026 % 0.08/0.36 % CPUTime : % 0.12/0.39 # No SInE strategy applied % 0.12/0.39 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.39 # % 0.12/0.39 # Presaturation interreduction done % 0.12/0.39 # Number of axioms: 8 Number of unprocessed: 8 % 0.12/0.39 # Tableaux proof search. % 0.12/0.39 # APR header successfully linked. % 0.12/0.39 # Hello from C++ % 0.88/1.15 # The folding up rule is enabled... % 0.88/1.15 # Local unification is enabled... % 0.88/1.15 # Any saturation attempts will use folding labels... % 0.88/1.15 # 8 beginning clauses after preprocessing and clausification % 0.88/1.15 # Creating start rules for all 1 conjectures. % 0.88/1.15 # There are 1 start rule candidates: % 0.88/1.15 # Found 6 unit axioms. % 0.88/1.15 # 1 start rule tableaux created. % 0.88/1.15 # 2 extension rule candidate clauses % 0.88/1.15 # 6 unit axiom clauses % 0.88/1.15 % 0.88/1.15 # Requested 8, 32 cores available to the main process. % 0.88/1.15 # There are not enough tableaux to fork, creating more from the initial 1 % 1.65/1.95 # There were 2 total branch saturation attempts. % 1.65/1.95 # There were 0 of these attempts blocked. % 1.65/1.95 # There were 0 deferred branch saturation attempts. % 1.65/1.95 # There were 0 free duplicated saturations. % 1.65/1.95 # There were 1 total successful branch saturations. % 1.65/1.95 # There were 0 successful branch saturations in interreduction. % 1.65/1.95 # There were 0 successful branch saturations on the branch. % 1.65/1.95 # There were 1 successful branch saturations after the branch. % 1.65/1.95 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.65/1.95 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.65/1.95 # Begin clausification derivation % 1.65/1.95 % 1.65/1.95 # End clausification derivation % 1.65/1.95 # Begin listing active clauses obtained from FOF to CNF conversion % 1.65/1.95 cnf(i_0_13, plain, (axiom(or(not(X1),or(X2,X1))))). % 1.65/1.95 cnf(i_0_12, plain, (axiom(or(not(or(X1,X1)),X1)))). % 1.65/1.95 cnf(i_0_14, plain, (axiom(or(not(or(X1,X2)),or(X2,X1))))). % 1.65/1.95 cnf(i_0_15, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))))). % 1.65/1.95 cnf(i_0_16, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))))). % 1.65/1.95 cnf(i_0_22, negated_conjecture, (~theorem(not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q)))))))). % 1.65/1.95 cnf(i_0_18, plain, (theorem(X1)|~axiom(X1))). % 1.65/1.95 cnf(i_0_19, plain, (theorem(X1)|~theorem(or(not(X2),X1))|~theorem(X2))). % 1.65/1.95 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.65/1.95 # Begin printing tableau % 1.65/1.95 # Found 8 steps % 1.65/1.95 cnf(i_0_22, negated_conjecture, (~theorem(not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q))))))), inference(start_rule)). % 1.65/1.95 cnf(i_0_23, plain, (~theorem(not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q))))))), inference(extension_rule, [i_0_19])). % 1.65/1.95 cnf(i_0_27, plain, (~theorem(or(not(or(not(X5),or(X4,X5))),not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q)))))))), inference(extension_rule, [i_0_19])). % 1.65/1.95 cnf(i_0_28, plain, (~theorem(or(not(X5),or(X4,X5)))), inference(extension_rule, [i_0_18])). % 1.65/1.95 cnf(i_0_40, plain, (~axiom(or(not(X5),or(X4,X5)))), inference(closure_rule, [i_0_13])). % 1.65/1.95 cnf(i_0_33, plain, (~theorem(or(not(X5),or(X4,X5)))), inference(closure_rule, [i_0_28])). % 1.65/1.95 cnf(i_0_32, plain, (~theorem(or(not(or(not(X5),or(X4,X5))),or(not(or(not(X5),or(X4,X5))),not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q))))))))), inference(extension_rule, [i_0_18])). % 1.65/1.95 cnf(i_0_46668, plain, (~axiom(or(not(or(not(X5),or(X4,X5))),or(not(or(not(X5),or(X4,X5))),not(or(not(or(not(or(not(p),q)),or(not(not(q)),not(p)))),not(or(not(or(not(not(q)),not(p))),or(not(p),q))))))))), inference(etableau_closure_rule, [i_0_46668, ...])). % 1.65/1.95 # End printing tableau % 1.65/1.95 # SZS output end % 1.65/1.95 # Branches closed with saturation will be marked with an "s" % 1.65/1.95 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux. % 1.65/1.95 # We now have 3 tableaux to operate on % 1.65/1.95 # Found closed tableau during pool population. % 1.65/1.95 # Proof search is over... % 1.65/1.95 # Freeing feature tree %------------------------------------------------------------------------------