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