%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX203-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 : n006.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:43 PM UTC 2026 % Result : Unsatisfiable 7.45s 1.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX203-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.15/0.34 % Computer : n006.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue May 5 11:26:45 EDT 2026 % 0.15/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: 33 Number of unprocessed: 33 % 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 # 33 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 33 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 0 extension rule candidate clauses % 0.20/0.37 # 33 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 62 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 62 tableaux to operate on % 7.45/1.34 # There were 1 total branch saturation attempts. % 7.45/1.34 # There were 0 of these attempts blocked. % 7.45/1.34 # There were 0 deferred branch saturation attempts. % 7.45/1.34 # There were 0 free duplicated saturations. % 7.45/1.34 # There were 1 total successful branch saturations. % 7.45/1.34 # There were 0 successful branch saturations in interreduction. % 7.45/1.34 # There were 0 successful branch saturations on the branch. % 7.45/1.34 # There were 1 successful branch saturations after the branch. % 7.45/1.34 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.45/1.34 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.45/1.34 # Begin clausification derivation % 7.45/1.34 % 7.45/1.34 # End clausification derivation % 7.45/1.34 # Begin listing active clauses obtained from FOF to CNF conversion % 7.45/1.34 cnf(i_0_60, plain, (eq2(btrue,bfalse)=bfalse)). % 7.45/1.34 cnf(i_0_59, plain, (eq2(bfalse,btrue)=bfalse)). % 7.45/1.34 cnf(i_0_47, plain, (unique(nil)=btrue)). % 7.45/1.34 cnf(i_0_55, plain, (sorted(nil)=btrue)). % 7.45/1.34 cnf(i_0_41, plain, (lengthNat(nil)=z)). % 7.45/1.34 cnf(i_0_51, plain, (rev(nil)=nil)). % 7.45/1.34 cnf(i_0_64, plain, (eq(X1,X1)=btrue)). % 7.45/1.34 cnf(i_0_65, plain, (eq2(X1,X1)=btrue)). % 7.45/1.34 cnf(i_0_37, plain, (orb(bfalse,X1)=X1)). % 7.45/1.34 cnf(i_0_43, plain, (impl(btrue,X1)=X1)). % 7.45/1.34 cnf(i_0_36, plain, (orb(btrue,X1)=btrue)). % 7.45/1.34 cnf(i_0_44, plain, (impl(bfalse,X1)=btrue)). % 7.45/1.34 cnf(i_0_54, plain, (andb(bfalse,X1)=bfalse)). % 7.45/1.34 cnf(i_0_53, plain, (andb(btrue,X1)=X1)). % 7.45/1.34 cnf(i_0_45, plain, (elemNat(X1,nil)=bfalse)). % 7.45/1.34 cnf(i_0_38, plain, (leqNat(z,X1)=btrue)). % 7.45/1.34 cnf(i_0_49, plain, (append(nil,X1)=X1)). % 7.45/1.34 cnf(i_0_34, plain, (aux(X1,X2,btrue)=bfalse)). % 7.45/1.34 cnf(i_0_62, plain, (eq(z,s(X1))=bfalse)). % 7.45/1.34 cnf(i_0_39, plain, (leqNat(s(X1),z)=bfalse)). % 7.45/1.34 cnf(i_0_63, plain, (eq(s(X1),z)=bfalse)). % 7.45/1.34 cnf(i_0_56, plain, (sorted(cons(X1,nil))=btrue)). % 7.45/1.34 cnf(i_0_35, plain, (aux(X1,X2,bfalse)=unique(X2))). % 7.45/1.34 cnf(i_0_42, plain, (lengthNat(cons(X1,X2))=s(lengthNat(X2)))). % 7.45/1.34 cnf(i_0_40, plain, (leqNat(s(X1),s(X2))=leqNat(X1,X2))). % 7.45/1.34 cnf(i_0_61, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 7.45/1.34 cnf(i_0_52, plain, (append(rev(X1),cons(X2,nil))=rev(cons(X2,X1)))). % 7.45/1.34 cnf(i_0_50, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 7.45/1.34 cnf(i_0_48, plain, (aux(X1,X2,elemNat(X1,X2))=unique(cons(X1,X2)))). % 7.45/1.34 cnf(i_0_46, plain, (orb(eq(X1,X2),elemNat(X1,X3))=elemNat(X1,cons(X2,X3)))). % 7.45/1.34 cnf(i_0_57, plain, (andb(leqNat(X1,X2),sorted(cons(X2,X3)))=sorted(cons(X1,cons(X2,X3))))). % 7.45/1.34 cnf(i_0_58, plain, (impl(eq2(sorted(rev(X1)),btrue),impl(eq2(unique(X1),btrue),eq2(leqNat(lengthNat(X1),s(s(s(z)))),btrue)))=psorted_rev(X1))). % 7.45/1.34 cnf(i_0_66, negated_conjecture, (eq2(psorted_rev(X1),bfalse)!=btrue)). % 7.45/1.34 cnf(i_0_68, plain, (X4=X4)). % 7.45/1.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.45/1.34 # Begin printing tableau % 7.45/1.34 # Found 6 steps % 7.45/1.34 cnf(i_0_60, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 7.45/1.34 cnf(i_0_88, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_82])). % 7.45/1.34 cnf(i_0_158, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_60])). % 7.45/1.34 cnf(i_0_157, plain, (append(eq2(btrue,bfalse),eq2(btrue,bfalse))=append(bfalse,bfalse)), inference(extension_rule, [i_0_71])). % 7.45/1.34 cnf(i_0_178, plain, (append(bfalse,bfalse)!=orb(bfalse,append(bfalse,bfalse))), inference(closure_rule, [i_0_37])). % 7.45/1.34 cnf(i_0_176, plain, (append(eq2(btrue,bfalse),eq2(btrue,bfalse))=orb(bfalse,append(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_176, ...])). % 7.45/1.34 # End printing tableau % 7.45/1.34 # SZS output end % 7.45/1.34 # Branches closed with saturation will be marked with an "s" % 7.45/1.34 # There were 1 total branch saturation attempts. % 7.45/1.34 # There were 0 of these attempts blocked. % 7.45/1.34 # There were 0 deferred branch saturation attempts. % 7.45/1.34 # There were 0 free duplicated saturations. % 7.45/1.34 # There were 1 total successful branch saturations. % 7.45/1.34 # There were 0 successful branch saturations in interreduction. % 7.45/1.34 # There were 0 successful branch saturations on the branch. % 7.45/1.34 # There were 1 successful branch saturations after the branch. % 7.45/1.34 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.45/1.34 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.45/1.34 # Begin clausification derivation % 7.45/1.34 % 7.45/1.34 # End clausification derivation % 7.45/1.34 # Begin listing active clauses obtained from FOF to CNF conversion % 7.45/1.34 cnf(i_0_60, plain, (eq2(btrue,bfalse)=bfalse)). % 7.45/1.34 cnf(i_0_59, plain, (eq2(bfalse,btrue)=bfalse)). % 7.45/1.34 cnf(i_0_47, plain, (unique(nil)=btrue)). % 7.45/1.34 cnf(i_0_55, plain, (sorted(nil)=btrue)). % 7.45/1.34 cnf(i_0_41, plain, (lengthNat(nil)=z)). % 7.45/1.34 cnf(i_0_51, plain, (rev(nil)=nil)). % 7.45/1.34 cnf(i_0_64, plain, (eq(X1,X1)=btrue)). % 7.45/1.34 cnf(i_0_65, plain, (eq2(X1,X1)=btrue)). % 7.45/1.34 cnf(i_0_37, plain, (orb(bfalse,X1)=X1)). % 7.45/1.34 cnf(i_0_43, plain, (impl(btrue,X1)=X1)). % 7.45/1.34 cnf(i_0_36, plain, (orb(btrue,X1)=btrue)). % 7.45/1.34 cnf(i_0_44, plain, (impl(bfalse,X1)=btrue)). % 7.45/1.34 cnf(i_0_54, plain, (andb(bfalse,X1)=bfalse)). % 7.45/1.34 cnf(i_0_53, plain, (andb(btrue,X1)=X1)). % 7.45/1.34 cnf(i_0_45, plain, (elemNat(X1,nil)=bfalse)). % 7.45/1.34 cnf(i_0_38, plain, (leqNat(z,X1)=btrue)). % 7.45/1.34 cnf(i_0_49, plain, (append(nil,X1)=X1)). % 7.45/1.34 cnf(i_0_34, plain, (aux(X1,X2,btrue)=bfalse)). % 7.45/1.34 cnf(i_0_62, plain, (eq(z,s(X1))=bfalse)). % 7.45/1.34 cnf(i_0_39, plain, (leqNat(s(X1),z)=bfalse)). % 7.45/1.34 cnf(i_0_63, plain, (eq(s(X1),z)=bfalse)). % 7.45/1.34 cnf(i_0_56, plain, (sorted(cons(X1,nil))=btrue)). % 7.45/1.34 cnf(i_0_35, plain, (aux(X1,X2,bfalse)=unique(X2))). % 7.45/1.34 cnf(i_0_42, plain, (lengthNat(cons(X1,X2))=s(lengthNat(X2)))). % 7.45/1.34 cnf(i_0_40, plain, (leqNat(s(X1),s(X2))=leqNat(X1,X2))). % 7.45/1.34 cnf(i_0_61, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 7.45/1.34 cnf(i_0_52, plain, (append(rev(X1),cons(X2,nil))=rev(cons(X2,X1)))). % 7.45/1.34 cnf(i_0_50, plain, (append(cons(X1,X2),X3)=cons(X1,append(X2,X3)))). % 7.45/1.34 cnf(i_0_48, plain, (aux(X1,X2,elemNat(X1,X2))=unique(cons(X1,X2)))). % 7.45/1.34 cnf(i_0_46, plain, (orb(eq(X1,X2),elemNat(X1,X3))=elemNat(X1,cons(X2,X3)))). % 7.45/1.34 cnf(i_0_57, plain, (andb(leqNat(X1,X2),sorted(cons(X2,X3)))=sorted(cons(X1,cons(X2,X3))))). % 7.45/1.34 cnf(i_0_58, plain, (impl(eq2(sorted(rev(X1)),btrue),impl(eq2(unique(X1),btrue),eq2(leqNat(lengthNat(X1),s(s(s(z)))),btrue)))=psorted_rev(X1))). % 7.45/1.34 cnf(i_0_66, negated_conjecture, (eq2(psorted_rev(X1),bfalse)!=btrue)). % 7.45/1.34 cnf(i_0_68, plain, (X4=X4)). % 7.45/1.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.45/1.34 # Begin printing tableau % 7.45/1.34 # Found 5 steps % 7.45/1.34 cnf(i_0_60, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 7.45/1.34 cnf(i_0_88, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_86])). % 7.45/1.34 cnf(i_0_167, plain, (psorted_rev(eq2(btrue,bfalse))=psorted_rev(bfalse)), inference(extension_rule, [i_0_71])). % 7.45/1.34 cnf(i_0_178, plain, (psorted_rev(bfalse)!=orb(bfalse,psorted_rev(bfalse))), inference(closure_rule, [i_0_37])). % 7.45/1.34 cnf(i_0_176, plain, (psorted_rev(eq2(btrue,bfalse))=orb(bfalse,psorted_rev(bfalse))), inference(etableau_closure_rule, [i_0_176, ...])). % 7.45/1.34 # End printing tableau % 7.45/1.34 # SZS output end % 7.45/1.34 # Branches closed with saturation will be marked with an "s" % 7.45/1.34 # Child (22346) has found a proof. % 7.45/1.34 % 7.45/1.34 # Proof search is over... % 7.45/1.34 # Freeing feature tree %------------------------------------------------------------------------------