%------------------------------------------------------------------------------ % 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 : n031.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 : Unsatisfiable 0.20s 0.43s % 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.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.18/0.34 % Computer : n031.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue May 5 12:17:53 EDT 2026 % 0.18/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 29 Number of unprocessed: 29 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 29 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 1 conjectures. % 0.20/0.37 # There are 1 start rule candidates: % 0.20/0.37 # Found 29 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 0 extension rule candidate clauses % 0.20/0.37 # 29 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.37 # Creating equality axioms % 0.20/0.37 # Ran out of tableaux, making start rules for all clauses % 0.20/0.37 # Returning from population with 51 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 51 tableaux to operate on % 0.20/0.43 # There were 1 total branch saturation attempts. % 0.20/0.43 # There were 0 of these attempts blocked. % 0.20/0.43 # There were 0 deferred branch saturation attempts. % 0.20/0.43 # There were 0 free duplicated saturations. % 0.20/0.43 # There were 1 total successful branch saturations. % 0.20/0.43 # There were 0 successful branch saturations in interreduction. % 0.20/0.43 # There were 0 successful branch saturations on the branch. % 0.20/0.43 # There were 1 successful branch saturations after the branch. % 0.20/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.43 # Begin clausification derivation % 0.20/0.43 % 0.20/0.43 # End clausification derivation % 0.20/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.43 cnf(i_0_35, plain, (notb(btrue)=bfalse)). % 0.20/0.43 cnf(i_0_55, plain, (eq2(btrue,bfalse)=bfalse)). % 0.20/0.43 cnf(i_0_54, plain, (eq2(bfalse,btrue)=bfalse)). % 0.20/0.43 cnf(i_0_36, plain, (notb(bfalse)=btrue)). % 0.20/0.43 cnf(i_0_42, plain, (shw(zero)=nil)). % 0.20/0.43 cnf(i_0_37, plain, (half(zero)=zero)). % 0.20/0.43 cnf(i_0_49, plain, (rd(nil)=zero)). % 0.20/0.43 cnf(i_0_40, plain, (evenNat(zero)=btrue)). % 0.20/0.43 cnf(i_0_61, plain, (eq(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_62, plain, (eq2(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_63, plain, (eq3(X1,X1)=btrue)). % 0.20/0.43 cnf(i_0_44, plain, (append(nil,X1)=X1)). % 0.20/0.43 cnf(i_0_57, plain, (eq3(o,i)=bfalse)). % 0.20/0.43 cnf(i_0_56, plain, (eq3(i,o)=bfalse)). % 0.20/0.43 cnf(i_0_59, plain, (eq(zero,suc(X1))=bfalse)). % 0.20/0.43 cnf(i_0_60, plain, (eq(suc(X1),zero)=bfalse)). % 0.20/0.43 cnf(i_0_38, plain, (half(suc(zero))=zero)). % 0.20/0.43 cnf(i_0_46, plain, (addNat(zero,X1)=X1)). % 0.20/0.43 cnf(i_0_41, plain, (notb(evenNat(X1))=evenNat(suc(X1)))). % 0.20/0.43 cnf(i_0_39, plain, (half(suc(suc(X1)))=suc(half(X1)))). % 0.20/0.43 cnf(i_0_47, plain, (addNat(suc(X1),X2)=suc(addNat(X1,X2)))). % 0.20/0.43 cnf(i_0_58, plain, (eq(suc(X1),suc(X2))=eq(X1,X2))). % 0.20/0.43 cnf(i_0_51, plain, (addNat(rd(X1),rd(X1))=rd(cons(o,X1)))). % 0.20/0.43 cnf(i_0_50, plain, (suc(rd(cons(o,X1)))=rd(cons(i,X1)))). % 0.20/0.43 cnf(i_0_43, plain, (aux(X1,evenNat(suc(X1)))=shw(suc(X1)))). % 0.20/0.43 cnf(i_0_33, plain, (cons(o,shw(half(suc(X1))))=aux(X1,btrue))). % 0.20/0.43 cnf(i_0_34, plain, (cons(i,shw(half(suc(X1))))=aux(X1,bfalse))). % 0.20/0.43 cnf(i_0_45, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 0.20/0.43 cnf(i_0_64, negated_conjecture, (eq2(eq(rd(append(shw(X1),shw(X2))),rd(append(shw(X2),shw(X1)))),bfalse)!=btrue)). % 0.20/0.43 cnf(i_0_66, plain, (X4=X4)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 5 steps % 0.20/0.43 cnf(i_0_35, plain, (notb(btrue)=bfalse), inference(start_rule)). % 0.20/0.43 cnf(i_0_83, plain, (notb(btrue)=bfalse), inference(extension_rule, [i_0_79])). % 0.20/0.43 cnf(i_0_142, plain, (rd(notb(btrue))=rd(bfalse)), inference(extension_rule, [i_0_69])). % 0.20/0.43 cnf(i_0_159, plain, (rd(bfalse)!=append(nil,rd(bfalse))), inference(closure_rule, [i_0_44])). % 0.20/0.43 cnf(i_0_157, plain, (rd(notb(btrue))=append(nil,rd(bfalse))), inference(etableau_closure_rule, [i_0_157, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.44 # Child (19068) has found a proof. % 0.20/0.44 % 0.20/0.44 # Proof search is over... % 0.20/0.44 # Freeing feature tree %------------------------------------------------------------------------------