%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : LCL428-1 : TPTP v9.3.1. Bugfixed v5.5.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 : n006.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:13 PM UTC 2026 % Result : Unsatisfiable 13.97s 14.29s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL428-1 : TPTP v9.3.1. Bugfixed v5.5.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.10/0.37 % Computer : n006.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Sat Sep 5 22:02:46 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.40 # No SInE strategy applied % 0.10/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.40 # % 0.10/0.40 # Presaturation interreduction done % 0.10/0.40 # Number of axioms: 6 Number of unprocessed: 6 % 0.10/0.40 # Tableaux proof search. % 0.10/0.40 # APR header successfully linked. % 0.10/0.40 # Hello from C++ % 1.47/1.77 # The folding up rule is enabled... % 1.47/1.77 # Local unification is enabled... % 1.47/1.77 # Any saturation attempts will use folding labels... % 1.47/1.77 # 6 beginning clauses after preprocessing and clausification % 1.47/1.77 # Creating start rules for all 1 conjectures. % 1.47/1.77 # There are 1 start rule candidates: % 1.47/1.77 # Found 5 unit axioms. % 1.47/1.77 # 1 start rule tableaux created. % 1.47/1.77 # 1 extension rule candidate clauses % 1.47/1.77 # 5 unit axiom clauses % 1.47/1.77 % 1.47/1.77 # Requested 8, 32 cores available to the main process. % 1.47/1.77 # There are not enough tableaux to fork, creating more from the initial 1 % 5.17/5.44 # Ran out of tableaux, making start rules for all clauses % 13.97/14.29 # There were 8 total branch saturation attempts. % 13.97/14.29 # There were 0 of these attempts blocked. % 13.97/14.29 # There were 0 deferred branch saturation attempts. % 13.97/14.29 # There were 0 free duplicated saturations. % 13.97/14.29 # There were 1 total successful branch saturations. % 13.97/14.29 # There were 0 successful branch saturations in interreduction. % 13.97/14.29 # There were 0 successful branch saturations on the branch. % 13.97/14.29 # There were 1 successful branch saturations after the branch. % 13.97/14.29 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.97/14.29 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.97/14.29 # Begin clausification derivation % 13.97/14.29 % 13.97/14.29 # End clausification derivation % 13.97/14.29 # Begin listing active clauses obtained from FOF to CNF conversion % 13.97/14.29 cnf(i_0_8, plain, (is_a_theorem(implies(X1,implies(X2,X1))))). % 13.97/14.29 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))). % 13.97/14.29 cnf(i_0_10, plain, (is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))))). % 13.97/14.29 cnf(i_0_11, plain, (is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X1)),implies(X2,X1))))). % 13.97/14.29 cnf(i_0_12, negated_conjecture, (~is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)))). % 13.97/14.29 cnf(i_0_7, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))). % 13.97/14.29 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 13.97/14.29 # Begin printing tableau % 13.97/14.29 # Found 8 steps % 13.97/14.29 cnf(i_0_9, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(start_rule)). % 13.97/14.29 cnf(i_0_175660, plain, (is_a_theorem(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))))), inference(extension_rule, [i_0_7])). % 13.97/14.29 cnf(i_0_554267, plain, (is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16))), inference(closure_rule, [i_0_12])). % 13.97/14.29 cnf(i_0_554268, plain, (~is_a_theorem(implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)))), inference(extension_rule, [i_0_7])). % 13.97/14.29 cnf(i_0_554271, plain, (~is_a_theorem(implies(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16),implies(implies(implies(X7,X6),implies(implies(X6,X5),implies(X7,X5))),implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16))))), inference(closure_rule, [i_0_8])). % 13.97/14.29 cnf(i_0_554272, plain, (~is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16))), inference(extension_rule, [i_0_7])). % 13.97/14.29 cnf(i_0_639473, plain, (~is_a_theorem(implies(v16,implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)))), inference(closure_rule, [i_0_8])). % 13.97/14.29 cnf(i_0_639474, plain, (~is_a_theorem(v16)), inference(etableau_closure_rule, [i_0_639474, ...])). % 13.97/14.29 # End printing tableau % 13.97/14.29 # SZS output end % 13.97/14.29 # Branches closed with saturation will be marked with an "s" % 13.97/14.29 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 13.97/14.29 # We now have 6 tableaux to operate on % 13.97/14.29 # Found closed tableau during pool population. % 13.97/14.29 # Proof search is over... % 13.97/14.29 # Freeing feature tree %------------------------------------------------------------------------------