%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL243-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:54 PM UTC 2026 % Result : Unsatisfiable 3.50s 3.99s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL243-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.08/0.35 % Computer : n003.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 : Sat Sep 5 06:35:35 UTC 2026 % 0.08/0.36 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 8 Number of unprocessed: 8 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.46/0.74 # The folding up rule is enabled... % 0.46/0.74 # Local unification is enabled... % 0.46/0.74 # Any saturation attempts will use folding labels... % 0.46/0.74 # 8 beginning clauses after preprocessing and clausification % 0.46/0.74 # Creating start rules for all 1 conjectures. % 0.46/0.74 # There are 1 start rule candidates: % 0.46/0.74 # Found 6 unit axioms. % 0.46/0.74 # 1 start rule tableaux created. % 0.46/0.74 # 2 extension rule candidate clauses % 0.46/0.74 # 6 unit axiom clauses % 0.46/0.74 % 0.46/0.74 # Requested 8, 32 cores available to the main process. % 0.46/0.74 # There are not enough tableaux to fork, creating more from the initial 1 % 3.46/3.73 # Ran out of tableaux, making start rules for all clauses % 3.46/3.73 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 3.46/3.73 # We now have 8 tableaux to operate on % 3.50/3.99 # There were 8 total branch saturation attempts. % 3.50/3.99 # There were 0 of these attempts blocked. % 3.50/3.99 # There were 0 deferred branch saturation attempts. % 3.50/3.99 # There were 0 free duplicated saturations. % 3.50/3.99 # There were 1 total successful branch saturations. % 3.50/3.99 # There were 0 successful branch saturations in interreduction. % 3.50/3.99 # There were 0 successful branch saturations on the branch. % 3.50/3.99 # There were 1 successful branch saturations after the branch. % 3.50/3.99 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.50/3.99 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.50/3.99 # Begin clausification derivation % 3.50/3.99 % 3.50/3.99 # End clausification derivation % 3.50/3.99 # Begin listing active clauses obtained from FOF to CNF conversion % 3.50/3.99 cnf(i_0_12, plain, (axiom(or(not(X1),or(X2,X1))))). % 3.50/3.99 cnf(i_0_11, plain, (axiom(or(not(or(X1,X1)),X1)))). % 3.50/3.99 cnf(i_0_13, plain, (axiom(or(not(or(X1,X2)),or(X2,X1))))). % 3.50/3.99 cnf(i_0_14, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))))). % 3.50/3.99 cnf(i_0_15, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))))). % 3.50/3.99 cnf(i_0_20, negated_conjecture, (~theorem(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r))))). % 3.50/3.99 cnf(i_0_17, plain, (theorem(X1)|~axiom(X1))). % 3.50/3.99 cnf(i_0_18, plain, (theorem(X1)|~theorem(or(not(X2),X1))|~theorem(X2))). % 3.50/3.99 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.50/3.99 # Begin printing tableau % 3.50/3.99 # Found 8 steps % 3.50/3.99 cnf(i_0_18, plain, (theorem(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))|~theorem(or(not(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r))))|~theorem(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r))))), inference(start_rule)). % 3.50/3.99 cnf(i_0_396505, plain, (theorem(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))), inference(closure_rule, [i_0_20])). % 3.50/3.99 cnf(i_0_396506, plain, (~theorem(or(not(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r))))), inference(extension_rule, [i_0_17])). % 3.50/3.99 cnf(i_0_396514, plain, (~axiom(or(not(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r))))), inference(closure_rule, [i_0_11])). % 3.50/3.99 cnf(i_0_396507, plain, (~theorem(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r))))), inference(extension_rule, [i_0_18])). % 3.50/3.99 cnf(i_0_396517, plain, (~theorem(or(not(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r))))), inference(closure_rule, [i_0_396506])). % 3.50/3.99 cnf(i_0_396516, plain, (~theorem(or(not(or(not(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))))), inference(extension_rule, [i_0_17])). % 3.50/3.99 cnf(i_0_396519, plain, (~axiom(or(not(or(not(or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))),or(or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)),or(not(or(not(p),or(not(q),r))),or(not(not(or(not(p),not(q)))),r)))))), inference(etableau_closure_rule, [i_0_396519, ...])). % 3.50/3.99 # End printing tableau % 3.50/3.99 # SZS output end % 3.50/3.99 # Branches closed with saturation will be marked with an "s" % 3.50/4.00 # Child (3246474) has found a proof. % 3.50/4.00 % 3.50/4.00 # Proof search is over... % 3.50/4.00 # Freeing feature tree %------------------------------------------------------------------------------