%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KRS113+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:42:18 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 107 ( 8 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 106 ( 39 ~; 31 |; 22 &)
% ( 10 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 62 ( 52 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f19,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X1)
& rr(X0,X2) )
=> X1 = X2 )
& ? [X3] :
( rr(X0,X3)
& ca_Vx2(X3) )
& ? [X3] :
( rs(X0,X3)
& cp(X3) )
& cpxcomp(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f20,axiom,
! [X0] :
( cp(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f21,axiom,
! [X0] :
( cpxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f22,axiom,
! [X0] :
( ca_Vx2(X0)
<=> ! [X1] :
( rinvS(X0,X1)
=> cp(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f23,axiom,
! [X0,X1] :
( rinvS(X0,X1)
<=> rs(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).
fof(f24,axiom,
cUnsatisfiable(i2003_11_14_17_21_22376),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f25,axiom,
! [X0,X1] :
( rs(X0,X1)
=> rr(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f26,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X1)
& rr(X0,X2) )
=> X1 = X2 )
& ? [X3] :
( rr(X0,X3)
& ca_Vx2(X3) )
& ? [X4] :
( rs(X0,X4)
& cp(X4) )
& cpxcomp(X0) ) ),
inference(rectify,[],[f19]) ).
fof(f59,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ca_Vx2(X3) )
& ? [X4] :
( rs(X0,X4)
& cp(X4) )
& cpxcomp(X0) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f60,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X1)
| ~ rr(X0,X2) )
& ? [X3] :
( rr(X0,X3)
& ca_Vx2(X3) )
& ? [X4] :
( rs(X0,X4)
& cp(X4) )
& cpxcomp(X0) ) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0] :
( cp(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f20]) ).
fof(f62,plain,
! [X0] :
( ca_Vx2(X0)
<=> ! [X1] :
( cp(X1)
| ~ rinvS(X0,X1) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f63,plain,
! [X0,X1] :
( rr(X0,X1)
| ~ rs(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f84,plain,
! [X2,X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X1)
| X1 = X2
| ~ rr(X0,X2) ),
inference(cnf_transformation,[],[f60]) ).
fof(f88,plain,
! [X0] :
( ca_Vx2(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f89,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f91,plain,
! [X0] :
( rs(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f92,plain,
! [X0] :
( cpxcomp(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f94,plain,
! [X0,X1] :
( ~ ra_Px1(X0,X1)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f96,plain,
! [X0] :
( ra_Px1(X0,sK5(X0))
| ~ cpxcomp(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f97,plain,
! [X0,X1] :
( ~ rinvS(X0,X1)
| cp(X1)
| ~ ca_Vx2(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f100,plain,
! [X0,X1] :
( rinvS(X0,X1)
| ~ rs(X1,X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f102,plain,
cUnsatisfiable(i2003_11_14_17_21_22376),
inference(cnf_transformation,[],[f24]) ).
fof(f103,plain,
! [X0,X1] :
( ~ rs(X0,X1)
| rr(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f121,plain,
rr(i2003_11_14_17_21_22376,sK1(i2003_11_14_17_21_22376)),
inference(resolution,[],[f89,f102]) ).
fof(f125,plain,
! [X0] :
( ~ cpxcomp(X0)
| ~ cp(X0) ),
inference(resolution,[],[f96,f94]) ).
fof(f127,plain,
! [X0] :
( ~ cp(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f125,f92]) ).
fof(f131,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rr(X0,sK0(X0)) ),
inference(resolution,[],[f103,f91]) ).
fof(f133,plain,
! [X0,X1] :
( ~ ca_Vx2(X1)
| cp(X0)
| ~ rs(X0,X1) ),
inference(resolution,[],[f97,f100]) ).
fof(f134,plain,
rr(i2003_11_14_17_21_22376,sK0(i2003_11_14_17_21_22376)),
inference(resolution,[],[f131,f102]) ).
fof(f135,plain,
! [X0,X1] :
( ~ rr(i2003_11_14_17_21_22376,X0)
| ~ rr(i2003_11_14_17_21_22376,X1)
| X0 = X1 ),
inference(resolution,[],[f84,f102]) ).
fof(f152,plain,
! [X0] :
( ~ rr(i2003_11_14_17_21_22376,X0)
| sK1(i2003_11_14_17_21_22376) = X0 ),
inference(resolution,[],[f135,f121]) ).
fof(f155,plain,
sK1(i2003_11_14_17_21_22376) = sK0(i2003_11_14_17_21_22376),
inference(resolution,[],[f152,f134]) ).
fof(f159,plain,
( ca_Vx2(sK0(i2003_11_14_17_21_22376))
| ~ cUnsatisfiable(i2003_11_14_17_21_22376) ),
inference(superposition,[],[f88,f155]) ).
fof(f160,plain,
ca_Vx2(sK0(i2003_11_14_17_21_22376)),
inference(forward_subsumption_resolution,[],[f159,f102]) ).
fof(f165,plain,
! [X0] :
( cp(X0)
| ~ rs(X0,sK0(i2003_11_14_17_21_22376)) ),
inference(resolution,[],[f160,f133]) ).
fof(f170,plain,
! [X0] :
( ~ rs(X0,sK0(i2003_11_14_17_21_22376))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f165,f127]) ).
fof(f176,plain,
( ~ cUnsatisfiable(i2003_11_14_17_21_22376)
| ~ cUnsatisfiable(i2003_11_14_17_21_22376) ),
inference(resolution,[],[f170,f91]) ).
fof(f177,plain,
~ cUnsatisfiable(i2003_11_14_17_21_22376),
inference(duplicate_literal_removal,[],[f176]) ).
fof(f178,plain,
$false,
inference(forward_subsumption_resolution,[],[f177,f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS113+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:28:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.45 % (2356016)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (2356025)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2280363732:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (2356025) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2356016-2356025"...
% 0.10/0.45 % (2356025)...printing done.
% 0.10/0.45 % (2356025)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (2356025)------------------------------
% 0.10/0.45 % (2356025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (2356025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (2356025)CaDiCaL version: 2.1.3
% 0.10/0.45 % (2356025)Termination reason: Refutation
% 0.10/0.45 % (2356025)Time elapsed: 0.002 s
% 0.10/0.45 % (2356025)Peak memory usage: 12 MB
% 0.10/0.45 % (2356025)Instructions burned: 5 (million)
% 0.10/0.45 % (2356016)Success in time 0.029 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------