%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX201-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 : n009.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 209.35s 42.49s
% Output : CNFRefutation 209.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 29
% Syntax : Number of clauses : 92 ( 92 unt; 0 nHn; 10 RR)
% Number of literals : 92 ( 91 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 198 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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_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_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_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_020,axiom,
div2(s(z)) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).
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_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_027,axiom,
prop_msort_permutation_wrong1(X1,X2) = impl(eq2(leqNat(count(X2,X1),s(s(s(s(s(z)))))),bfalse),eq(count(X2,X1),count(s(X2),msort(X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_027) ).
cnf(axiom_011,axiom,
leqNat(s(X1),s(X2)) = leqNat(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).
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_030,axiom,
eq(s(X1),s(X2)) = eq(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_030) ).
cnf(axiom_010,axiom,
leqNat(s(X1),z) = bfalse,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_010) ).
cnf(axiom_034,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_034) ).
cnf(axiom_017,axiom,
impl(btrue,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_017) ).
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_wrong1(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(c_0_29,axiom,
aux(X1,X2,X3,pair2(X4,X5)) = pair2(cons(X2,X4),X5),
axiom ).
cnf(c_0_30,axiom,
splitAtNat(z,X1) = pair2(nil,X1),
axiom_006 ).
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,plain,
aux(X1,X2,X3,splitAtNat(z,X4)) = pair2(cons(X2,nil),X4),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,axiom,
splitAtNat(s(X1),cons(X2,X3)) = aux(X1,X2,X3,splitAtNat(X1,X3)),
axiom_008 ).
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,axiom,
merge(cons(X1,X2),cons(X3,X4)) = aux2(X1,X2,X3,X4,leqNat(X1,X3)),
axiom_014 ).
cnf(c_0_38,axiom,
leqNat(z,X1) = btrue,
axiom_009 ).
cnf(c_0_39,axiom,
aux2(X1,X2,X3,X4,btrue) = cons(X1,merge(X2,cons(X3,X4))),
axiom_001 ).
cnf(c_0_40,axiom,
lengthNat(nil) = z,
axiom_015 ).
cnf(c_0_41,axiom,
div2(z) = z,
axiom_019 ).
cnf(c_0_42,plain,
splitAtNat(s(z),cons(X1,X2)) = pair2(cons(X1,nil),X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
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,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_46,axiom,
div2(s(z)) = z,
axiom_020 ).
cnf(c_0_47,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_37,c_0_38]),c_0_39]) ).
cnf(c_0_48,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_40]),c_0_41]),c_0_42]),c_0_43]),c_0_44]),c_0_44]) ).
cnf(c_0_49,axiom,
merge(nil,X1) = X1,
axiom_012 ).
cnf(c_0_50,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_45,c_0_32]),c_0_33]) ).
cnf(c_0_51,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_45,c_0_40]),c_0_46]),c_0_42]),c_0_43]),c_0_44]) ).
cnf(c_0_52,plain,
msort(cons(z,cons(X1,nil))) = cons(z,cons(X1,nil)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
aux3(X1,X2,cons(X3,cons(X4,cons(X5,X6))),splitAtNat(s(s(div2(s(lengthNat(X6))))),cons(X1,cons(X2,cons(X3,cons(X4,cons(X5,X6))))))) = msort(cons(X1,cons(X2,cons(X3,cons(X4,cons(X5,X6)))))),
inference(spm,[status(thm)],[c_0_50,c_0_32]) ).
cnf(c_0_54,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_35,c_0_42]),c_0_29]) ).
cnf(c_0_55,plain,
merge(cons(X1,nil),cons(z,cons(X2,nil))) = msort(cons(X1,cons(z,cons(X2,nil)))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
merge(msort(cons(X1,cons(X2,nil))),msort(cons(X3,cons(X4,cons(X5,nil))))) = msort(cons(X1,cons(X2,cons(X3,cons(X4,cons(X5,nil)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_40]),c_0_46]),c_0_54]),c_0_43]) ).
cnf(c_0_57,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_47,c_0_55]),c_0_49]) ).
cnf(c_0_58,plain,
merge(msort(cons(X1,cons(X2,nil))),cons(z,cons(z,cons(X3,nil)))) = msort(cons(X1,cons(X2,cons(z,cons(z,cons(X3,nil)))))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,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_50,c_0_40]),c_0_41]),c_0_54]),c_0_43]) ).
cnf(c_0_60,plain,
cons(z,merge(cons(X1,nil),cons(z,cons(z,cons(X2,nil))))) = msort(cons(z,cons(X1,cons(z,cons(z,cons(X2,nil)))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_52]),c_0_47]) ).
cnf(c_0_61,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_59,c_0_52]) ).
cnf(c_0_62,axiom,
count(X1,cons(X2,X3)) = aux4(X1,X2,X3,eq(X2,X1)),
axiom_026 ).
cnf(c_0_63,axiom,
eq(X1,X1) = btrue,
axiom_033 ).
cnf(c_0_64,axiom,
aux4(X1,X2,X3,btrue) = s(count(X1,X3)),
axiom_004 ).
cnf(c_0_65,plain,
aux3(X1,X2,msort(cons(z,cons(X3,cons(z,cons(z,cons(X4,nil)))))),splitAtNat(s(div2(s(lengthNat(merge(cons(X3,nil),cons(z,cons(z,cons(X4,nil)))))))),cons(X1,cons(X2,msort(cons(z,cons(X3,cons(z,cons(z,cons(X4,nil)))))))))) = msort(cons(X1,cons(X2,msort(cons(z,cons(X3,cons(z,cons(z,cons(X4,nil))))))))),
inference(spm,[status(thm)],[c_0_45,c_0_60]) ).
cnf(c_0_66,plain,
msort(cons(z,cons(z,cons(z,cons(z,cons(X1,nil)))))) = cons(z,cons(z,cons(z,cons(z,cons(X1,nil))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_47]),c_0_49]) ).
cnf(c_0_67,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_35,c_0_54]),c_0_29]) ).
cnf(c_0_68,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_61,c_0_52]),c_0_47]),c_0_55]) ).
cnf(c_0_69,axiom,
prop_msort_permutation_wrong1(X1,X2) = impl(eq2(leqNat(count(X2,X1),s(s(s(s(s(z)))))),bfalse),eq(count(X2,X1),count(s(X2),msort(X1)))),
axiom_027 ).
cnf(c_0_70,plain,
count(X1,cons(X1,X2)) = s(count(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_71,axiom,
leqNat(s(X1),s(X2)) = leqNat(X1,X2),
axiom_011 ).
cnf(c_0_72,plain,
merge(msort(cons(X1,cons(X2,cons(z,nil)))),cons(z,cons(z,cons(z,cons(X3,nil))))) = msort(cons(X1,cons(X2,cons(z,cons(z,cons(z,cons(z,cons(X3,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_47]),c_0_49]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_40]),c_0_33]),c_0_33]),c_0_46]),c_0_67]),c_0_43]),c_0_68]),c_0_57]) ).
cnf(c_0_73,axiom,
eq(z,s(X1)) = bfalse,
axiom_031 ).
cnf(c_0_74,axiom,
aux4(X1,X2,X3,bfalse) = count(X1,X3),
axiom_005 ).
cnf(c_0_75,axiom,
eq(s(X1),s(X2)) = eq(X1,X2),
axiom_030 ).
cnf(c_0_76,plain,
impl(eq2(leqNat(count(X1,X2),s(s(s(s(z))))),bfalse),eq(s(count(X1,X2)),count(s(X1),msort(cons(X1,X2))))) = prop_msort_permutation_wrong1(cons(X1,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_77,plain,
msort(cons(z,cons(z,cons(z,cons(z,cons(z,cons(z,cons(X1,nil)))))))) = cons(z,cons(z,cons(z,cons(z,cons(z,cons(z,cons(X1,nil))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_57]),c_0_47]),c_0_47]),c_0_47]),c_0_49]) ).
cnf(c_0_78,axiom,
leqNat(s(X1),z) = bfalse,
axiom_010 ).
cnf(c_0_79,axiom,
eq2(X1,X1) = btrue,
axiom_034 ).
cnf(c_0_80,plain,
count(s(X1),cons(z,X2)) = count(s(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_73]),c_0_74]) ).
cnf(c_0_81,axiom,
impl(btrue,X1) = X1,
axiom_017 ).
cnf(c_0_82,plain,
aux4(s(X1),s(X2),X3,eq(X2,X1)) = count(s(X1),cons(s(X2),X3)),
inference(spm,[status(thm)],[c_0_62,c_0_75]) ).
cnf(c_0_83,axiom,
eq(s(X1),z) = bfalse,
axiom_032 ).
cnf(c_0_84,negated_conjecture,
eq2(prop_msort_permutation_wrong1(X1,X2),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_85,plain,
eq(s(s(s(s(s(s(count(z,cons(X1,nil)))))))),count(s(z),cons(X1,nil))) = prop_msort_permutation_wrong1(cons(z,cons(z,cons(z,cons(z,cons(z,cons(z,cons(X1,nil))))))),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_76,c_0_77]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_71]),c_0_71]),c_0_71]),c_0_71]),c_0_78]),c_0_79]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_70]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_80]),c_0_81]) ).
cnf(c_0_86,plain,
count(s(z),cons(s(s(X1)),X2)) = count(s(z),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_74]) ).
cnf(c_0_87,plain,
count(z,cons(s(X1),X2)) = count(z,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_83]),c_0_74]) ).
cnf(c_0_88,axiom,
count(X1,nil) = z,
axiom_025 ).
cnf(c_0_89,negated_conjecture,
eq2(prop_msort_permutation_wrong1(X1,X2),bfalse) != btrue,
c_0_84 ).
cnf(c_0_90,plain,
prop_msort_permutation_wrong1(cons(z,cons(z,cons(z,cons(z,cons(z,cons(z,cons(s(s(X1)),nil))))))),z) = bfalse,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]),c_0_88]),c_0_88]),c_0_83]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX201-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n009.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 10:33:43 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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
% 209.35/42.49 % Version: 3.5.1
% 209.35/42.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 209.35/42.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 209.35/42.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 209.35/42.49 % Starting new_bool_3 with 300s (1) cores
% 209.35/42.49 % Starting new_bool_1 with 300s (1) cores
% 209.35/42.49 % Starting sh5l with 300s (1) cores
% 209.35/42.49 % new_bool_1 with pid 1519662 completed with status 9
% 209.35/42.49 % new_bool_3 with pid 1519661 completed with status 9
% 209.35/42.49 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1519660 completed with status 0
% 209.35/42.49 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 209.35/42.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 209.35/42.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 209.35/42.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 209.35/42.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 209.35/42.49 % No SInE strategy applied
% 209.35/42.49 % Search class: FUUPM-FFMM32-DFFFFFNN
% 209.35/42.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 209.35/42.49 % Starting SubtermCWHack with 136s (1) cores
% 209.35/42.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 209.35/42.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 209.35/42.49 % Starting new_bool_3 with 136s (1) cores
% 209.35/42.49 % Starting new_bool_1 with 136s (1) cores
% 209.35/42.49 % SubtermCWHack with pid 1519664 completed with status 0
% 209.35/42.49 % Result found by SubtermCWHack
% 209.35/42.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 209.35/42.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 209.35/42.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 209.35/42.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 209.35/42.49 % No SInE strategy applied
% 209.35/42.49 % Search class: FUUPM-FFMM32-DFFFFFNN
% 209.35/42.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 209.35/42.49 % Starting SubtermCWHack with 136s (1) cores
% 209.35/42.49 % Preprocessing time : 0.001 s
% 209.35/42.49
% 209.35/42.49 % Proof found!
% 209.35/42.49 % SZS status Unsatisfiable
% 209.35/42.49 % SZS output start CNFRefutation
% See solution above
% 209.35/42.49 % Parsed axioms : 36
% 209.35/42.49 % Removed by relevancy pruning/SinE : 0
% 209.35/42.49 % Initial clauses : 36
% 209.35/42.49 % Removed in clause preprocessing : 0
% 209.35/42.49 % Initial clauses in saturation : 36
% 209.35/42.49 % Processed clauses : 35342
% 209.35/42.49 % ...of these trivial : 6260
% 209.35/42.49 % ...subsumed : 13003
% 209.35/42.49 % ...remaining for further processing : 16079
% 209.35/42.49 % Other redundant clauses eliminated : 0
% 209.35/42.49 % Clauses deleted for lack of memory : 0
% 209.35/42.49 % Backward-subsumed : 0
% 209.35/42.49 % Backward-rewritten : 2177
% 209.35/42.49 % Generated clauses : 459954
% 209.35/42.49 % ...of the previous two non-redundant : 395502
% 209.35/42.49 % ...aggressively subsumed : 0
% 209.35/42.49 % Contextual simplify-reflections : 0
% 209.35/42.49 % Paramodulations : 459954
% 209.35/42.49 % Factorizations : 0
% 209.35/42.49 % NegExts : 0
% 209.35/42.49 % Equation resolutions : 0
% 209.35/42.49 % Disequality decompositions : 0
% 209.35/42.49 % Total rewrite steps : 521178
% 209.35/42.49 % ...of those cached : 426498
% 209.35/42.49 % Propositional unsat checks : 0
% 209.35/42.49 % Propositional check models : 0
% 209.35/42.49 % Propositional check unsatisfiable : 0
% 209.35/42.49 % Propositional clauses : 0
% 209.35/42.49 % Propositional clauses after purity: 0
% 209.35/42.49 % Propositional unsat core size : 0
% 209.35/42.49 % Propositional preprocessing time : 0.000
% 209.35/42.49 % Propositional encoding time : 0.000
% 209.35/42.49 % Propositional solver time : 0.000
% 209.35/42.49 % Success case prop preproc time : 0.000
% 209.35/42.49 % Success case prop encoding time : 0.000
% 209.35/42.49 % Success case prop solver time : 0.000
% 209.35/42.49 % Current number of processed clauses : 13902
% 209.35/42.49 % Positive orientable unit clauses : 13899
% 209.35/42.49 % Positive unorientable unit clauses: 1
% 209.35/42.49 % Negative unit clauses : 2
% 209.35/42.49 % Non-unit-clauses : 0
% 209.35/42.49 % Current number of unprocessed clauses: 357755
% 209.35/42.49 % ...number of literals in the above : 357755
% 209.35/42.49 % Current number of archived formulas : 0
% 209.35/42.49 % Current number of archived clauses : 2177
% 209.35/42.49 % Clause-clause subsumption calls (NU) : 0
% 209.35/42.49 % Rec. Clause-clause subsumption calls : 0
% 209.35/42.49 % Non-unit clause-clause subsumptions : 0
% 209.35/42.49 % Unit Clause-clause subsumption calls : 682
% 209.35/42.49 % Rewrite failures with RHS unbound : 0
% 209.35/42.49 % BW rewrite match attempts : 16547399
% 209.35/42.49 % BW rewrite match successes : 2145
% 209.35/42.49 % Condensation attempts : 0
% 209.35/42.49 % Condensation successes : 0
% 209.35/42.49 % Termbank termtop insertions : 28566944
% 209.35/42.49 % Search garbage collected termcells : 2
% 209.35/42.49
% 209.35/42.49 % -------------------------------------------------
% 209.35/42.49 % User time : 40.730 s
% 209.35/42.49 % System time : 0.980 s
% 209.35/42.49 % Total time : 41.711 s
% 209.35/42.49 % Maximum resident set size: 3660 pages
% 209.35/42.49
% 209.35/42.49 % -------------------------------------------------
% 209.35/42.49 % User time : 202.983 s
% 209.35/42.49 % System time : 6.289 s
% 209.35/42.49 % Total time : 209.272 s
% 209.35/42.49 % Maximum resident set size: 4608 pages
% 209.35/42.49 % E exiting
%------------------------------------------------------------------------------