%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS006-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 : n004.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.44s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u83,negated_conjecture,
~ d(u4r1(exist)) ).
cnf(u92,negated_conjecture,
~ s2least(u4r1(exist)) ).
cnf(u108,negated_conjecture,
~ s1most(u4r1(exist)) ).
cnf(clause_3,negated_conjecture,
r(exist,u4r1(exist)) ).
cnf(u40,axiom,
( r1most(X0)
| e(X0) ) ).
cnf(clause_13,axiom,
( ~ s1most(X0)
| d(X0) ) ).
cnf(u143,axiom,
( e(X0)
| ~ s(u4r1(X0),X1)
| ~ s1most(u4r1(X0))
| equalish(u1r1(u4r1(X0)),X1) ) ).
cnf(u34,axiom,
( s(X0,u1r2(X0))
| s2least(X0) ) ).
cnf(u44,axiom,
( s(X0,u3r1(X0))
| d(X0) ) ).
cnf(u46,axiom,
( s2least(X0)
| ~ s1most(X0)
| equalish(X1,u1r2(X0))
| ~ s(X0,X1) ) ).
cnf(u137,axiom,
( e(X1)
| ~ s(u4r1(X1),X0)
| ~ s1most(u4r1(X1))
| equalish(X0,u1r2(u4r1(X1))) ) ).
cnf(u38,axiom,
( ~ c(u4r1(X0))
| e(X0) ) ).
cnf(u123,negated_conjecture,
s(u4r1(exist),u3r1(u4r1(exist))) ).
cnf(u32,axiom,
( ~ equalish(u1r2(X0),u1r1(X0))
| s2least(X0) ) ).
cnf(u70,axiom,
( c(X0)
| equalish(u1r1(X0),X1)
| ~ s(X0,X1)
| ~ s1most(X0) ) ).
cnf(clause_24,axiom,
( equalish(X0,X1)
| ~ r1most(X2)
| ~ r(X2,X0)
| ~ r(X2,X1) ) ).
cnf(u65,axiom,
( d(X0)
| equalish(u3r1(X0),X1)
| ~ s2least(X0)
| ~ s(X0,X1) ) ).
cnf(clause_26,axiom,
( r(X0,u5r1(X0))
| r1most(X0) ) ).
cnf(u41,axiom,
( c(X1)
| ~ r1most(X0)
| ~ r(X0,X1)
| ~ e(X0)
| ~ r(X0,X2)
| ~ d(X2) ) ).
cnf(u36,axiom,
( d(u4r2(X0))
| e(X0) ) ).
cnf(u68,axiom,
( c(X0)
| equalish(X1,u1r1(X0))
| ~ s(X0,X1)
| ~ s1most(X0) ) ).
cnf(u28,negated_conjecture,
~ e(exist) ).
cnf(u145,negated_conjecture,
( ~ r(X0,u3r1(u4r1(exist)))
| ~ r(X0,u3r2(u4r1(exist)))
| ~ r1most(X0) ) ).
cnf(u30,axiom,
( ~ s2least(X0)
| c(X0) ) ).
cnf(u147,negated_conjecture,
( ~ r(X0,u1r1(u4r1(exist)))
| ~ r(X0,u1r2(u4r1(exist)))
| ~ r1most(X0) ) ).
cnf(clause_16,axiom,
( s1most(X0)
| s(X0,u3r1(X0)) ) ).
cnf(u29,negated_conjecture,
~ c(u4r1(exist)) ).
cnf(u51,axiom,
( s2least(X0)
| ~ s1most(X0)
| equalish(u1r1(X0),X1)
| ~ s(X0,X1) ) ).
cnf(clause_2,negated_conjecture,
r1most(exist) ).
cnf(u61,axiom,
( d(X0)
| equalish(X1,u3r1(X0))
| ~ s2least(X0)
| ~ s(X0,X1) ) ).
cnf(clause_12,axiom,
( s1most(X0)
| ~ d(X0) ) ).
cnf(u139,axiom,
( e(X1)
| ~ s(u4r1(X1),X0)
| ~ s1most(u4r1(X1))
| equalish(X0,u1r1(u4r1(X1))) ) ).
cnf(clause_14,axiom,
( ~ s(X2,X1)
| ~ s(X2,X0)
| ~ s1most(X2)
| equalish(X0,X1) ) ).
cnf(u55,axiom,
( s1most(X1)
| ~ r(X0,u3r2(X1))
| ~ r(X0,u3r1(X1))
| ~ r1most(X0) ) ).
cnf(u141,axiom,
( e(X0)
| ~ s(u4r1(X0),X1)
| ~ s1most(u4r1(X0))
| equalish(u1r2(u4r1(X0)),X1) ) ).
cnf(u47,axiom,
( s2least(X0)
| ~ s1most(X0)
| equalish(X1,u1r1(X0))
| ~ s(X0,X1) ) ).
cnf(u72,axiom,
( e(X1)
| ~ r(X0,u4r1(X1))
| ~ e(X0)
| ~ r(X0,X2)
| ~ d(X2)
| ~ r1most(X0) ) ).
cnf(u67,axiom,
( c(X0)
| equalish(X1,u1r2(X0))
| ~ s(X0,X1)
| ~ s1most(X0) ) ).
cnf(u122,negated_conjecture,
s(u4r1(exist),u3r2(u4r1(exist))) ).
cnf(u35,axiom,
( ~ s(X0,X2)
| ~ s(X0,X1)
| equalish(X1,X2)
| ~ s2least(X0) ) ).
cnf(clause_4,negated_conjecture,
d(u4r2(exist)) ).
cnf(u45,axiom,
( s(X0,u3r2(X0))
| d(X0) ) ).
cnf(u150,axiom,
( e(X1)
| ~ r1most(X0)
| ~ r(X0,u1r2(u4r1(X1)))
| ~ r(X0,u1r1(u4r1(X1))) ) ).
cnf(u37,axiom,
( r(X0,u4r2(X0))
| e(X0) ) ).
cnf(u66,axiom,
( equalish(X1,X1)
| ~ s(X0,X1)
| ~ s2least(X0) ) ).
cnf(u39,axiom,
( r(X0,u4r1(X0))
| e(X0) ) ).
cnf(u33,axiom,
( s(X0,u1r1(X0))
| s2least(X0) ) ).
cnf(u31,axiom,
( s2least(X0)
| ~ c(X0) ) ).
cnf(clause_25,axiom,
( ~ equalish(u5r2(X0),u5r1(X0))
| r1most(X0) ) ).
cnf(u146,axiom,
( c(X1)
| ~ r(X0,u1r1(X1))
| ~ r1most(X0)
| ~ r(X0,u1r2(X1)) ) ).
cnf(clause_27,axiom,
( r(X0,u5r2(X0))
| r1most(X0) ) ).
cnf(clause_17,axiom,
( s1most(X0)
| s(X0,u3r2(X0)) ) ).
cnf(u64,axiom,
( d(X0)
| equalish(u3r2(X0),X1)
| ~ s2least(X0)
| ~ s(X0,X1) ) ).
cnf(u69,axiom,
( c(X0)
| equalish(u1r2(X0),X1)
| ~ s(X0,X1)
| ~ s1most(X0) ) ).
cnf(u56,axiom,
( r1most(X1)
| ~ r(X0,u5r2(X1))
| ~ r(X0,u5r1(X1))
| ~ r1most(X0) ) ).
cnf(u71,negated_conjecture,
( ~ r(X0,u4r1(exist))
| ~ r(X0,X1)
| ~ e(X0)
| ~ r1most(X0)
| ~ d(X1) ) ).
cnf(u144,axiom,
( d(X1)
| ~ r(X0,u3r1(X1))
| ~ r1most(X0)
| ~ r(X0,u3r2(X1)) ) ).
cnf(u50,axiom,
( s2least(X0)
| ~ s1most(X0)
| equalish(u1r2(X0),X1)
| ~ s(X0,X1) ) ).
cnf(u60,axiom,
( d(X0)
| equalish(X1,u3r2(X0))
| ~ s2least(X0)
| ~ s(X0,X1) ) ).
cnf(clause_15,axiom,
( ~ equalish(u3r2(X0),u3r1(X0))
| s1most(X0) ) ).
cnf(u57,axiom,
( s2least(X1)
| ~ r(X0,u1r2(X1))
| ~ r(X0,u1r1(X1))
| ~ r1most(X0) ) ).
cnf(u54,axiom,
( equalish(X1,X1)
| ~ s1most(X0)
| ~ s(X0,X1) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS006-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 : n004.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:07 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.41 Running first-order model finding
% 0.11/0.41 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.44 % (3519726)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (3519737)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=95578724:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.44 % (3519737) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3519726-3519737"...
% 0.11/0.44 % (3519737)...printing done.
% 0.11/0.44 % (3519732)% WARNING: option uhcvi not known.
% 0.11/0.44 % SZS status Satisfiable for theBenchmark
% 0.11/0.44 % SZS output start Saturation.
% See solution above
% 0.11/0.44 % SZS output start Definitions and Model Updates.
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "s2least"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "c"
% 0.11/0.44 globally flip the polarity of every occurrence of predicate "e"
% 0.11/0.44 % SZS output end Definitions and Model Updates.
% 0.11/0.44 % (3519737)------------------------------
% 0.11/0.44 % (3519737)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (3519737)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (3519737)CaDiCaL version: 2.1.3
% 0.11/0.44 % (3519737)Termination reason: Satisfiable
% 0.11/0.44 % (3519737)Time elapsed: 0.002 s
% 0.11/0.44 % (3519737)Peak memory usage: 11 MB
% 0.11/0.44 % (3519737)Instructions burned: 3 (million)
% 0.11/0.44 % (3519726)Success in time 0.018 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------