%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS015-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:05 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 23 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f2,axiom,
! [X0] :
( ~ c(X0)
| t2least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f4,axiom,
! [X0] :
( ~ t2least(X0)
| ~ equalish(u1r2(X0),u1r1(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f5,axiom,
! [X0] :
( ~ t2least(X0)
| t(X0,u1r1(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
fof(f6,axiom,
! [X0] :
( ~ t2least(X0)
| t(X0,u1r2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f8,axiom,
! [X0] :
( ~ d(X0)
| t1most(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
fof(f10,axiom,
! [X2,X0,X1] :
( ~ t1most(X2)
| equalish(X0,X1)
| ~ t(X2,X0)
| ~ t(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
fof(f14,axiom,
! [X0] :
( ~ e(X0)
| r(X0,u4r4(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
fof(f15,axiom,
! [X0,X1] :
( ~ e(X0)
| s(X0,X1)
| ~ r(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
fof(f17,axiom,
! [X0,X1] :
( ~ e(X1)
| d(X0)
| ~ s(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).
fof(f18,axiom,
! [X0,X1] :
( ~ e(X1)
| c(X0)
| ~ r(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
fof(f29,plain,
r(exist,u4r4(exist)),
inference(resolution,[],[f14,f1]) ).
fof(f32,plain,
! [X0] :
( ~ s(exist,X0)
| d(X0) ),
inference(resolution,[],[f17,f1]) ).
fof(f33,plain,
! [X0] :
( ~ r(exist,X0)
| c(X0) ),
inference(resolution,[],[f18,f1]) ).
fof(f34,plain,
c(u4r4(exist)),
inference(resolution,[],[f33,f29]) ).
fof(f35,plain,
! [X0] :
( ~ r(exist,X0)
| s(exist,X0) ),
inference(resolution,[],[f15,f1]) ).
fof(f36,plain,
t2least(u4r4(exist)),
inference(resolution,[],[f34,f2]) ).
fof(f38,plain,
~ equalish(u1r2(u4r4(exist)),u1r1(u4r4(exist))),
inference(resolution,[],[f36,f4]) ).
fof(f39,plain,
t(u4r4(exist),u1r2(u4r4(exist))),
inference(resolution,[],[f36,f6]) ).
fof(f40,plain,
t(u4r4(exist),u1r1(u4r4(exist))),
inference(resolution,[],[f36,f5]) ).
fof(f42,plain,
s(exist,u4r4(exist)),
inference(resolution,[],[f35,f29]) ).
fof(f45,plain,
d(u4r4(exist)),
inference(resolution,[],[f42,f32]) ).
fof(f48,plain,
t1most(u4r4(exist)),
inference(resolution,[],[f45,f8]) ).
fof(f51,plain,
! [X0,X1] :
( ~ t(u4r4(exist),X0)
| equalish(X0,X1)
| ~ t(u4r4(exist),X1) ),
inference(resolution,[],[f48,f10]) ).
fof(f62,plain,
! [X0] :
( ~ t(u4r4(exist),X0)
| equalish(u1r2(u4r4(exist)),X0) ),
inference(resolution,[],[f51,f39]) ).
fof(f65,plain,
equalish(u1r2(u4r4(exist)),u1r1(u4r4(exist))),
inference(resolution,[],[f62,f40]) ).
fof(f66,plain,
$false,
inference(forward_subsumption_resolution,[],[f65,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS015-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n016.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 13:21:02 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.45 % (2642449)Will run a generic schedule for satisfiability detection.
% 0.13/0.45 % (2642459)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=951707750:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.45 % (2642459) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2642449-2642459"...
% 0.13/0.45 % (2642459)...printing done.
% 0.13/0.45 % (2642459)Refutation found. Thanks to Tanya!
% 0.13/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.45 % (2642459)------------------------------
% 0.13/0.45 % (2642459)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.45 % (2642459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.45 % (2642459)CaDiCaL version: 2.1.3
% 0.13/0.45 % (2642459)Termination reason: Refutation
% 0.13/0.45 % (2642459)Time elapsed: 0.001 s
% 0.13/0.45 % (2642459)Peak memory usage: 11 MB
% 0.13/0.45 % (2642459)Instructions burned: 2 (million)
% 0.13/0.45 % (2642449)Success in time 0.025 s
% 0.13/0.45 % Vampire exiting
%------------------------------------------------------------------------------