%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS110+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:41:40 AM UTC 2026
% Result : Unsatisfiable 3.83s 1.53s
% Output : Refutation 3.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 151 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 184 ( 70 ~; 63 |; 42 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 77 ( 58 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f25,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X1] :
( rs(X0,X1)
=> cpxcomp(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f26,axiom,
! [X0] :
( cp(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f27,axiom,
! [X0] :
( cpxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f28,axiom,
! [X0] :
( ca_Ax2(X0)
<=> ( cp(X0)
& ? [X1] :
( rinvS(X0,X1)
& cp(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f35,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(f38,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( rs(X0,X2)
=> cpxcomp(X2) ) ) ),
inference(rectify,[],[f25]) ).
fof(f83,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) ) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f84,plain,
! [X0] :
( cp(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f94,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) ) )
& ( ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f95,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) ) )
& ( ( ? [X1] :
( rs(X0,X1)
& ca_Ax2(X1) )
& ! [X2] :
( cpxcomp(X2)
| ~ rs(X0,X2) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ? [X2] :
( ~ cpxcomp(X2)
& rs(X0,X2) ) )
& ( ( ? [X3] :
( rs(X0,X3)
& ca_Ax2(X3) )
& ! [X4] :
( cpxcomp(X4)
| ~ rs(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f95]) ).
fof(f97,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rs(X0,X1)
| ~ ca_Ax2(X1) )
| ( ~ cpxcomp(sK0(X0))
& rs(X0,sK0(X0)) ) )
& ( ( rs(X0,sK1(X0))
& ca_Ax2(sK1(X0))
& ! [X4] :
( cpxcomp(X4)
| ~ rs(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X2,sK0(X0)),skolemize(X3,sK1(X0))],[f96]) ).
fof(f98,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cp(X0) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f99,plain,
! [X0] :
( ( cp(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(rectify,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ( cp(X0)
| ra_Px1(X0,sK2(X0)) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cp(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X1,sK2(X0))],[f99]) ).
fof(f101,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X1] : ra_Px1(X0,X1)
| ~ cpxcomp(X0) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f102,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X2] : ra_Px1(X0,X2)
| ~ cpxcomp(X0) ) ),
inference(rectify,[],[f101]) ).
fof(f103,plain,
! [X0] :
( ( cpxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ra_Px1(X0,sK3(X0))
| ~ cpxcomp(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0))],[f102]) ).
fof(f104,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& ? [X1] :
( rinvS(X0,X1)
& cp(X1) ) )
| ~ ca_Ax2(X0) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f105,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& ? [X1] :
( rinvS(X0,X1)
& cp(X1) ) )
| ~ ca_Ax2(X0) ) ),
inference(flattening,[],[f104]) ).
fof(f106,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& ? [X2] :
( rinvS(X0,X2)
& cp(X2) ) )
| ~ ca_Ax2(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ( ca_Ax2(X0)
| ~ cp(X0)
| ! [X1] :
( ~ rinvS(X0,X1)
| ~ cp(X1) ) )
& ( ( cp(X0)
& rinvS(X0,sK4(X0))
& cp(sK4(X0)) )
| ~ ca_Ax2(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0))],[f106]) ).
fof(f137,plain,
! [X0,X4] :
( cpxcomp(X4)
| ~ rs(X0,X4)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f138,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ca_Ax2(sK1(X0)) ),
inference(cnf_transformation,[],[f97]) ).
fof(f139,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rs(X0,sK1(X0)) ),
inference(cnf_transformation,[],[f97]) ).
fof(f142,plain,
! [X2,X0] :
( ~ ra_Px1(X0,X2)
| ~ cp(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f144,plain,
! [X0] :
( ~ cpxcomp(X0)
| ra_Px1(X0,sK3(X0)) ),
inference(cnf_transformation,[],[f103]) ).
fof(f148,plain,
! [X0] :
( cp(X0)
| ~ ca_Ax2(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f159,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(cnf_transformation,[],[f35]) ).
fof(f191,plain,
ca_Ax2(sK1(i2003_11_14_17_21_12565)),
inference(resolution,[],[f138,f159]) ).
fof(f192,plain,
rs(i2003_11_14_17_21_12565,sK1(i2003_11_14_17_21_12565)),
inference(resolution,[],[f139,f159]) ).
fof(f200,plain,
! [X0,X1] :
( ra_Px1(X1,sK3(X1))
| ~ cUnsatisfiable(X0)
| ~ rs(X0,X1) ),
inference(resolution,[],[f137,f144]) ).
fof(f204,plain,
! [X0,X1] :
( ~ cp(X1)
| ~ rs(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f200,f142]) ).
fof(f207,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rs(X0,X1)
| ~ ca_Ax2(X1) ),
inference(resolution,[],[f204,f148]) ).
fof(f211,plain,
! [X0] :
( ~ ca_Ax2(X0)
| ~ rs(i2003_11_14_17_21_12565,X0) ),
inference(resolution,[],[f207,f159]) ).
fof(f214,plain,
~ rs(i2003_11_14_17_21_12565,sK1(i2003_11_14_17_21_12565)),
inference(resolution,[],[f211,f191]) ).
fof(f219,plain,
$false,
inference(resolution,[],[f214,f192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS110+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 % Computer : n016.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 13:29:17 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.83/1.53 % (2651903)Detected formulas, will run a generic FOF schedule.
% 3.83/1.53 % (2651909)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3281652771:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.83/1.53 % (2651908)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=296236861:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.83/1.53 % (2651911)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=425539532:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.83/1.53 % (2651913)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3248428018:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.83/1.53 % (2651914)dis-21_1_sil=8000:lcm=predicate:random_seed=3078207181:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.83/1.53 % (2651910)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=661399812:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.83/1.53 % (2651912)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=124664090:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.83/1.53 % (2651912)Refutation not found, incomplete strategy
% 3.83/1.53 % (2651912)------------------------------
% 3.83/1.53 % (2651912)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.83/1.53 % (2651912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.83/1.53 % (2651912)CaDiCaL version: 2.1.3
% 3.83/1.53 % (2651911)Refutation not found, incomplete strategy
% 3.83/1.53 % (2651911)------------------------------
% 3.83/1.53 % (2651911)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.83/1.53 % (2651912)Termination reason: Refutation not found, incomplete strategy
% 3.83/1.53 % (2651912)Time elapsed: 0.0000 s
% 3.83/1.53 % (2651912)Peak memory usage: 86 MB
% 3.83/1.53 % (2651911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.83/1.53 % (2651911)CaDiCaL version: 2.1.3
% 3.83/1.53 % (2651911)Termination reason: Refutation not found, incomplete strategy
% 3.83/1.53 % (2651911)Time elapsed: 0.0000 s
% 3.83/1.53 % (2651911)Peak memory usage: 86 MB
% 3.83/1.53 % (2651914)First to succeed.
% 3.83/1.53 % (2651913)Also succeeded, but the first one will report.
% 3.83/1.53 % (2651914)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2651903"
% 3.83/1.53 % (2651912)------------------------------
% 3.83/1.53 % (2651912)------------------------------
% 3.83/1.53 % (2651911)------------------------------
% 3.83/1.53 % (2651911)------------------------------
% 3.83/1.53 % (2651914)Refutation found. Thanks to Tanya!
% 3.83/1.53 % SZS status Unsatisfiable for theBenchmark
% 3.83/1.53 % SZS output start Proof for theBenchmark
% See solution above
% 3.83/1.53 % (2651914)------------------------------
% 3.83/1.53 % (2651914)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.83/1.53 % (2651914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.83/1.53 % (2651914)CaDiCaL version: 2.1.3
% 3.83/1.53 % (2651914)Termination reason: Refutation
% 3.83/1.53 % (2651914)Time elapsed: 0.003 s
% 3.83/1.53 % (2651914)Peak memory usage: 88 MB
% 3.83/1.53 % (2651914)Instructions burned: 3 (million)
% 3.83/1.53 % (2651914)------------------------------
% 3.83/1.53 % (2651914)------------------------------
% 3.83/1.53 % (2651903)Success in time 0.45 s
% 3.83/1.53 % Vampire exiting
%------------------------------------------------------------------------------