%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS072+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:41:35 AM UTC 2026
% Result : Unsatisfiable 3.61s 1.48s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 144 ( 18 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 182 ( 69 ~; 62 |; 45 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 71 ( 53 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rinvR(X0,X1)
& ! [X2,X3] :
( ( rr(X1,X2)
& rr(X1,X3) )
=> X2 = X3 )
& ? [X4] :
( rr(X1,X4)
& cp1(X4) ) )
& cp2(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f18,axiom,
! [X0] :
( cp1(X0)
=> ~ ( cp3(X0)
| cp2(X0)
| cp4(X0)
| cp5(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f22,axiom,
! [X0,X1] :
( rinvR(X0,X1)
<=> rr(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f23,axiom,
cUnsatisfiable(i2003_11_14_17_18_50190),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).
fof(f52,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rinvR(X0,X1)
& ! [X2,X3] :
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3) )
& ? [X4] :
( rr(X1,X4)
& cp1(X4) ) )
& cp2(X0) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f53,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rinvR(X0,X1)
& ! [X2,X3] :
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3) )
& ? [X4] :
( rr(X1,X4)
& cp1(X4) ) )
& cp2(X0) ) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
! [X0] :
( ( ~ cp3(X0)
& ~ cp2(X0)
& ~ cp4(X0)
& ~ cp5(X0) )
| ~ cp1(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f59,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rinvR(X0,X1)
| ? [X2,X3] :
( X2 != X3
& rr(X1,X2)
& rr(X1,X3) )
| ! [X4] :
( ~ rr(X1,X4)
| ~ cp1(X4) ) )
| ~ cp2(X0) )
& ( ( ? [X1] :
( rinvR(X0,X1)
& ! [X2,X3] :
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3) )
& ? [X4] :
( rr(X1,X4)
& cp1(X4) ) )
& cp2(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f53]) ).
fof(f60,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rinvR(X0,X1)
| ? [X2,X3] :
( X2 != X3
& rr(X1,X2)
& rr(X1,X3) )
| ! [X4] :
( ~ rr(X1,X4)
| ~ cp1(X4) ) )
| ~ cp2(X0) )
& ( ( ? [X1] :
( rinvR(X0,X1)
& ! [X2,X3] :
( X2 = X3
| ~ rr(X1,X2)
| ~ rr(X1,X3) )
& ? [X4] :
( rr(X1,X4)
& cp1(X4) ) )
& cp2(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rinvR(X0,X1)
| ? [X2,X3] :
( X2 != X3
& rr(X1,X2)
& rr(X1,X3) )
| ! [X4] :
( ~ rr(X1,X4)
| ~ cp1(X4) ) )
| ~ cp2(X0) )
& ( ( ? [X5] :
( rinvR(X0,X5)
& ! [X6,X7] :
( X6 = X7
| ~ rr(X5,X6)
| ~ rr(X5,X7) )
& ? [X8] :
( rr(X5,X8)
& cp1(X8) ) )
& cp2(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f60]) ).
fof(f62,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ rinvR(X0,X1)
| ( sK0(X1) != sK1(X1)
& rr(X1,sK0(X1))
& rr(X1,sK1(X1)) )
| ! [X4] :
( ~ rr(X1,X4)
| ~ cp1(X4) ) )
| ~ cp2(X0) )
& ( ( rinvR(X0,sK2(X0))
& ! [X6,X7] :
( X6 = X7
| ~ rr(sK2(X0),X6)
| ~ rr(sK2(X0),X7) )
& rr(sK2(X0),sK3(X0))
& cp1(sK3(X0))
& cp2(X0) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X2,sK0(X1)),skolemize(X3,sK1(X1)),skolemize(X5,sK2(X0)),skolemize(X8,sK3(X0))],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( ( rinvR(X0,X1)
| ~ rr(X1,X0) )
& ( rr(X1,X0)
| ~ rinvR(X0,X1) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f82,plain,
! [X0] :
( cp2(X0)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f83,plain,
! [X0] :
( cp1(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f84,plain,
! [X0] :
( rr(sK2(X0),sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f85,plain,
! [X0,X6,X7] :
( ~ cUnsatisfiable(X0)
| ~ rr(sK2(X0),X6)
| ~ rr(sK2(X0),X7)
| X6 = X7 ),
inference(cnf_transformation,[],[f62]) ).
fof(f86,plain,
! [X0] :
( rinvR(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f92,plain,
! [X0] :
( ~ cp1(X0)
| ~ cp2(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f100,plain,
! [X0,X1] :
( rr(X1,X0)
| ~ rinvR(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f102,plain,
cUnsatisfiable(i2003_11_14_17_18_50190),
inference(cnf_transformation,[],[f23]) ).
fof(f117,plain,
! [X0] :
( ~ cp2(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f83,f92]) ).
fof(f118,plain,
! [X0] :
( ~ cUnsatisfiable(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f117,f82]) ).
fof(f119,plain,
! [X0,X1] :
( ~ rr(sK2(i2003_11_14_17_18_50190),X0)
| ~ rr(sK2(i2003_11_14_17_18_50190),X1)
| X0 = X1 ),
inference(resolution,[],[f85,f102]) ).
fof(f121,plain,
! [X0,X1] :
( ~ rinvR(X1,sK2(i2003_11_14_17_18_50190))
| X0 = X1
| ~ rr(sK2(i2003_11_14_17_18_50190),X0) ),
inference(resolution,[],[f119,f100]) ).
fof(f161,plain,
! [X0] :
( i2003_11_14_17_18_50190 = X0
| ~ rr(sK2(i2003_11_14_17_18_50190),X0)
| ~ cUnsatisfiable(i2003_11_14_17_18_50190) ),
inference(resolution,[],[f121,f86]) ).
fof(f163,plain,
! [X0] :
( ~ rr(sK2(i2003_11_14_17_18_50190),X0)
| i2003_11_14_17_18_50190 = X0 ),
inference(forward_subsumption_resolution,[],[f161,f102]) ).
fof(f164,plain,
( i2003_11_14_17_18_50190 = sK3(i2003_11_14_17_18_50190)
| ~ cUnsatisfiable(i2003_11_14_17_18_50190) ),
inference(resolution,[],[f163,f84]) ).
fof(f168,plain,
i2003_11_14_17_18_50190 = sK3(i2003_11_14_17_18_50190),
inference(forward_subsumption_resolution,[],[f164,f102]) ).
fof(f173,plain,
( ~ cUnsatisfiable(i2003_11_14_17_18_50190)
| ~ cUnsatisfiable(i2003_11_14_17_18_50190) ),
inference(superposition,[],[f118,f168]) ).
fof(f176,plain,
~ cUnsatisfiable(i2003_11_14_17_18_50190),
inference(duplicate_literal_removal,[],[f173]) ).
fof(f179,plain,
$false,
inference(forward_subsumption_resolution,[],[f176,f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS072+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 13:21:38 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.61/1.48 % (2352698)Detected formulas, will run a generic FOF schedule.
% 3.61/1.48 % (2352703)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=1218947507:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.61/1.48 % (2352706)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2346847637:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.61/1.48 % (2352707)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2254580750:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.61/1.48 % (2352705)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=1677950949:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.61/1.48 % (2352709)dis-21_1_sil=8000:lcm=predicate:random_seed=2477176844: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.61/1.48 % (2352704)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=1719186803:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.61/1.48 % (2352708)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4113247278:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.61/1.48 % (2352707)Refutation not found, incomplete strategy
% 3.61/1.48 % (2352707)------------------------------
% 3.61/1.48 % (2352707)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48 % (2352707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48 % (2352707)CaDiCaL version: 2.1.3
% 3.61/1.48 % (2352706)Refutation not found, incomplete strategy
% 3.61/1.48 % (2352706)------------------------------
% 3.61/1.48 % (2352706)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48 % (2352707)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.48 % (2352707)Time elapsed: 0.0000 s
% 3.61/1.48 % (2352707)Peak memory usage: 86 MB
% 3.61/1.48 % (2352706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48 % (2352706)CaDiCaL version: 2.1.3
% 3.61/1.48 % (2352706)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.48 % (2352706)Time elapsed: 0.0000 s
% 3.61/1.48 % (2352706)Peak memory usage: 86 MB
% 3.61/1.48 % (2352709)Refutation not found, incomplete strategy
% 3.61/1.48 % (2352709)------------------------------
% 3.61/1.48 % (2352709)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48 % (2352709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48 % (2352709)CaDiCaL version: 2.1.3
% 3.61/1.48 % (2352709)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.48 % (2352709)Time elapsed: 0.002 s
% 3.61/1.48 % (2352709)Peak memory usage: 88 MB
% 3.61/1.48 % (2352709)Instructions burned: 2 (million)
% 3.61/1.48 % (2352708)First to succeed.
% 3.61/1.48 % (2352708)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2352698"
% 3.61/1.48 % (2352709)------------------------------
% 3.61/1.48 % (2352709)------------------------------
% 3.61/1.48 % (2352707)------------------------------
% 3.61/1.48 % (2352707)------------------------------
% 3.61/1.48 % (2352706)------------------------------
% 3.61/1.48 % (2352706)------------------------------
% 3.61/1.48 % (2352708)Refutation found. Thanks to Tanya!
% 3.61/1.48 % SZS status Unsatisfiable for theBenchmark
% 3.61/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.48 % (2352708)------------------------------
% 3.61/1.48 % (2352708)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.48 % (2352708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.48 % (2352708)CaDiCaL version: 2.1.3
% 3.61/1.48 % (2352708)Termination reason: Refutation
% 3.61/1.48 % (2352708)Time elapsed: 0.005 s
% 3.61/1.48 % (2352708)Peak memory usage: 89 MB
% 3.61/1.48 % (2352708)Instructions burned: 4 (million)
% 3.61/1.48 % (2352708)------------------------------
% 3.61/1.48 % (2352708)------------------------------
% 3.61/1.48 % (2352698)Success in time 0.43 s
% 3.61/1.48 % Vampire exiting
%------------------------------------------------------------------------------