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