%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX202-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 : Thu Sep 24 03:14:14 PM UTC 2026
% Result : Unsatisfiable 93.50s 31.83s
% Output : CNFRefutation 93.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 31
% Syntax : Number of clauses : 109 ( 109 unt; 0 nHn; 11 RR)
% Number of literals : 109 ( 108 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 4 con; 0-5 aty)
% Number of variables : 239 ( 36 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_024,axiom,
msort(cons(X1,cons(X2,X3))) = aux3(X1,X2,X3,splitAtNat(div2(lengthNat(cons(X1,cons(X2,X3)))),cons(X1,cons(X2,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_024) ).
cnf(axiom_016,axiom,
lengthNat(cons(X1,X2)) = s(lengthNat(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).
cnf(axiom_021,axiom,
div2(s(s(X1))) = s(div2(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_021) ).
cnf(axiom,axiom,
aux(X1,X2,X3,pair2(X4,X5)) = pair2(cons(X2,X4),X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_006,axiom,
splitAtNat(z,X1) = pair2(nil,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).
cnf(axiom_008,axiom,
splitAtNat(s(X1),cons(X2,X3)) = aux(X1,X2,X3,splitAtNat(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
cnf(axiom_015,axiom,
lengthNat(nil) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_015) ).
cnf(axiom_019,axiom,
div2(z) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).
cnf(axiom_003,axiom,
aux3(X1,X2,X3,pair2(X4,X5)) = merge(msort(X4),msort(X5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_023,axiom,
msort(cons(X1,nil)) = cons(X1,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_023) ).
cnf(axiom_014,axiom,
merge(cons(X1,X2),cons(X3,X4)) = aux2(X1,X2,X3,X4,leqNat(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_014) ).
cnf(axiom_009,axiom,
leqNat(z,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).
cnf(axiom_001,axiom,
aux2(X1,X2,X3,X4,btrue) = cons(X1,merge(X2,cons(X3,X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_001) ).
cnf(axiom_011,axiom,
leqNat(s(X1),s(X2)) = leqNat(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).
cnf(axiom_012,axiom,
merge(nil,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).
cnf(axiom_026,axiom,
count(X1,cons(X2,X3)) = aux4(X1,X2,X3,eq(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_026) ).
cnf(axiom_031,axiom,
eq(z,s(X1)) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_031) ).
cnf(axiom_005,axiom,
aux4(X1,X2,X3,bfalse) = count(X1,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
cnf(axiom_010,axiom,
leqNat(s(X1),z) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_010) ).
cnf(axiom_002,axiom,
aux2(X1,X2,X3,X4,bfalse) = cons(X3,merge(cons(X1,X2),X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
cnf(axiom_020,axiom,
div2(s(z)) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).
cnf(axiom_027,axiom,
prop_msort_permutation_wrong2(X1,X2) = impl(eq2(leqNat(count(X2,X1),s(s(s(s(s(z)))))),bfalse),eq(count(s(X2),X1),count(X2,msort(X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_027) ).
cnf(axiom_033,axiom,
eq(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_033) ).
cnf(axiom_004,axiom,
aux4(X1,X2,X3,btrue) = s(count(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).
cnf(axiom_013,axiom,
merge(cons(X1,X2),nil) = cons(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_013) ).
cnf(axiom_032,axiom,
eq(s(X1),z) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_032) ).
cnf(goal,negated_conjecture,
eq2(prop_msort_permutation_wrong2(X1,X2),bfalse) != btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(axiom_025,axiom,
count(X1,nil) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_025) ).
cnf(axiom_034,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_034) ).
cnf(axiom_030,axiom,
eq(s(X1),s(X2)) = eq(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_030) ).
cnf(axiom_017,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_017) ).
cnf(c_0_31,axiom,
msort(cons(X1,cons(X2,X3))) = aux3(X1,X2,X3,splitAtNat(div2(lengthNat(cons(X1,cons(X2,X3)))),cons(X1,cons(X2,X3)))),
axiom_024 ).
cnf(c_0_32,axiom,
lengthNat(cons(X1,X2)) = s(lengthNat(X2)),
axiom_016 ).
cnf(c_0_33,axiom,
div2(s(s(X1))) = s(div2(X1)),
axiom_021 ).
cnf(c_0_34,axiom,
aux(X1,X2,X3,pair2(X4,X5)) = pair2(cons(X2,X4),X5),
axiom ).
cnf(c_0_35,axiom,
splitAtNat(z,X1) = pair2(nil,X1),
axiom_006 ).
cnf(c_0_36,plain,
aux3(X1,X2,X3,splitAtNat(s(div2(lengthNat(X3))),cons(X1,cons(X2,X3)))) = msort(cons(X1,cons(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_32]),c_0_33]) ).
cnf(c_0_37,plain,
aux(X1,X2,X3,splitAtNat(z,X4)) = pair2(cons(X2,nil),X4),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,axiom,
splitAtNat(s(X1),cons(X2,X3)) = aux(X1,X2,X3,splitAtNat(X1,X3)),
axiom_008 ).
cnf(c_0_39,plain,
aux3(X1,X2,cons(X3,X4),splitAtNat(s(div2(s(lengthNat(X4)))),cons(X1,cons(X2,cons(X3,X4))))) = msort(cons(X1,cons(X2,cons(X3,X4)))),
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_40,plain,
splitAtNat(s(z),cons(X1,X2)) = pair2(cons(X1,nil),X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,axiom,
lengthNat(nil) = z,
axiom_015 ).
cnf(c_0_42,axiom,
div2(z) = z,
axiom_019 ).
cnf(c_0_43,axiom,
aux3(X1,X2,X3,pair2(X4,X5)) = merge(msort(X4),msort(X5)),
axiom_003 ).
cnf(c_0_44,axiom,
msort(cons(X1,nil)) = cons(X1,nil),
axiom_023 ).
cnf(c_0_45,axiom,
merge(cons(X1,X2),cons(X3,X4)) = aux2(X1,X2,X3,X4,leqNat(X1,X3)),
axiom_014 ).
cnf(c_0_46,axiom,
leqNat(z,X1) = btrue,
axiom_009 ).
cnf(c_0_47,axiom,
aux2(X1,X2,X3,X4,btrue) = cons(X1,merge(X2,cons(X3,X4))),
axiom_001 ).
cnf(c_0_48,axiom,
leqNat(s(X1),s(X2)) = leqNat(X1,X2),
axiom_011 ).
cnf(c_0_49,plain,
aux3(X1,X2,cons(X3,cons(X4,X5)),splitAtNat(s(s(div2(lengthNat(X5)))),cons(X1,cons(X2,cons(X3,cons(X4,X5)))))) = msort(cons(X1,cons(X2,cons(X3,cons(X4,X5))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_33]) ).
cnf(c_0_50,plain,
splitAtNat(s(s(z)),cons(X1,cons(X2,X3))) = pair2(cons(X1,cons(X2,nil)),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_34]) ).
cnf(c_0_51,plain,
merge(cons(X1,nil),cons(X2,nil)) = msort(cons(X1,cons(X2,nil))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_41]),c_0_42]),c_0_40]),c_0_43]),c_0_44]),c_0_44]) ).
cnf(c_0_52,plain,
merge(cons(z,X1),cons(X2,X3)) = cons(z,merge(X1,cons(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_53,axiom,
merge(nil,X1) = X1,
axiom_012 ).
cnf(c_0_54,plain,
aux2(s(X1),X2,s(X3),X4,leqNat(X1,X3)) = merge(cons(s(X1),X2),cons(s(X3),X4)),
inference(spm,[status(thm)],[c_0_45,c_0_48]) ).
cnf(c_0_55,axiom,
count(X1,cons(X2,X3)) = aux4(X1,X2,X3,eq(X2,X1)),
axiom_026 ).
cnf(c_0_56,axiom,
eq(z,s(X1)) = bfalse,
axiom_031 ).
cnf(c_0_57,axiom,
aux4(X1,X2,X3,bfalse) = count(X1,X3),
axiom_005 ).
cnf(c_0_58,plain,
merge(msort(cons(X1,cons(X2,nil))),msort(cons(X3,cons(X4,nil)))) = msort(cons(X1,cons(X2,cons(X3,cons(X4,nil))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_41]),c_0_42]),c_0_50]),c_0_43]) ).
cnf(c_0_59,plain,
msort(cons(z,cons(X1,nil))) = cons(z,cons(X1,nil)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_60,plain,
merge(cons(s(z),X1),cons(s(X2),X3)) = cons(s(z),merge(X1,cons(s(X2),X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_46]),c_0_47]) ).
cnf(c_0_61,axiom,
leqNat(s(X1),z) = bfalse,
axiom_010 ).
cnf(c_0_62,axiom,
aux2(X1,X2,X3,X4,bfalse) = cons(X3,merge(cons(X1,X2),X4)),
axiom_002 ).
cnf(c_0_63,axiom,
div2(s(z)) = z,
axiom_020 ).
cnf(c_0_64,axiom,
prop_msort_permutation_wrong2(X1,X2) = impl(eq2(leqNat(count(X2,X1),s(s(s(s(s(z)))))),bfalse),eq(count(s(X2),X1),count(X2,msort(X1)))),
axiom_027 ).
cnf(c_0_65,plain,
count(s(X1),cons(z,X2)) = count(s(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_66,axiom,
eq(X1,X1) = btrue,
axiom_033 ).
cnf(c_0_67,axiom,
aux4(X1,X2,X3,btrue) = s(count(X1,X3)),
axiom_004 ).
cnf(c_0_68,plain,
merge(msort(cons(X1,cons(X2,nil))),cons(z,cons(X3,nil))) = msort(cons(X1,cons(X2,cons(z,cons(X3,nil))))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_69,plain,
msort(cons(s(z),cons(s(X1),nil))) = cons(s(z),cons(s(X1),nil)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_60]),c_0_53]) ).
cnf(c_0_70,plain,
merge(cons(s(X1),X2),cons(z,X3)) = cons(z,merge(cons(s(X1),X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_61]),c_0_62]) ).
cnf(c_0_71,plain,
merge(cons(X1,nil),msort(cons(X2,cons(X3,nil)))) = msort(cons(X1,cons(X2,cons(X3,nil)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_41]),c_0_63]),c_0_40]),c_0_43]),c_0_44]) ).
cnf(c_0_72,plain,
impl(eq2(leqNat(count(X1,cons(z,X2)),s(s(s(s(s(z)))))),bfalse),eq(count(s(X1),X2),count(X1,msort(cons(z,X2))))) = prop_msort_permutation_wrong2(cons(z,X2),X1),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_73,plain,
count(X1,cons(X1,X2)) = s(count(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_66]),c_0_67]) ).
cnf(c_0_74,plain,
cons(z,merge(cons(s(z),cons(s(X1),nil)),cons(X2,nil))) = msort(cons(s(z),cons(s(X1),cons(z,cons(X2,nil))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_75,axiom,
merge(cons(X1,X2),nil) = cons(X1,X2),
axiom_013 ).
cnf(c_0_76,plain,
merge(cons(z,cons(X1,nil)),msort(cons(X2,cons(X3,nil)))) = msort(cons(z,cons(X1,cons(X2,cons(X3,nil))))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_77,plain,
merge(cons(X1,nil),cons(s(z),cons(s(X2),nil))) = msort(cons(X1,cons(s(z),cons(s(X2),nil)))),
inference(spm,[status(thm)],[c_0_71,c_0_69]) ).
cnf(c_0_78,plain,
impl(eq2(leqNat(count(z,X1),s(s(s(s(z))))),bfalse),eq(count(s(z),X1),count(z,msort(cons(z,X1))))) = prop_msort_permutation_wrong2(cons(z,X1),z),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_48]) ).
cnf(c_0_79,plain,
lengthNat(msort(cons(s(z),cons(s(X1),cons(z,cons(X2,nil)))))) = s(lengthNat(merge(cons(s(z),cons(s(X1),nil)),cons(X2,nil)))),
inference(spm,[status(thm)],[c_0_32,c_0_74]) ).
cnf(c_0_80,plain,
splitAtNat(s(s(s(z))),cons(X1,cons(X2,cons(X3,X4)))) = pair2(cons(X1,cons(X2,cons(X3,nil))),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_50]),c_0_34]) ).
cnf(c_0_81,plain,
aux3(X1,X2,cons(X3,msort(cons(s(z),cons(s(X4),cons(z,cons(X5,nil)))))),splitAtNat(s(s(div2(lengthNat(merge(cons(s(z),cons(s(X4),nil)),cons(X5,nil)))))),cons(X1,cons(X2,cons(X3,msort(cons(s(z),cons(s(X4),cons(z,cons(X5,nil)))))))))) = msort(cons(X1,cons(X2,cons(X3,msort(cons(s(z),cons(s(X4),cons(z,cons(X5,nil))))))))),
inference(spm,[status(thm)],[c_0_49,c_0_74]) ).
cnf(c_0_82,plain,
msort(cons(s(z),cons(s(X1),cons(z,cons(z,nil))))) = cons(z,cons(z,cons(s(z),cons(s(X1),nil)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_70]),c_0_75]) ).
cnf(c_0_83,plain,
msort(cons(z,cons(X1,cons(s(z),cons(s(X2),nil))))) = cons(z,msort(cons(X1,cons(s(z),cons(s(X2),nil))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_69]),c_0_52]),c_0_77]) ).
cnf(c_0_84,plain,
msort(cons(z,cons(s(z),cons(s(X1),nil)))) = cons(z,cons(s(z),cons(s(X1),nil))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_77]),c_0_53]) ).
cnf(c_0_85,plain,
merge(cons(X1,nil),cons(z,cons(X2,nil))) = msort(cons(X1,cons(z,cons(X2,nil)))),
inference(spm,[status(thm)],[c_0_71,c_0_59]) ).
cnf(c_0_86,plain,
impl(eq2(leqNat(count(z,X1),s(s(s(z)))),bfalse),eq(count(s(z),X1),count(z,msort(cons(z,cons(z,X1)))))) = prop_msort_permutation_wrong2(cons(z,cons(z,X1)),z),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_65]),c_0_73]),c_0_48]) ).
cnf(c_0_87,plain,
aux3(X1,X2,cons(X3,cons(X4,msort(cons(s(z),cons(s(X5),cons(z,cons(X6,nil))))))),splitAtNat(s(s(div2(s(lengthNat(merge(cons(s(z),cons(s(X5),nil)),cons(X6,nil))))))),cons(X1,cons(X2,cons(X3,cons(X4,msort(cons(s(z),cons(s(X5),cons(z,cons(X6,nil))))))))))) = msort(cons(X1,cons(X2,cons(X3,cons(X4,msort(cons(s(z),cons(s(X5),cons(z,cons(X6,nil)))))))))),
inference(spm,[status(thm)],[c_0_49,c_0_79]) ).
cnf(c_0_88,plain,
splitAtNat(s(s(s(s(z)))),cons(X1,cons(X2,cons(X3,cons(X4,X5))))) = pair2(cons(X1,cons(X2,cons(X3,cons(X4,nil)))),X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_80]),c_0_34]) ).
cnf(c_0_89,plain,
merge(msort(cons(X1,cons(X2,cons(X3,nil)))),cons(z,cons(z,cons(s(z),cons(s(X4),nil))))) = msort(cons(X1,cons(X2,cons(X3,cons(z,cons(z,cons(s(z),cons(s(X4),nil)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_70]),c_0_75]),c_0_32]),c_0_32]),c_0_32]),c_0_41]),c_0_33]),c_0_63]),c_0_80]),c_0_43]),c_0_83]),c_0_84]) ).
cnf(c_0_90,plain,
msort(cons(z,cons(z,cons(X1,nil)))) = cons(z,cons(z,cons(X1,nil))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_85]),c_0_53]) ).
cnf(c_0_91,plain,
impl(eq2(leqNat(count(z,X1),s(s(z))),bfalse),eq(count(s(z),X1),count(z,msort(cons(z,cons(z,cons(z,X1))))))) = prop_msort_permutation_wrong2(cons(z,cons(z,cons(z,X1))),z),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_65]),c_0_73]),c_0_48]) ).
cnf(c_0_92,plain,
merge(msort(cons(X1,cons(X2,cons(X3,cons(X4,nil))))),cons(z,cons(z,cons(s(z),cons(s(X5),nil))))) = msort(cons(X1,cons(X2,cons(X3,cons(X4,cons(z,cons(z,cons(s(z),cons(s(X5),nil))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_82]),c_0_70]),c_0_75]),c_0_32]),c_0_32]),c_0_32]),c_0_41]),c_0_33]),c_0_33]),c_0_42]),c_0_88]),c_0_43]),c_0_83]),c_0_84]) ).
cnf(c_0_93,plain,
msort(cons(z,cons(X1,cons(z,cons(X2,nil))))) = cons(z,msort(cons(X1,cons(z,cons(X2,nil))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_59]),c_0_52]),c_0_85]) ).
cnf(c_0_94,axiom,
eq(s(X1),z) = bfalse,
axiom_032 ).
cnf(c_0_95,plain,
cons(z,cons(z,merge(cons(X1,nil),cons(z,cons(z,cons(s(z),cons(s(X2),nil))))))) = msort(cons(z,cons(z,cons(X1,cons(z,cons(z,cons(s(z),cons(s(X2),nil)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_52]),c_0_52]) ).
cnf(c_0_96,negated_conjecture,
eq2(prop_msort_permutation_wrong2(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_97,plain,
impl(eq2(leqNat(count(z,X1),s(z)),bfalse),eq(count(s(z),X1),count(z,msort(cons(z,cons(z,cons(z,cons(z,X1)))))))) = prop_msort_permutation_wrong2(cons(z,cons(z,cons(z,cons(z,X1)))),z),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_65]),c_0_73]),c_0_48]) ).
cnf(c_0_98,plain,
msort(cons(z,cons(X1,cons(z,cons(X2,cons(z,cons(z,cons(s(z),cons(s(X3),nil))))))))) = cons(z,msort(cons(X1,cons(z,cons(X2,cons(z,cons(z,cons(s(z),cons(s(X3),nil))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_52]),c_0_89]) ).
cnf(c_0_99,plain,
count(z,cons(s(X1),X2)) = count(z,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_94]),c_0_57]) ).
cnf(c_0_100,axiom,
count(X1,nil) = z,
axiom_025 ).
cnf(c_0_101,axiom,
eq2(X1,X1) = btrue,
axiom_034 ).
cnf(c_0_102,plain,
msort(cons(z,cons(z,cons(z,cons(z,cons(z,cons(s(z),cons(s(X1),nil)))))))) = cons(z,cons(z,cons(z,cons(z,cons(z,cons(s(z),cons(s(X1),nil))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_52]),c_0_53]) ).
cnf(c_0_103,axiom,
eq(s(X1),s(X2)) = eq(X1,X2),
axiom_030 ).
cnf(c_0_104,axiom,
impl(btrue,X1) = X1,
axiom_017 ).
cnf(c_0_105,negated_conjecture,
eq2(prop_msort_permutation_wrong2(X1,X2),bfalse) != btrue,
c_0_96 ).
cnf(c_0_106,plain,
prop_msort_permutation_wrong2(cons(z,cons(z,cons(z,cons(z,cons(z,cons(z,cons(s(z),cons(s(X1),nil)))))))),z) = eq(count(s(z),cons(s(X1),nil)),s(s(s(s(s(z)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_73]),c_0_73]),c_0_99]),c_0_99]),c_0_100]),c_0_48]),c_0_61]),c_0_101]),c_0_65]),c_0_65]),c_0_73]),c_0_102]),c_0_73]),c_0_73]),c_0_73]),c_0_73]),c_0_73]),c_0_73]),c_0_99]),c_0_99]),c_0_100]),c_0_103]),c_0_104]) ).
cnf(c_0_107,negated_conjecture,
eq2(eq(count(s(z),cons(s(X1),nil)),s(s(s(s(s(z)))))),bfalse) != btrue,
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_108,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_73]),c_0_100]),c_0_103]),c_0_56]),c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWX202-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.09 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.48 % Computer : n005.cluster.edu
% 0.20/0.48 % Model : x86_64 x86_64
% 0.20/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.48 % Memory : 8046.5625MB
% 0.20/0.48 % OS : Linux 6.8.0-71-generic
% 0.20/0.48 % CPULimit : 300
% 0.20/0.48 % WCLimit : 300
% 0.20/0.48 % DateTime : Mon Sep 21 10:33:33 UTC 2026
% 0.20/0.49 % CPUTime :
% 0.20/0.49 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.58 Running first-order theorem proving
% 0.26/0.58 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 93.50/31.83 % Version: 3.5.1
% 93.50/31.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 93.50/31.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.50/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.50/31.83 % Starting new_bool_3 with 300s (1) cores
% 93.50/31.83 % Starting new_bool_1 with 300s (1) cores
% 93.50/31.83 % Starting sh5l with 300s (1) cores
% 93.50/31.83 % new_bool_1 with pid 3238638 completed with status 9
% 93.50/31.83 % new_bool_3 with pid 3238637 completed with status 9
% 93.50/31.83 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3238636 completed with status 0
% 93.50/31.83 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 93.50/31.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 93.50/31.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.50/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.50/31.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 93.50/31.83 % No SInE strategy applied
% 93.50/31.83 % Search class: FUUPM-FFMM32-DFFFFFNN
% 93.50/31.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 93.50/31.83 % Starting SubtermCWHack with 136s (1) cores
% 93.50/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 93.50/31.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 93.50/31.83 % Starting new_bool_3 with 136s (1) cores
% 93.50/31.83 % Starting new_bool_1 with 136s (1) cores
% 93.50/31.83 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3238641 completed with status 0
% 93.50/31.83 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 93.50/31.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 93.50/31.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 93.50/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 93.50/31.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 93.50/31.83 % No SInE strategy applied
% 93.50/31.83 % Search class: FUUPM-FFMM32-DFFFFFNN
% 93.50/31.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 93.50/31.83 % Starting SubtermCWHack with 136s (1) cores
% 93.50/31.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 93.50/31.83 % Preprocessing time : 0.002 s
% 93.50/31.83 % Presaturation interreduction done
% 93.50/31.83
% 93.50/31.83 % Proof found!
% 93.50/31.83 % SZS status Unsatisfiable
% 93.50/31.83 % SZS output start CNFRefutation
% See solution above
% 93.50/31.84 % Parsed axioms : 36
% 93.50/31.84 % Removed by relevancy pruning/SinE : 0
% 93.50/31.84 % Initial clauses : 36
% 93.50/31.84 % Removed in clause preprocessing : 0
% 93.50/31.84 % Initial clauses in saturation : 36
% 93.50/31.84 % Processed clauses : 16526
% 93.50/31.84 % ...of these trivial : 4208
% 93.50/31.84 % ...subsumed : 5031
% 93.50/31.84 % ...remaining for further processing : 7287
% 93.50/31.84 % Other redundant clauses eliminated : 0
% 93.50/31.84 % Clauses deleted for lack of memory : 0
% 93.50/31.84 % Backward-subsumed : 0
% 93.50/31.84 % Backward-rewritten : 896
% 93.50/31.84 % Generated clauses : 411691
% 93.50/31.84 % ...of the previous two non-redundant : 377519
% 93.50/31.84 % ...aggressively subsumed : 0
% 93.50/31.84 % Contextual simplify-reflections : 0
% 93.50/31.84 % Paramodulations : 411691
% 93.50/31.84 % Factorizations : 0
% 93.50/31.84 % NegExts : 0
% 93.50/31.84 % Equation resolutions : 0
% 93.50/31.84 % Disequality decompositions : 0
% 93.50/31.84 % Total rewrite steps : 401323
% 93.50/31.84 % ...of those cached : 329332
% 93.50/31.84 % Propositional unsat checks : 1
% 93.50/31.84 % Propositional check models : 1
% 93.50/31.84 % Propositional check unsatisfiable : 0
% 93.50/31.84 % Propositional clauses : 0
% 93.50/31.84 % Propositional clauses after purity: 0
% 93.50/31.84 % Propositional unsat core size : 0
% 93.50/31.84 % Propositional preprocessing time : 0.000
% 93.50/31.84 % Propositional encoding time : 3.581
% 93.50/31.84 % Propositional solver time : 0.031
% 93.50/31.84 % Success case prop preproc time : 0.000
% 93.50/31.84 % Success case prop encoding time : 0.000
% 93.50/31.84 % Success case prop solver time : 0.000
% 93.50/31.84 % Current number of processed clauses : 6355
% 93.50/31.84 % Positive orientable unit clauses : 6352
% 93.50/31.84 % Positive unorientable unit clauses: 0
% 93.50/31.84 % Negative unit clauses : 3
% 93.50/31.84 % Non-unit-clauses : 0
% 93.50/31.84 % Current number of unprocessed clauses: 360220
% 93.50/31.84 % ...number of literals in the above : 360220
% 93.50/31.84 % Current number of archived formulas : 0
% 93.50/31.84 % Current number of archived clauses : 932
% 93.50/31.84 % Clause-clause subsumption calls (NU) : 0
% 93.50/31.84 % Rec. Clause-clause subsumption calls : 0
% 93.50/31.84 % Non-unit clause-clause subsumptions : 0
% 93.50/31.84 % Unit Clause-clause subsumption calls : 3
% 93.50/31.84 % Rewrite failures with RHS unbound : 0
% 93.50/31.84 % BW rewrite match attempts : 2177629
% 93.50/31.84 % BW rewrite match successes : 828
% 93.50/31.84 % Condensation attempts : 0
% 93.50/31.84 % Condensation successes : 0
% 93.50/31.84 % Termbank termtop insertions : 29762902
% 93.50/31.84 % Search garbage collected termcells : 2
% 93.50/31.84
% 93.50/31.84 % -------------------------------------------------
% 93.50/31.84 % User time : 29.701 s
% 93.50/31.84 % System time : 1.265 s
% 93.50/31.84 % Total time : 30.966 s
% 93.50/31.84 % Maximum resident set size: 3404 pages
% 93.50/31.84
% 93.50/31.84 % -------------------------------------------------
% 93.50/31.84 % User time : 149.632 s
% 93.50/31.84 % System time : 5.879 s
% 93.50/31.84 % Total time : 155.511 s
% 93.50/31.84 % Maximum resident set size: 4608 pages
% 93.50/31.84 % E exiting
%------------------------------------------------------------------------------