%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX200+1 : TPTP v9.3.0. Released v9.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 : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Tue May 5 07:00:42 PM UTC 2026 % Result : Theorem 0.19s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX200+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.16/0.34 % Computer : n026.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue May 5 11:14:53 EDT 2026 % 0.16/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 19 Number of unprocessed: 19 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 19 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 11 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 8 extension rule candidate clauses % 0.19/0.37 # 11 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 8 tableaux to operate on % 0.19/0.38 # There were 1 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 1 total successful branch saturations. % 0.19/0.38 # There were 1 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 0 successful branch saturations after the branch. % 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_14, plain, (ord(nil))). % 0.19/0.38 cnf(i_0_10, plain, (merge(nil,X1)=X1)). % 0.19/0.38 cnf(i_0_4, plain, (proj1S(s(X1))=X1)). % 0.19/0.38 cnf(i_0_6, plain, (leqNat(z,X1))). % 0.19/0.38 cnf(i_0_15, plain, (ord(cons(X1,nil)))). % 0.19/0.38 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 0.19/0.38 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 0.19/0.38 cnf(i_0_11, plain, (merge(cons(X1,X2),nil)=cons(X1,X2))). % 0.19/0.38 cnf(i_0_5, plain, (s(X1)!=z)). % 0.19/0.38 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 0.19/0.38 cnf(i_0_7, plain, (~leqNat(s(X1),z))). % 0.19/0.38 cnf(i_0_9, plain, (leqNat(X1,X2)|~leqNat(s(X1),s(X2)))). % 0.19/0.38 cnf(i_0_18, plain, (leqNat(X1,X2)|~ord(cons(X1,cons(X2,X3))))). % 0.19/0.38 cnf(i_0_19, negated_conjecture, (ord(merge(X1,X2))|ord(X2)|~ord(X1))). % 0.19/0.38 cnf(i_0_17, plain, (ord(cons(X1,X2))|~ord(cons(X3,cons(X1,X2))))). % 0.19/0.38 cnf(i_0_8, plain, (leqNat(s(X1),s(X2))|~leqNat(X1,X2))). % 0.19/0.38 cnf(i_0_16, plain, (ord(cons(X1,cons(X2,X3)))|~ord(cons(X2,X3))|~leqNat(X1,X2))). % 0.19/0.38 cnf(i_0_13, plain, (merge(cons(X1,X2),cons(X3,X4))=cons(X3,merge(cons(X1,X2),X4))|leqNat(X1,X3))). % 0.19/0.38 cnf(i_0_12, plain, (merge(cons(X1,X2),cons(X3,X4))=cons(X1,merge(X2,cons(X3,X4)))|~leqNat(X1,X3))). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 12 steps % 0.19/0.38 cnf(i_0_19, negated_conjecture, (ord(merge(nil,cons(s(X1),cons(z,X6))))|ord(cons(s(X1),cons(z,X6)))|~ord(nil)), inference(start_rule)). % 0.19/0.38 cnf(i_0_22, plain, (~ord(nil)), inference(closure_rule, [i_0_14])). % 0.19/0.38 cnf(i_0_20, plain, (ord(merge(nil,cons(s(X1),cons(z,X6))))), inference(extension_rule, [i_0_19])). % 0.19/0.38 cnf(i_0_39, plain, (ord(cons(s(X7),cons(z,X8)))), inference(extension_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_277, plain, (leqNat(s(X7),z)), inference(closure_rule, [i_0_7])). % 0.19/0.38 cnf(i_0_38, plain, (ord(merge(merge(nil,cons(s(X1),cons(z,X6))),cons(s(X7),cons(z,X8))))), inference(extension_rule, [i_0_19])). % 0.19/0.38 cnf(i_0_327, plain, (ord(cons(s(X7),cons(z,X8)))), inference(closure_rule, [i_0_39])). % 0.19/0.38 cnf(i_0_326, plain, (ord(merge(merge(merge(nil,cons(s(X1),cons(z,X6))),cons(s(X7),cons(z,X8))),cons(s(X7),cons(z,X8))))), inference(extension_rule, [i_0_19])). % 0.19/0.38 cnf(i_0_345, plain, (ord(cons(s(X7),cons(z,X8)))), inference(closure_rule, [i_0_39])). % 0.19/0.38 cnf(i_0_21, plain, (ord(cons(s(X1),cons(z,X6)))), inference(extension_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_349, plain, (leqNat(s(X1),z)), inference(closure_rule, [i_0_7])). % 0.19/0.38 cnf(i_0_344, plain, (ord(merge(merge(merge(merge(nil,cons(s(X1),cons(z,X6))),cons(s(X7),cons(z,X8))),cons(s(X7),cons(z,X8))),cons(s(X7),cons(z,X8))))), inference(etableau_closure_rule, [i_0_344, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # There were 1 total branch saturation attempts. % 0.19/0.38 # There were 0 of these attempts blocked. % 0.19/0.38 # There were 0 deferred branch saturation attempts. % 0.19/0.38 # There were 0 free duplicated saturations. % 0.19/0.38 # There were 1 total successful branch saturations. % 0.19/0.38 # There were 1 successful branch saturations in interreduction. % 0.19/0.38 # There were 0 successful branch saturations on the branch. % 0.19/0.38 # There were 0 successful branch saturations after the branch. % 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.38 # Begin clausification derivation % 0.19/0.38 % 0.19/0.38 # End clausification derivation % 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.38 cnf(i_0_14, plain, (ord(nil))). % 0.19/0.38 cnf(i_0_10, plain, (merge(nil,X1)=X1)). % 0.19/0.38 cnf(i_0_4, plain, (proj1S(s(X1))=X1)). % 0.19/0.38 cnf(i_0_6, plain, (leqNat(z,X1))). % 0.19/0.38 cnf(i_0_15, plain, (ord(cons(X1,nil)))). % 0.19/0.38 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 0.19/0.38 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 0.19/0.38 cnf(i_0_11, plain, (merge(cons(X1,X2),nil)=cons(X1,X2))). % 0.19/0.38 cnf(i_0_5, plain, (s(X1)!=z)). % 0.19/0.38 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 0.19/0.38 cnf(i_0_7, plain, (~leqNat(s(X1),z))). % 0.19/0.38 cnf(i_0_9, plain, (leqNat(X1,X2)|~leqNat(s(X1),s(X2)))). % 0.19/0.38 cnf(i_0_18, plain, (leqNat(X1,X2)|~ord(cons(X1,cons(X2,X3))))). % 0.19/0.38 cnf(i_0_19, negated_conjecture, (ord(merge(X1,X2))|ord(X2)|~ord(X1))). % 0.19/0.38 cnf(i_0_17, plain, (ord(cons(X1,X2))|~ord(cons(X3,cons(X1,X2))))). % 0.19/0.38 cnf(i_0_8, plain, (leqNat(s(X1),s(X2))|~leqNat(X1,X2))). % 0.19/0.38 cnf(i_0_16, plain, (ord(cons(X1,cons(X2,X3)))|~ord(cons(X2,X3))|~leqNat(X1,X2))). % 0.19/0.38 cnf(i_0_13, plain, (merge(cons(X1,X2),cons(X3,X4))=cons(X3,merge(cons(X1,X2),X4))|leqNat(X1,X3))). % 0.19/0.38 cnf(i_0_12, plain, (merge(cons(X1,X2),cons(X3,X4))=cons(X1,merge(X2,cons(X3,X4)))|~leqNat(X1,X3))). % 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.38 # Begin printing tableau % 0.19/0.38 # Found 14 steps % 0.19/0.38 cnf(i_0_19, negated_conjecture, (ord(merge(nil,cons(X6,cons(s(X1),cons(z,X12)))))|ord(cons(X6,cons(s(X1),cons(z,X12))))|~ord(nil)), inference(start_rule)). % 0.19/0.38 cnf(i_0_22, plain, (~ord(nil)), inference(closure_rule, [i_0_14])). % 0.19/0.38 cnf(i_0_20, plain, (ord(merge(nil,cons(X6,cons(s(X1),cons(z,X12)))))), inference(extension_rule, [i_0_19])). % 0.19/0.38 cnf(i_0_39, plain, (ord(cons(X9,cons(s(X7),cons(z,X10))))), inference(extension_rule, [i_0_17])). % 0.19/0.38 cnf(i_0_279, plain, (ord(cons(s(X7),cons(z,X10)))), inference(extension_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_313, plain, (leqNat(s(X7),z)), inference(closure_rule, [i_0_7])). % 0.19/0.38 cnf(i_0_38, plain, (ord(merge(merge(nil,cons(X6,cons(s(X1),cons(z,X12)))),cons(X9,cons(s(X7),cons(z,X10)))))), inference(extension_rule, [i_0_19])). % 0.19/0.38 cnf(i_0_329, plain, (ord(cons(X9,cons(s(X7),cons(z,X10))))), inference(closure_rule, [i_0_39])). % 0.19/0.38 cnf(i_0_328, plain, (ord(merge(merge(merge(nil,cons(X6,cons(s(X1),cons(z,X12)))),cons(X9,cons(s(X7),cons(z,X10)))),cons(X9,cons(s(X7),cons(z,X10)))))), inference(extension_rule, [i_0_19])). % 0.19/0.38 cnf(i_0_347, plain, (ord(cons(X9,cons(s(X7),cons(z,X10))))), inference(closure_rule, [i_0_39])). % 0.19/0.38 cnf(i_0_21, plain, (ord(cons(X6,cons(s(X1),cons(z,X12))))), inference(extension_rule, [i_0_17])). % 0.19/0.38 cnf(i_0_351, plain, (ord(cons(s(X1),cons(z,X12)))), inference(extension_rule, [i_0_18])). % 0.19/0.38 cnf(i_0_364, plain, (leqNat(s(X1),z)), inference(closure_rule, [i_0_7])). % 0.19/0.38 cnf(i_0_346, plain, (ord(merge(merge(merge(merge(nil,cons(X6,cons(s(X1),cons(z,X12)))),cons(X9,cons(s(X7),cons(z,X10)))),cons(X9,cons(s(X7),cons(z,X10)))),cons(X9,cons(s(X7),cons(z,X10)))))), inference(etableau_closure_rule, [i_0_346, ...])). % 0.19/0.38 # End printing tableau % 0.19/0.38 # SZS output end % 0.19/0.38 # Branches closed with saturation will be marked with an "s" % 0.19/0.38 # Child (14027) has found a proof. % 0.19/0.38 % 0.19/0.38 # Proof search is over... % 0.19/0.38 # Freeing feature tree %------------------------------------------------------------------------------