%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS008-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 : Tue Sep 29 11:41:27 AM UTC 2026
% Result : Satisfiable 3.97s 1.56s
% Output : Saturation 5.63s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u103,negated_conjecture,
~ r(exist,u6r3(exist)) ).
cnf(u108,negated_conjecture,
r(exist,u6r1(exist)) ).
cnf(u115,negated_conjecture,
r(exist,u6r2(exist)) ).
cnf(u120,negated_conjecture,
~ r(exist,u6r4(exist)) ).
cnf(u137,negated_conjecture,
~ s1most(u4r1(exist)) ).
cnf(u489,negated_conjecture,
equalish(u6r3(exist),u6r3(exist)) ).
cnf(u493,negated_conjecture,
( equalish(X0,u6r3(exist))
| equalish(X0,u6r1(exist))
| ~ r(exist,X0) ) ).
cnf(u497,negated_conjecture,
equalish(u6r1(exist),u6r3(exist)) ).
cnf(u505,negated_conjecture,
equalish(u6r2(exist),u6r3(exist)) ).
cnf(u509,negated_conjecture,
( equalish(X0,u4r1(exist))
| ~ r(exist,X0)
| equalish(X0,u6r3(exist)) ) ).
cnf(u517,negated_conjecture,
( equalish(X0,u4r2(exist))
| ~ r(exist,X0)
| equalish(X0,u6r3(exist)) ) ).
cnf(u534,negated_conjecture,
equalish(u6r1(exist),u6r1(exist)) ).
cnf(u538,negated_conjecture,
( equalish(X0,u6r1(exist))
| equalish(X0,u6r2(exist))
| ~ r(exist,X0) ) ).
cnf(u541,negated_conjecture,
~ equalish(u6r2(exist),u6r1(exist)) ).
cnf(u546,negated_conjecture,
( equalish(X0,u4r1(exist))
| ~ r(exist,X0)
| equalish(X0,u6r1(exist)) ) ).
cnf(u554,negated_conjecture,
( equalish(X0,u4r2(exist))
| ~ r(exist,X0)
| equalish(X0,u6r1(exist)) ) ).
cnf(u604,negated_conjecture,
~ s1most(u6r1(exist)) ).
cnf(u631,negated_conjecture,
~ s1most(u6r2(exist)) ).
cnf(u708,negated_conjecture,
( equalish(X0,u4r1(exist))
| ~ r(exist,X0)
| equalish(X0,u6r2(exist)) ) ).
cnf(u716,negated_conjecture,
( equalish(X0,u4r2(exist))
| ~ r(exist,X0)
| equalish(X0,u6r2(exist)) ) ).
cnf(u733,negated_conjecture,
equalish(u6r2(exist),u6r2(exist)) ).
cnf(u746,negated_conjecture,
s2least(u6r1(exist)) ).
cnf(u758,negated_conjecture,
s2least(u6r2(exist)) ).
cnf(u805,negated_conjecture,
c(u6r1(exist)) ).
cnf(u814,negated_conjecture,
c(u6r2(exist)) ).
cnf(u856,negated_conjecture,
( equalish(X0,u4r1(exist))
| ~ r(exist,X0) ) ).
cnf(u864,negated_conjecture,
( ~ r(exist,X0)
| equalish(X0,u4r2(exist))
| equalish(X0,u4r1(exist)) ) ).
cnf(u1076,negated_conjecture,
( equalish(X0,u4r2(exist))
| ~ r(exist,X0) ) ).
cnf(clause_3,axiom,
( ~ c(X0)
| s2least(X0) ) ).
cnf(u476,negated_conjecture,
( ~ r(exist,X1)
| equalish(X1,u4r2(exist))
| ~ r(exist,X0)
| equalish(X0,u4r2(exist))
| equalish(X0,X1) ) ).
cnf(u951,negated_conjecture,
s(u6r1(exist),u1r1(u6r1(exist))) ).
cnf(clause_22,axiom,
( ~ equalish(u5r2(X0),u5r1(X0))
| r2most(X0) ) ).
cnf(u66,negated_conjecture,
r(exist,u4r2(exist)) ).
cnf(u94,axiom,
( s(u6r2(X0),u1r1(u6r2(X0)))
| f(X0)
| r(X0,u6r4(X0)) ) ).
cnf(u373,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u257,axiom,
( ~ s(u6r2(X0),X1)
| r(X0,u6r4(X0))
| ~ s1most(u6r2(X0))
| f(X0)
| equalish(X1,u1r2(u6r2(X0))) ) ).
cnf(clause_49,axiom,
( f(X0)
| r(X0,u6r1(X0))
| r(X0,u6r4(X0)) ) ).
cnf(u81,axiom,
( s1most(u6r4(X0))
| f(X0)
| r(X0,u6r1(X0)) ) ).
cnf(clause_40,axiom,
( ~ equalish(u6r4(X0),u6r3(X0))
| c(u6r2(X0))
| f(X0) ) ).
cnf(u1037,negated_conjecture,
s(u6r2(exist),u3r2(u6r2(exist))) ).
cnf(u348,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u63,negated_conjecture,
s(u4r1(exist),u1r2(u4r1(exist))) ).
cnf(u343,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r2(u6r1(X0))) ) ).
cnf(clause_7,axiom,
( ~ s2least(X0)
| s(X0,u1r2(X0)) ) ).
cnf(clause_10,axiom,
( ~ s1most(X0)
| d(X0) ) ).
cnf(u70,axiom,
( s1most(u6r3(X0))
| f(X0)
| c(u6r2(X0)) ) ).
cnf(u394,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u397,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(clause_25,axiom,
( r2most(X0)
| r(X0,u5r1(X0)) ) ).
cnf(u421,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u85,axiom,
( s(u6r1(X0),u1r1(u6r1(X0)))
| f(X0)
| r(X0,u6r3(X0)) ) ).
cnf(u157,axiom,
( s(X0,u1r2(X0))
| d(X0)
| equalish(u3r2(X0),u3r1(X0)) ) ).
cnf(clause_44,axiom,
( c(u6r2(X0))
| f(X0)
| r(X0,u6r4(X0)) ) ).
cnf(u88,axiom,
( s(u6r1(X0),u1r1(u6r1(X0)))
| f(X0)
| r(X0,u6r4(X0)) ) ).
cnf(u160,axiom,
( s(X0,u1r2(X0))
| d(X0)
| equalish(u3r1(X0),u3r1(X0)) ) ).
cnf(clause_51,axiom,
( d(u6r3(X0))
| r(X0,u6r2(X0))
| f(X0) ) ).
cnf(u396,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u442,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u445,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_14,axiom,
( s1most(X0)
| s(X0,u3r2(X0)) ) ).
cnf(clause_1,negated_conjecture,
e(exist) ).
cnf(clause_29,axiom,
( ~ r(X2,X1)
| ~ f(X2)
| ~ r(X2,X0)
| equalish(X0,X1)
| ~ c(X0)
| ~ c(X1) ) ).
cnf(clause_32,axiom,
( ~ equalish(u6r2(X0),u6r1(X0))
| d(u6r4(X0))
| f(X0) ) ).
cnf(u55,negated_conjecture,
r2most(exist) ).
cnf(u441,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u159,axiom,
( d(X0)
| equalish(u3r2(X0),u3r1(X0))
| c(X0) ) ).
cnf(u294,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r2(u6r1(X0))) ) ).
cnf(u162,axiom,
( d(X0)
| equalish(u3r1(X0),u3r1(X0))
| c(X0) ) ).
cnf(u341,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r2(u6r1(X0))) ) ).
cnf(clause_5,axiom,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ s2least(X0) ) ).
cnf(u177,axiom,
( s(X0,u1r2(X0))
| d(X0)
| equalish(u3r2(X0),u3r2(X0)) ) ).
cnf(u77,axiom,
( s2least(u6r1(X0))
| r(X0,u6r4(X0))
| f(X0) ) ).
cnf(u367,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r1(u6r1(X0))) ) ).
cnf(u249,axiom,
( ~ s(u6r2(X0),X1)
| r(X0,u6r3(X0))
| ~ s1most(u6r2(X0))
| f(X0)
| equalish(X1,u1r2(u6r2(X0))) ) ).
cnf(clause_8,axiom,
( ~ s(X0,X2)
| equalish(X1,X2)
| ~ s(X0,X1)
| s2least(X0) ) ).
cnf(clause_36,axiom,
( d(u6r3(X0))
| c(u6r1(X0))
| f(X0) ) ).
cnf(u68,axiom,
( s1most(u6r3(X0))
| f(X0)
| c(u6r1(X0)) ) ).
cnf(u80,axiom,
( s1most(u6r3(X0))
| f(X0)
| r(X0,u6r1(X0)) ) ).
cnf(u370,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u444,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_31,axiom,
( ~ equalish(u6r2(X0),u6r1(X0))
| d(u6r3(X0))
| f(X0) ) ).
cnf(clause_43,axiom,
( c(u6r2(X0))
| f(X0)
| r(X0,u6r3(X0)) ) ).
cnf(u439,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r2(u6r2(X0))) ) ).
cnf(clause_34,axiom,
( ~ equalish(u6r2(X0),u6r1(X0))
| r(X0,u6r4(X0))
| f(X0) ) ).
cnf(u62,negated_conjecture,
s(u4r1(exist),u1r1(u4r1(exist))) ).
cnf(u1038,negated_conjecture,
s(u6r2(exist),u3r1(u6r2(exist))) ).
cnf(u181,axiom,
( s(X0,u1r1(X0))
| d(X0)
| equalish(u3r1(X0),u3r2(X0)) ) ).
cnf(u461,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r1(u6r2(X0))) ) ).
cnf(u253,axiom,
( ~ s(u6r2(X0),X1)
| r(X0,u6r3(X0))
| ~ s1most(u6r2(X0))
| f(X0)
| equalish(X1,u1r1(u6r2(X0))) ) ).
cnf(u466,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_12,axiom,
( ~ equalish(u3r2(X0),u3r1(X0))
| s1most(X0) ) ).
cnf(u316,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r1(u6r1(X0))) ) ).
cnf(u84,axiom,
( s(u6r1(X0),u1r2(u6r1(X0)))
| f(X0)
| r(X0,u6r3(X0)) ) ).
cnf(u420,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(clause_19,axiom,
( ~ e(X0)
| r2most(X0) ) ).
cnf(u79,axiom,
( s2least(u6r2(X0))
| r(X0,u6r4(X0))
| f(X0) ) ).
cnf(u91,axiom,
( s(u6r2(X0),u1r1(u6r2(X0)))
| f(X0)
| r(X0,u6r3(X0)) ) ).
cnf(clause_38,axiom,
( c(u6r1(X0))
| f(X0)
| r(X0,u6r3(X0)) ) ).
cnf(u82,axiom,
( s1most(u6r3(X0))
| f(X0)
| r(X0,u6r2(X0)) ) ).
cnf(u261,axiom,
( ~ s(u6r2(X0),X1)
| r(X0,u6r4(X0))
| ~ s1most(u6r2(X0))
| f(X0)
| equalish(X1,u1r1(u6r2(X0))) ) ).
cnf(clause_53,axiom,
( f(X0)
| r(X0,u6r2(X0))
| r(X0,u6r3(X0)) ) ).
cnf(u390,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r2(u6r2(X0))) ) ).
cnf(u125,axiom,
( ~ s(X1,X0)
| equalish(X0,u3r1(X1))
| s2least(X1)
| d(X1) ) ).
cnf(clause_26,axiom,
( r2most(X0)
| r(X0,u5r2(X0)) ) ).
cnf(u56,negated_conjecture,
d(u4r2(exist)) ).
cnf(u292,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r2(u6r1(X0))) ) ).
cnf(u1111,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_23,axiom,
( ~ equalish(u5r3(X0),u5r1(X0))
| r2most(X0) ) ).
cnf(u67,negated_conjecture,
r(exist,u4r1(exist)) ).
cnf(u463,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r1(u6r2(X0))) ) ).
cnf(u475,negated_conjecture,
( ~ r(exist,X1)
| equalish(X1,u4r1(exist))
| ~ r(exist,X0)
| equalish(X0,u4r1(exist))
| equalish(X0,X1) ) ).
cnf(u318,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r1(u6r1(X0))) ) ).
cnf(u158,axiom,
( s(X0,u1r1(X0))
| d(X0)
| equalish(u3r2(X0),u3r1(X0)) ) ).
cnf(clause_41,axiom,
( d(u6r3(X0))
| c(u6r2(X0))
| f(X0) ) ).
cnf(u437,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r2(u6r2(X0))) ) ).
cnf(u321,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u60,negated_conjecture,
s2least(u4r1(exist)) ).
cnf(clause_4,axiom,
( ~ s2least(X0)
| c(X0) ) ).
cnf(u164,axiom,
( s1most(X0)
| c(X0) ) ).
cnf(u176,axiom,
( s2least(X0)
| equalish(u3r1(X0),u3r2(X0))
| d(X0) ) ).
cnf(u412,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r1(u6r2(X0))) ) ).
cnf(clause_11,axiom,
( ~ s(X2,X1)
| ~ s1most(X2)
| ~ s(X2,X0)
| equalish(X0,X1) ) ).
cnf(u71,axiom,
( s1most(u6r4(X0))
| f(X0)
| c(u6r2(X0)) ) ).
cnf(clause_2,negated_conjecture,
~ f(exist) ).
cnf(clause_30,axiom,
( ~ equalish(u6r4(X0),u6r3(X0))
| ~ equalish(u6r2(X0),u6r1(X0))
| f(X0) ) ).
cnf(u372,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_17,axiom,
( ~ e(X0)
| c(u4r1(X0)) ) ).
cnf(clause_45,axiom,
( ~ equalish(u6r4(X0),u6r3(X0))
| r(X0,u6r1(X0))
| f(X0) ) ).
cnf(clause_48,axiom,
( f(X0)
| r(X0,u6r1(X0))
| r(X0,u6r3(X0)) ) ).
cnf(u948,negated_conjecture,
s(u6r1(exist),u3r2(u6r1(exist))) ).
cnf(u388,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r2(u6r2(X0))) ) ).
cnf(u175,axiom,
( s2least(X0)
| equalish(u3r2(X0),u3r2(X0))
| d(X0) ) ).
cnf(u949,negated_conjecture,
s(u6r1(exist),u3r1(u6r1(exist))) ).
cnf(clause_6,axiom,
( ~ s2least(X0)
| s(X0,u1r1(X0)) ) ).
cnf(u178,axiom,
( s(X0,u1r1(X0))
| d(X0)
| equalish(u3r2(X0),u3r2(X0)) ) ).
cnf(u78,axiom,
( s2least(u6r2(X0))
| r(X0,u6r3(X0))
| f(X0) ) ).
cnf(u297,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u418,axiom,
( s(u6r2(X0),u3r1(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u414,axiom,
( ~ s1most(u6r2(X0))
| r(X0,u6r3(X0))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r1(u6r2(X0))) ) ).
cnf(clause_21,axiom,
( ~ r(X3,X2)
| equalish(X0,X2)
| equalish(X1,X2)
| ~ r2most(X3)
| ~ r(X3,X0)
| ~ r(X3,X1)
| equalish(X0,X1) ) ).
cnf(clause_33,axiom,
( ~ equalish(u6r2(X0),u6r1(X0))
| r(X0,u6r3(X0))
| f(X0) ) ).
cnf(u65,axiom,
( s(X0,u3r2(X0))
| d(X0) ) ).
cnf(u93,axiom,
( s(u6r2(X0),u1r2(u6r2(X0)))
| f(X0)
| r(X0,u6r4(X0)) ) ).
cnf(clause_24,axiom,
( ~ equalish(u5r3(X0),u5r2(X0))
| r2most(X0) ) ).
cnf(clause_52,axiom,
( d(u6r4(X0))
| r(X0,u6r2(X0))
| f(X0) ) ).
cnf(u156,axiom,
( s2least(X0)
| equalish(u3r1(X0),u3r1(X0))
| d(X0) ) ).
cnf(clause_47,axiom,
( d(u6r4(X0))
| r(X0,u6r1(X0))
| f(X0) ) ).
cnf(u59,negated_conjecture,
c(u4r1(exist)) ).
cnf(clause_50,axiom,
( ~ equalish(u6r4(X0),u6r3(X0))
| r(X0,u6r2(X0))
| f(X0) ) ).
cnf(u911,negated_conjecture,
( ~ r(exist,X1)
| equalish(X1,u6r2(exist))
| ~ r(exist,X0)
| equalish(X0,u6r2(exist))
| equalish(X0,X1) ) ).
cnf(u298,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u301,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u393,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r2(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u345,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_9,axiom,
( ~ d(X0)
| s1most(X0) ) ).
cnf(u69,axiom,
( s1most(u6r4(X0))
| f(X0)
| c(u6r1(X0)) ) ).
cnf(u241,axiom,
( ~ s(u6r1(X0),X1)
| r(X0,u6r4(X0))
| ~ s1most(u6r1(X0))
| f(X0)
| equalish(X1,u1r2(u6r1(X0))) ) ).
cnf(clause_28,axiom,
( ~ r(X2,X1)
| ~ f(X2)
| ~ r(X2,X0)
| equalish(X0,X1)
| ~ d(X0)
| ~ d(X1) ) ).
cnf(u365,axiom,
( ~ s1most(u6r1(X0))
| r(X0,u6r4(X0))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r1(u6r1(X0))) ) ).
cnf(u144,negated_conjecture,
s(u4r1(exist),u3r1(u4r1(exist))) ).
cnf(clause_35,axiom,
( ~ equalish(u6r4(X0),u6r3(X0))
| c(u6r1(X0))
| f(X0) ) ).
cnf(u1110,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r2(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_54,axiom,
( f(X0)
| r(X0,u6r2(X0))
| r(X0,u6r4(X0)) ) ).
cnf(u126,axiom,
( ~ s(X1,X0)
| equalish(X0,u3r2(X1))
| s2least(X1)
| d(X1) ) ).
cnf(u346,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u1021,negated_conjecture,
s(u6r2(exist),u1r2(u6r2(exist))) ).
cnf(u905,negated_conjecture,
( ~ r(exist,X1)
| equalish(X1,u6r1(exist))
| ~ r(exist,X0)
| equalish(X0,u6r1(exist))
| equalish(X0,X1) ) ).
cnf(u349,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(clause_13,axiom,
( s1most(X0)
| s(X0,u3r1(X0)) ) ).
cnf(u245,axiom,
( ~ s(u6r1(X0),X1)
| r(X0,u6r4(X0))
| ~ s1most(u6r1(X0))
| f(X0)
| equalish(X1,u1r1(u6r1(X0))) ) ).
cnf(clause_16,axiom,
( ~ e(X0)
| r(X0,u4r2(X0)) ) ).
cnf(u76,axiom,
( s2least(u6r1(X0))
| r(X0,u6r3(X0))
| f(X0) ) ).
cnf(clause_39,axiom,
( c(u6r1(X0))
| f(X0)
| r(X0,u6r4(X0)) ) ).
cnf(u83,axiom,
( s1most(u6r4(X0))
| f(X0)
| r(X0,u6r2(X0)) ) ).
cnf(u143,negated_conjecture,
s(u4r1(exist),u3r2(u4r1(exist))) ).
cnf(u155,axiom,
( s2least(X0)
| equalish(u3r2(X0),u3r1(X0))
| d(X0) ) ).
cnf(clause_42,axiom,
( d(u6r4(X0))
| c(u6r2(X0))
| f(X0) ) ).
cnf(u950,negated_conjecture,
s(u6r1(exist),u1r2(u6r1(exist))) ).
cnf(u324,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u1022,negated_conjecture,
s(u6r2(exist),u1r1(u6r2(exist))) ).
cnf(u322,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u57,negated_conjecture,
s1most(u4r2(exist)) ).
cnf(u325,axiom,
( s(u6r1(X0),u3r1(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(u161,axiom,
( s(X0,u1r1(X0))
| d(X0)
| equalish(u3r1(X0),u3r1(X0)) ) ).
cnf(u233,axiom,
( ~ s(u6r1(X0),X1)
| r(X0,u6r3(X0))
| ~ s1most(u6r1(X0))
| f(X0)
| equalish(X1,u1r2(u6r1(X0))) ) ).
cnf(clause_20,axiom,
( ~ r(X0,X2)
| ~ r2most(X0)
| ~ r(X0,X1)
| ~ c(X1)
| e(X0)
| ~ d(X2) ) ).
cnf(u465,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u180,axiom,
( s(X0,u1r2(X0))
| d(X0)
| equalish(u3r1(X0),u3r2(X0)) ) ).
cnf(u64,axiom,
( s(X0,u3r1(X0))
| d(X0) ) ).
cnf(u417,axiom,
( s(u6r2(X0),u3r2(u6r2(X0)))
| f(X0)
| equalish(u1r1(u6r2(X0)),u1r1(u6r2(X0)))
| r(X0,u6r3(X0)) ) ).
cnf(clause_15,axiom,
( ~ e(X0)
| d(u4r2(X0)) ) ).
cnf(clause_27,axiom,
( r2most(X0)
| r(X0,u5r3(X0)) ) ).
cnf(u369,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r1(u6r1(X0)),u1r1(u6r1(X0)))
| r(X0,u6r4(X0)) ) ).
cnf(u87,axiom,
( s(u6r1(X0),u1r2(u6r1(X0)))
| f(X0)
| r(X0,u6r4(X0)) ) ).
cnf(clause_18,axiom,
( ~ e(X0)
| r(X0,u4r1(X0)) ) ).
cnf(clause_46,axiom,
( d(u6r3(X0))
| r(X0,u6r1(X0))
| f(X0) ) ).
cnf(u90,axiom,
( s(u6r2(X0),u1r2(u6r2(X0)))
| f(X0)
| r(X0,u6r3(X0)) ) ).
cnf(clause_37,axiom,
( d(u6r4(X0))
| c(u6r1(X0))
| f(X0) ) ).
cnf(u165,axiom,
( d(X0)
| c(X0) ) ).
cnf(u237,axiom,
( ~ s(u6r1(X0),X1)
| r(X0,u6r3(X0))
| ~ s1most(u6r1(X0))
| f(X0)
| equalish(X1,u1r1(u6r1(X0))) ) ).
cnf(u300,axiom,
( s(u6r1(X0),u3r2(u6r1(X0)))
| f(X0)
| equalish(u1r2(u6r1(X0)),u1r2(u6r1(X0)))
| r(X0,u6r3(X0)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS008-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 13:18:23 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.97/1.56 % (2345230)Input is clausal, will run a generic CNF schedule.
% 3.97/1.56 % (2345238)lrs+10_1_sil=8000:sp=occurrence:random_seed=3133299988:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.97/1.56 % (2345238)Instruction limit reached!
% 3.97/1.56 % (2345238)------------------------------
% 3.97/1.56 % (2345238)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345238)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345238)Termination reason: Instruction limit
% 3.97/1.56 % (2345238)Termination phase: Saturation
% 3.97/1.56 % (2345238)Time elapsed: 0.030 s
% 3.97/1.56 % (2345238)Peak memory usage: 87 MB
% 3.97/1.56 % (2345238)Instructions burned: 111 (million)
% 3.97/1.56 % (2345239)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2907072849:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.97/1.56 % (2345236)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3544524353:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.97/1.56 % (2345241)dis-21_1_sil=8000:lcm=predicate:random_seed=3389670603:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.97/1.56 % (2345237)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1051763846:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.97/1.56 % (2345235)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2658737145:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.97/1.56 % (2345240)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=179676594:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.97/1.56 % (2345240)Refutation not found, incomplete strategy
% 3.97/1.56 % (2345240)------------------------------
% 3.97/1.56 % (2345240)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345240)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345240)Termination reason: Refutation not found, incomplete strategy
% 3.97/1.56 % (2345240)Time elapsed: 0.006 s
% 3.97/1.56 % (2345240)Peak memory usage: 88 MB
% 3.97/1.56 % (2345240)Instructions burned: 8 (million)
% 3.97/1.56 % (2345239)Refutation not found, incomplete strategy
% 3.97/1.56 % (2345239)------------------------------
% 3.97/1.56 % (2345239)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345239)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345239)Termination reason: Refutation not found, incomplete strategy
% 3.97/1.56 % (2345239)Time elapsed: 0.019 s
% 3.97/1.56 % (2345239)Peak memory usage: 87 MB
% 3.97/1.56 % (2345239)Instructions burned: 34 (million)
% 3.97/1.56 % (2345241)Instruction limit reached!
% 3.97/1.56 % (2345241)------------------------------
% 3.97/1.56 % (2345241)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345241)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345241)Termination reason: Instruction limit
% 3.97/1.56 % (2345241)Termination phase: Saturation
% 3.97/1.56 % (2345241)Time elapsed: 0.068 s
% 3.97/1.56 % (2345241)Peak memory usage: 90 MB
% 3.97/1.56 % (2345241)Instructions burned: 118 (million)
% 3.97/1.56 % (2345243)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1089676105:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.97/1.56 % (2345243)Refutation not found, incomplete strategy
% 3.97/1.56 % (2345243)------------------------------
% 3.97/1.56 % (2345243)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345243)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345243)Termination reason: Refutation not found, incomplete strategy
% 3.97/1.56 % (2345243)Time elapsed: 0.001 s
% 3.97/1.56 % (2345243)Peak memory usage: 88 MB
% 3.97/1.56 % (2345243)Instructions burned: 1 (million)
% 3.97/1.56 % (2345250)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2837154703:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 3.97/1.56 % (2345250)Refutation not found, incomplete strategy
% 3.97/1.56 % (2345250)------------------------------
% 3.97/1.56 % (2345250)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345250)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345250)Termination reason: Refutation not found, incomplete strategy
% 3.97/1.56 % (2345250)Time elapsed: 0.003 s
% 3.97/1.56 % (2345250)Peak memory usage: 87 MB
% 3.97/1.56 % (2345250)Instructions burned: 4 (million)
% 3.97/1.56 % (2345240)------------------------------
% 3.97/1.56 % (2345240)------------------------------
% 3.97/1.56 % (2345243)------------------------------
% 3.97/1.56 % (2345243)------------------------------
% 3.97/1.56 % (2345239)------------------------------
% 3.97/1.56 % (2345239)------------------------------
% 3.97/1.56 % (2345254)lrs+10_64_to=lpo:sil=8000:random_seed=4161616187:i=126:bd=preordered_2995 on theBenchmark for (2995ds/126Mi)
% 3.97/1.56 % (2345254)First to succeed.
% 3.97/1.56 % (2345254)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2345230"
% 3.97/1.56 % (2345253)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2841334990:st=4:i=219:sd=3:ss=axioms_2995 on theBenchmark for (2995ds/219Mi)
% 3.97/1.56 % (2345253)Refutation not found, incomplete strategy
% 3.97/1.56 % (2345253)------------------------------
% 3.97/1.56 % (2345253)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345253)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345253)Termination reason: Refutation not found, incomplete strategy
% 3.97/1.56 % (2345253)Time elapsed: 0.002 s
% 3.97/1.56 % (2345253)Peak memory usage: 87 MB
% 3.97/1.56 % (2345253)Instructions burned: 1 (million)
% 3.97/1.56 % (2345255)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2030131612:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 3.97/1.56 % (2345255)Refutation not found, incomplete strategy
% 3.97/1.56 % (2345255)------------------------------
% 3.97/1.56 % (2345255)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.97/1.56 % (2345255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.97/1.56 % (2345255)CaDiCaL version: 2.1.3
% 3.97/1.56 % (2345255)Termination reason: Refutation not found, incomplete strategy
% 3.97/1.56 % (2345255)Time elapsed: 0.005 s
% 3.97/1.56 % (2345255)Peak memory usage: 88 MB
% 3.97/1.56 % (2345255)Instructions burned: 7 (million)
% 3.97/1.56 % (2345250)------------------------------
% 3.97/1.56 % (2345250)------------------------------
% 3.97/1.56 % SZS status Satisfiable for theBenchmark
% 3.97/1.56 % SZS output start Saturation.
% See solution above
% 5.63/1.75 % SZS output start Definitions and Model Updates.
% 5.63/1.75 % SZS output end Definitions and Model Updates.
% 5.63/1.75 % (2345254)------------------------------
% 5.63/1.75 % (2345254)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.63/1.75 % (2345254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.63/1.75 % (2345254)CaDiCaL version: 2.1.3
% 5.63/1.75 % (2345254)Termination reason: Satisfiable
% 5.63/1.75 % (2345254)Time elapsed: 0.010 s
% 5.63/1.75 % (2345254)Peak memory usage: 88 MB
% 5.63/1.75 % (2345254)Instructions burned: 34 (million)
% 5.63/1.75 % (2345254)------------------------------
% 5.63/1.75 % (2345254)------------------------------
% 5.63/1.75 % (2345230)Success in time 0.714 s
% 5.63/1.75 % Vampire exiting
%------------------------------------------------------------------------------