%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n008.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:42:04 AM UTC 2026
% Result : Satisfiable 0.11s 0.46s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u73,axiom,
r2most(X0) ).
cnf(u93,axiom,
d(u4r2(X0)) ).
cnf(u141,axiom,
r(X0,u6r1(X0)) ).
cnf(u144,axiom,
d(u6r3(X0)) ).
cnf(u151,axiom,
r(X0,u6r2(X0)) ).
cnf(u154,axiom,
d(u6r4(X0)) ).
cnf(u190,axiom,
c(u4r1(X0)) ).
cnf(u206,axiom,
c(u6r1(X0)) ).
cnf(u209,axiom,
r(X0,u6r3(X0)) ).
cnf(u214,axiom,
c(u6r2(X0)) ).
cnf(u217,axiom,
r(X0,u6r4(X0)) ).
cnf(u235,axiom,
equalish(X1,u1r2(X0)) ).
cnf(u245,axiom,
equalish(X0,u3r2(X1)) ).
cnf(u297,axiom,
~ equalish(u6r2(X0),u6r1(X0)) ).
cnf(u307,axiom,
e(X0) ).
cnf(u362,axiom,
~ f(X2) ).
cnf(u410,axiom,
equalish(X0,u6r2(X1)) ).
cnf(u454,axiom,
equalish(X0,u6r4(X1)) ).
cnf(u477,axiom,
equalish(X0,u6r3(X1)) ).
cnf(u507,axiom,
equalish(X1,u4r2(X0)) ).
cnf(u510,axiom,
equalish(u6r1(X0),u6r1(X0)) ).
cnf(u515,axiom,
equalish(u4r1(X0),u6r1(X0)) ).
cnf(u518,axiom,
equalish(X1,u4r1(X0)) ).
cnf(clause_9,axiom,
( ~ d(X0)
| s1most(X0) ) ).
cnf(clause_19,axiom,
( ~ e(X0)
| r2most(X0) ) ).
cnf(u391,axiom,
( ~ r(X3,X2)
| equalish(X0,X2)
| equalish(X1,X2)
| ~ r(X3,X0)
| ~ r(X3,X1)
| equalish(X0,X1) ) ).
cnf(u396,axiom,
( ~ r(X1,X2)
| equalish(X2,u6r1(X1))
| ~ r(X1,X0)
| equalish(X0,u6r1(X1))
| equalish(X0,X2) ) ).
cnf(u274,axiom,
( ~ s1most(X0)
| ~ s2least(X0) ) ).
cnf(u292,axiom,
( s1most(X0)
| c(X0) ) ).
cnf(clause_12,axiom,
( ~ equalish(u3r2(X0),u3r1(X0))
| s1most(X0) ) ).
cnf(u287,axiom,
( s2least(X0)
| d(X0) ) ).
cnf(u499,axiom,
( ~ equalish(u6r2(X0),u6r1(X0))
| f(X0) ) ).
cnf(u192,axiom,
s2least(u4r1(X0)) ).
cnf(clause_30,axiom,
( ~ equalish(u6r4(X0),u6r3(X0))
| ~ equalish(u6r2(X0),u6r1(X0))
| f(X0) ) ).
cnf(u147,axiom,
s1most(u6r3(X0)) ).
cnf(clause_3,axiom,
( ~ c(X0)
| s2least(X0) ) ).
cnf(u275,axiom,
~ s2least(u4r2(X0)) ).
cnf(u155,axiom,
s1most(u6r4(X0)) ).
cnf(u398,axiom,
( ~ r(X1,X2)
| equalish(X2,u6r4(X1))
| ~ r(X1,X0)
| equalish(X0,u6r4(X1))
| equalish(X0,X2) ) ).
cnf(u240,axiom,
( equalish(X0,u3r2(X1))
| ~ s(X1,X0)
| s2least(X1)
| s1most(X1) ) ).
cnf(clause_18,axiom,
( r(X0,u4r1(X0))
| ~ e(X0) ) ).
cnf(clause_11,axiom,
( ~ s(X2,X1)
| ~ s1most(X2)
| ~ s(X2,X0)
| equalish(X0,X1) ) ).
cnf(u276,axiom,
~ s2least(u6r4(X0)) ).
cnf(clause_6,axiom,
( s(X0,u1r1(X0))
| ~ s2least(X0) ) ).
cnf(u241,axiom,
( equalish(X0,u3r1(X1))
| ~ s(X1,X0)
| s2least(X1)
| s1most(X1) ) ).
cnf(clause_8,axiom,
( ~ s(X0,X2)
| equalish(X1,X2)
| ~ s(X0,X1)
| s2least(X0) ) ).
cnf(u97,axiom,
s1most(u4r2(X0)) ).
cnf(u283,axiom,
( s1most(X0)
| s2least(X0) ) ).
cnf(clause_4,axiom,
( ~ s2least(X0)
| c(X0) ) ).
cnf(clause_49,axiom,
( r(X0,u6r4(X0))
| r(X0,u6r1(X0))
| f(X0) ) ).
cnf(clause_14,axiom,
( s(X0,u3r2(X0))
| s1most(X0) ) ).
cnf(clause_16,axiom,
( r(X0,u4r2(X0))
| ~ e(X0) ) ).
cnf(clause_44,axiom,
( r(X0,u6r4(X0))
| c(u6r2(X0))
| f(X0) ) ).
cnf(clause_5,axiom,
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ s2least(X0) ) ).
cnf(clause_54,axiom,
( r(X0,u6r4(X0))
| r(X0,u6r2(X0))
| f(X0) ) ).
cnf(clause_15,axiom,
( d(u4r2(X0))
| ~ e(X0) ) ).
cnf(u448,axiom,
( equalish(u4r1(X0),u6r1(X0))
| equalish(X1,u4r1(X0))
| equalish(X1,u6r1(X0))
| ~ r(X0,X1) ) ).
cnf(clause_17,axiom,
( c(u4r1(X0))
| ~ e(X0) ) ).
cnf(u375,axiom,
( equalish(X1,u4r2(X0))
| ~ r(X0,X1)
| ~ f(X0)
| ~ d(X1) ) ).
cnf(u304,axiom,
( ~ r(X0,X2)
| ~ r(X0,X1)
| ~ c(X1)
| e(X0)
| ~ d(X2) ) ).
cnf(u277,axiom,
~ s2least(u6r3(X0)) ).
cnf(clause_52,axiom,
( r(X0,u6r2(X0))
| f(X0)
| d(u6r4(X0)) ) ).
cnf(clause_13,axiom,
( s(X0,u3r1(X0))
| s1most(X0) ) ).
cnf(clause_53,axiom,
( r(X0,u6r3(X0))
| r(X0,u6r2(X0))
| f(X0) ) ).
cnf(clause_2,negated_conjecture,
~ f(exist) ).
cnf(u394,axiom,
( ~ r(X1,X2)
| equalish(X2,u6r2(X1))
| ~ r(X1,X0)
| equalish(X0,u6r2(X1))
| equalish(X0,X2) ) ).
cnf(u402,axiom,
( ~ r(X1,X2)
| equalish(X2,u6r3(X1))
| ~ r(X1,X0)
| equalish(X0,u6r3(X1))
| equalish(X0,X2) ) ).
cnf(u77,negated_conjecture,
r2most(exist) ).
cnf(clause_10,axiom,
( ~ s1most(X0)
| d(X0) ) ).
cnf(u447,axiom,
( equalish(u6r1(X0),u6r1(X0))
| equalish(X1,u6r1(X0))
| ~ r(X0,X1) ) ).
cnf(u210,axiom,
s2least(u6r1(X0)) ).
cnf(clause_28,axiom,
( ~ r(X2,X1)
| ~ f(X2)
| ~ r(X2,X0)
| equalish(X0,X1)
| ~ d(X0)
| ~ d(X1) ) ).
cnf(clause_38,axiom,
( r(X0,u6r3(X0))
| c(u6r1(X0))
| f(X0) ) ).
cnf(clause_1,negated_conjecture,
e(exist) ).
cnf(u288,axiom,
( d(X0)
| c(X0) ) ).
cnf(u218,axiom,
s2least(u6r2(X0)) ).
cnf(clause_46,axiom,
( r(X0,u6r1(X0))
| f(X0)
| d(u6r3(X0)) ) ).
cnf(u197,axiom,
( equalish(X1,u1r1(X0))
| ~ s1most(X0)
| ~ s(X0,X1)
| ~ s2least(X0) ) ).
cnf(clause_7,axiom,
( s(X0,u1r2(X0))
| ~ s2least(X0) ) ).
cnf(clause_48,axiom,
( r(X0,u6r3(X0))
| r(X0,u6r1(X0))
| f(X0) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS008-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 13:16:40 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.46 % (1218319)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (1218326)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3476202071:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46 % (1218325)% WARNING: option uhcvi not known.
% 0.11/0.46 % (1218326) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1218319-1218326"...
% 0.11/0.46 % (1218326)...printing done.
% 0.11/0.46 % (1218324)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1487343157_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46 % SZS status Satisfiable for theBenchmark
% 0.11/0.46 % SZS output start Saturation.
% See solution above
% 0.11/0.46 % SZS output start Definitions and Model Updates.
% 0.11/0.46 % SZS output end Definitions and Model Updates.
% 0.11/0.46 % (1218326)------------------------------
% 0.11/0.46 % (1218326)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (1218326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (1218326)CaDiCaL version: 2.1.3
% 0.11/0.46 % (1218326)Termination reason: Satisfiable
% 0.11/0.46 % (1218326)Time elapsed: 0.006 s
% 0.11/0.46 % (1218326)Peak memory usage: 11 MB
% 0.11/0.46 % (1218326)Instructions burned: 14 (million)
% 0.11/0.46 % (1218319)Success in time 0.034 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------