%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS124+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 : n020.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:42 AM UTC 2026
% Result : Unsatisfiable 2.66s 1.28s
% Output : Refutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 80 ( 32 ~; 21 |; 12 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 51 ( 41 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& cowlThing(X1) )
& ! [X1] :
( rr(X0,X1)
=> ca_Ax3(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
! [X0] :
( cc(X0)
=> cdxcomp(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f7,axiom,
! [X0] :
( cd(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f8,axiom,
! [X0] :
( cdxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f13,axiom,
! [X0] :
( ca_Ax3(X0)
<=> ( cd(X0)
& cc(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_22_10903),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(f15,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ? [X1] :
( rr(X0,X1)
& cowlThing(X1) )
& ! [X2] :
( rr(X0,X2)
=> ca_Ax3(X2) ) ) ),
inference(rectify,[],[f3]) ).
fof(f18,plain,
! [X0] :
( cdxcomp(X0)
=> ? [X1] : ra_Px1(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f19,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ? [X1] :
( rr(X0,X1)
& cowlThing(X1) )
& ! [X2] :
( rr(X0,X2)
=> ca_Ax3(X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f20,plain,
! [X0] :
( ca_Ax3(X0)
=> ( cd(X0)
& cc(X0) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f21,plain,
! [X0] :
( cd(X0)
=> ~ ? [X1] : ra_Px1(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f23,plain,
! [X0] :
( cUnsatisfiable(X0)
=> ( ? [X1] : rr(X0,X1)
& ! [X2] :
( rr(X0,X2)
=> ca_Ax3(X2) ) ) ),
inference(pure_predicate_removal,[],[f19]) ).
fof(f31,plain,
! [X0] :
( ( ? [X1] : rr(X0,X1)
& ! [X2] :
( ca_Ax3(X2)
| ~ rr(X0,X2) ) )
| ~ cUnsatisfiable(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f32,plain,
! [X0] :
( cdxcomp(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f33,plain,
! [X0] :
( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cd(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f34,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
| ~ cdxcomp(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f35,plain,
! [X0] :
( ( cd(X0)
& cc(X0) )
| ~ ca_Ax3(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f36,plain,
! [X0] :
( ( rr(X0,sK0(X0))
& ! [X2] :
( ca_Ax3(X2)
| ~ rr(X0,X2) ) )
| ~ cUnsatisfiable(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f31]) ).
fof(f37,plain,
! [X0] :
( ra_Px1(X0,sK1(X0))
| ~ cdxcomp(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f34]) ).
fof(f38,plain,
! [X2,X0] :
( ca_Ax3(X2)
| ~ rr(X0,X2)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f39,plain,
! [X0] :
( rr(X0,sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f40,plain,
! [X0] :
( cdxcomp(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f41,plain,
! [X0,X1] :
( ~ ra_Px1(X0,X1)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f42,plain,
! [X0] :
( ra_Px1(X0,sK1(X0))
| ~ cdxcomp(X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f43,plain,
! [X0] :
( cc(X0)
| ~ ca_Ax3(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f44,plain,
! [X0] :
( cd(X0)
| ~ ca_Ax3(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f45,plain,
cUnsatisfiable(i2003_11_14_17_22_10903),
inference(cnf_transformation,[],[f14]) ).
fof(f46,plain,
! [X0] :
( ~ cd(X0)
| ~ cdxcomp(X0) ),
inference(resolution,[],[f42,f41]) ).
fof(f47,plain,
! [X0] :
( ~ cdxcomp(X0)
| ~ ca_Ax3(X0) ),
inference(resolution,[],[f46,f44]) ).
fof(f48,plain,
! [X0] :
( ~ ca_Ax3(X0)
| ~ cc(X0) ),
inference(resolution,[],[f47,f40]) ).
fof(f49,plain,
! [X0] : ~ ca_Ax3(X0),
inference(forward_subsumption_resolution,[],[f48,f43]) ).
fof(f50,plain,
! [X0,X1] :
( ~ cUnsatisfiable(X0)
| ~ rr(X0,X1) ),
inference(resolution,[],[f49,f38]) ).
fof(f51,plain,
! [X0] : ~ rr(i2003_11_14_17_22_10903,X0),
inference(resolution,[],[f50,f45]) ).
fof(f52,plain,
~ cUnsatisfiable(i2003_11_14_17_22_10903),
inference(resolution,[],[f51,f39]) ).
fof(f53,plain,
$false,
inference(forward_subsumption_resolution,[],[f52,f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS124+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n020.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 13:28:19 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 2.66/1.28 % (3382845)Detected formulas, will run a generic FOF schedule.
% 2.66/1.28 % (3382855)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=949397994:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.66/1.28 % (3382855)First to succeed.
% 2.66/1.28 % (3382855)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3382845"
% 2.66/1.28 % (3382850)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=1023906313:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.66/1.28 % (3382854)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2206823020:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.66/1.28 % (3382853)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1193749125:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.66/1.28 % (3382852)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=2742168063:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.66/1.28 % (3382851)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=591472496:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.66/1.28 % (3382854)Refutation not found, incomplete strategy
% 2.66/1.28 % (3382854)------------------------------
% 2.66/1.28 % (3382854)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.28 % (3382854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.28 % (3382854)CaDiCaL version: 2.1.3
% 2.66/1.28 % (3382853)Refutation not found, incomplete strategy
% 2.66/1.28 % (3382853)------------------------------
% 2.66/1.28 % (3382853)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.28 % (3382854)Termination reason: Refutation not found, incomplete strategy
% 2.66/1.28 % (3382854)Time elapsed: 0.0000 s
% 2.66/1.28 % (3382854)Peak memory usage: 86 MB
% 2.66/1.28 % (3382853)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.28 % (3382853)CaDiCaL version: 2.1.3
% 2.66/1.28 % (3382853)Termination reason: Refutation not found, incomplete strategy
% 2.66/1.28 % (3382853)Time elapsed: 0.0000 s
% 2.66/1.28 % (3382853)Peak memory usage: 86 MB
% 2.66/1.28 % (3382856)dis-21_1_sil=8000:lcm=predicate:random_seed=216569183: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)
% 2.66/1.28 % (3382856)Also succeeded, but the first one will report.
% 2.66/1.28 % (3382855)Refutation found. Thanks to Tanya!
% 2.66/1.28 % SZS status Unsatisfiable for theBenchmark
% 2.66/1.28 % SZS output start Proof for theBenchmark
% See solution above
% 2.66/1.28 % (3382855)------------------------------
% 2.66/1.28 % (3382855)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.28 % (3382855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.28 % (3382855)CaDiCaL version: 2.1.3
% 2.66/1.28 % (3382855)Termination reason: Refutation
% 2.66/1.28 % (3382855)Time elapsed: 0.001 s
% 2.66/1.28 % (3382855)Peak memory usage: 88 MB
% 2.66/1.28 % (3382855)Instructions burned: 1 (million)
% 2.66/1.28 % (3382855)------------------------------
% 2.66/1.28 % (3382855)------------------------------
% 2.66/1.28 % (3382845)Success in time 0.312 s
% 2.66/1.28 % Vampire exiting
%------------------------------------------------------------------------------