%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX217+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 : n018.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:45 PM UTC 2026 % Result : Theorem 5.14s 1.06s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX217+1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.16/0.33 % Computer : n018.cluster.edu % 0.16/0.33 % Model : x86_64 x86_64 % 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.33 % Memory : 8042.1875MB % 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.33 % CPULimit : 300 % 0.16/0.33 % WCLimit : 300 % 0.16/0.33 % DateTime : Tue May 5 12:14:01 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: 23 Number of unprocessed: 23 % 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 # 23 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 19 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 4 extension rule candidate clauses % 0.19/0.37 # 19 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 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Returning from population with 39 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 39 tableaux to operate on % 5.14/1.06 # There were 1 total branch saturation attempts. % 5.14/1.06 # There were 0 of these attempts blocked. % 5.14/1.06 # There were 0 deferred branch saturation attempts. % 5.14/1.06 # There were 0 free duplicated saturations. % 5.14/1.06 # There were 1 total successful branch saturations. % 5.14/1.06 # There were 0 successful branch saturations in interreduction. % 5.14/1.06 # There were 0 successful branch saturations on the branch. % 5.14/1.06 # There were 1 successful branch saturations after the branch. % 5.14/1.06 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.14/1.06 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.14/1.06 # Begin clausification derivation % 5.14/1.06 % 5.14/1.06 # End clausification derivation % 5.14/1.06 # Begin listing active clauses obtained from FOF to CNF conversion % 5.14/1.06 cnf(i_0_13, plain, (shw(zero)=nil)). % 5.14/1.06 cnf(i_0_21, plain, (rd(nil)=zero)). % 5.14/1.06 cnf(i_0_7, plain, (half(zero)=zero)). % 5.14/1.06 cnf(i_0_10, plain, (evenNat(zero))). % 5.14/1.06 cnf(i_0_4, plain, (proj1Suc(suc(X1))=X1)). % 5.14/1.06 cnf(i_0_16, plain, (append(nil,X1)=X1)). % 5.14/1.06 cnf(i_0_18, plain, (addNat(zero,X1)=X1)). % 5.14/1.06 cnf(i_0_8, plain, (half(suc(zero))=zero)). % 5.14/1.06 cnf(i_0_1, plain, (head(cons(X1,X2))=X1)). % 5.14/1.06 cnf(i_0_2, plain, (tail(cons(X1,X2))=X2)). % 5.14/1.06 cnf(i_0_23, plain, (addNat(rd(X1),rd(X1))=rd(cons(o,X1)))). % 5.14/1.06 cnf(i_0_9, plain, (half(suc(suc(X1)))=suc(half(X1)))). % 5.14/1.06 cnf(i_0_19, plain, (addNat(suc(X1),X2)=suc(addNat(X1,X2)))). % 5.14/1.06 cnf(i_0_17, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 5.14/1.06 cnf(i_0_22, plain, (suc(rd(cons(o,X1)))=rd(cons(i,X1)))). % 5.14/1.06 cnf(i_0_25, negated_conjecture, (rd(append(shw(X1),shw(X2)))=rd(append(shw(X2),shw(X1))))). % 5.14/1.06 cnf(i_0_6, plain, (i!=o)). % 5.14/1.06 cnf(i_0_5, plain, (suc(X1)!=zero)). % 5.14/1.06 cnf(i_0_3, plain, (cons(X1,X2)!=nil)). % 5.14/1.06 cnf(i_0_12, plain, (~evenNat(suc(X1))|~evenNat(X1))). % 5.14/1.06 cnf(i_0_11, plain, (evenNat(suc(X1))|evenNat(X1))). % 5.14/1.06 cnf(i_0_14, plain, (cons(o,shw(half(suc(X1))))=shw(suc(X1))|~evenNat(suc(X1)))). % 5.14/1.06 cnf(i_0_15, plain, (cons(i,shw(half(suc(X1))))=shw(suc(X1))|evenNat(suc(X1)))). % 5.14/1.06 cnf(i_0_35, plain, (X33=X33)). % 5.14/1.06 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.14/1.06 # Begin printing tableau % 5.14/1.06 # Found 6 steps % 5.14/1.06 cnf(i_0_13, plain, (shw(zero)=nil), inference(start_rule)). % 5.14/1.06 cnf(i_0_50, plain, (shw(zero)=nil), inference(extension_rule, [i_0_47])). % 5.14/1.06 cnf(i_0_113, plain, (shw(zero)!=nil), inference(closure_rule, [i_0_13])). % 5.14/1.06 cnf(i_0_111, plain, (append(shw(zero),shw(zero))=append(nil,nil)), inference(extension_rule, [i_0_38])). % 5.14/1.06 cnf(i_0_133, plain, (append(nil,nil)!=proj1Suc(suc(append(nil,nil)))), inference(closure_rule, [i_0_4])). % 5.14/1.06 cnf(i_0_131, plain, (append(shw(zero),shw(zero))=proj1Suc(suc(append(nil,nil)))), inference(etableau_closure_rule, [i_0_131, ...])). % 5.14/1.06 # End printing tableau % 5.14/1.06 # SZS output end % 5.14/1.06 # Branches closed with saturation will be marked with an "s" % 5.14/1.06 # Child (15563) has found a proof. % 5.14/1.06 % 5.14/1.06 # Proof search is over... % 5.14/1.06 # Freeing feature tree %------------------------------------------------------------------------------