%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL303-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 : n026.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:01:00 PM UTC 2026 % Result : Unsatisfiable 21.69s 10.96s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL303-3 : TPTP v9.3.1. Released v2.3.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.36 % Computer : n026.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 11:11:10 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.39 # No SInE strategy applied % 0.09/0.39 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.39 # % 0.09/0.39 # Presaturation interreduction done % 0.09/0.39 # Number of axioms: 8 Number of unprocessed: 8 % 0.09/0.39 # Tableaux proof search. % 0.09/0.39 # APR header successfully linked. % 0.09/0.39 # Hello from C++ % 0.91/1.19 # The folding up rule is enabled... % 0.91/1.19 # Local unification is enabled... % 0.91/1.19 # Any saturation attempts will use folding labels... % 0.91/1.19 # 8 beginning clauses after preprocessing and clausification % 0.91/1.19 # Creating start rules for all 1 conjectures. % 0.91/1.19 # There are 1 start rule candidates: % 0.91/1.19 # Found 6 unit axioms. % 0.91/1.19 # 1 start rule tableaux created. % 0.91/1.19 # 2 extension rule candidate clauses % 0.91/1.19 # 6 unit axiom clauses % 0.91/1.19 % 0.91/1.19 # Requested 8, 32 cores available to the main process. % 0.91/1.19 # There are not enough tableaux to fork, creating more from the initial 1 % 8.66/9.01 # Ran out of tableaux, making start rules for all clauses % 8.66/9.01 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 8.66/9.01 # We now have 8 tableaux to operate on % 21.69/10.96 # There were 9 total branch saturation attempts. % 21.69/10.96 # There were 0 of these attempts blocked. % 21.69/10.96 # There were 0 deferred branch saturation attempts. % 21.69/10.96 # There were 0 free duplicated saturations. % 21.69/10.96 # There were 1 total successful branch saturations. % 21.69/10.96 # There were 0 successful branch saturations in interreduction. % 21.69/10.96 # There were 0 successful branch saturations on the branch. % 21.69/10.96 # There were 1 successful branch saturations after the branch. % 21.69/10.96 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 21.69/10.96 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 21.69/10.96 # Begin clausification derivation % 21.69/10.96 % 21.69/10.96 # End clausification derivation % 21.69/10.96 # Begin listing active clauses obtained from FOF to CNF conversion % 21.69/10.96 cnf(i_0_13, plain, (axiom(or(not(X1),or(X2,X1))))). % 21.69/10.96 cnf(i_0_12, plain, (axiom(or(not(or(X1,X1)),X1)))). % 21.69/10.96 cnf(i_0_14, plain, (axiom(or(not(or(X1,X2)),or(X2,X1))))). % 21.69/10.96 cnf(i_0_15, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))))). % 21.69/10.96 cnf(i_0_16, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))))). % 21.69/10.96 cnf(i_0_22, negated_conjecture, (~theorem(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))))). % 21.69/10.96 cnf(i_0_18, plain, (theorem(X1)|~axiom(X1))). % 21.69/10.96 cnf(i_0_19, plain, (theorem(X1)|~theorem(or(not(X2),X1))|~theorem(X2))). % 21.69/10.96 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 21.69/10.96 # Begin printing tableau % 21.69/10.96 # Found 6 steps % 21.69/10.96 cnf(i_0_12, plain, (axiom(or(not(or(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))))), inference(start_rule)). % 21.69/10.96 cnf(i_0_396192, plain, (axiom(or(not(or(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))))), inference(extension_rule, [i_0_18])). % 21.69/10.96 cnf(i_0_396207, plain, (theorem(or(not(or(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))))), inference(extension_rule, [i_0_19])). % 21.69/10.96 cnf(i_0_396209, plain, (theorem(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))))), inference(closure_rule, [i_0_22])). % 21.69/10.96 cnf(i_0_396211, plain, (~theorem(or(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))))), inference(extension_rule, [i_0_18])). % 21.69/10.96 cnf(i_0_441810, plain, (~axiom(or(not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q))))),not(or(not(or(not(or(not(p),q)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),not(or(not(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q))))),or(not(p),q)))))))), inference(etableau_closure_rule, [i_0_441810, ...])). % 21.69/10.96 # End printing tableau % 21.69/10.96 # SZS output end % 21.69/10.96 # Branches closed with saturation will be marked with an "s" % 21.69/10.97 # Child (1700849) has found a proof. % 21.69/10.97 % 21.69/10.97 # Proof search is over... % 21.69/10.97 # Freeing feature tree %------------------------------------------------------------------------------