%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS265+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:59 AM UTC 2026
% Result : Theorem 2.67s 1.33s
% Output : Refutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 72 ( 31 ~; 23 |; 11 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 63 ( 53 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X0)
=> model(X2,X1) )
<=> status(X0,X1,thm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
fof(f13,axiom,
! [X0,X1] :
( ~ ? [X2] : model(X2,X0)
<=> status(X0,X1,cax) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cax) ).
fof(f20,axiom,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X0)
& status(X2,X3,X1) )
<=> mighta(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta) ).
fof(f29,axiom,
? [X0] :
! [X1] : ~ model(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',contradiction) ).
fof(f33,conjecture,
mighta(cax,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta_cax_thm) ).
fof(f34,negated_conjecture,
~ mighta(cax,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ mighta(cax,thm),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X0)
& status(X2,X3,X1) )
=> mighta(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f39,plain,
! [X0,X1] :
( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
fof(f42,plain,
! [X0,X1] :
( ! [X2] : ~ model(X2,X0)
<=> status(X0,X1,cax) ),
inference(ennf_transformation,[],[f13]) ).
fof(f46,plain,
! [X0,X1] :
( mighta(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X0)
| ~ status(X2,X3,X1) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f62,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ? [X2] :
( ~ model(X2,X1)
& model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f63,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ? [X3] :
( ~ model(X3,X1)
& model(X3,X0) ) ) ),
inference(rectify,[],[f62]) ).
fof(f64,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ( ~ model(sK9(X0,X1),X1)
& model(sK9(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f63]) ).
fof(f92,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| ? [X2] : model(X2,X0) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f93,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| ? [X3] : model(X3,X0) ) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ( ! [X2] : ~ model(X2,X0)
| ~ status(X0,X1,cax) )
& ( status(X0,X1,cax)
| model(sK28(X0),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK28]),skolemize(X3,sK28(X0))],[f93]) ).
fof(f122,plain,
! [X1] : ~ model(X1,sK45),
inference(skolemize,[status(esa),new_symbols(skolem,[sK45]),skolemize(X0,sK45)],[f29]) ).
fof(f139,plain,
! [X0,X1] :
( model(sK9(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f64]) ).
fof(f176,plain,
! [X0,X1] :
( model(sK28(X0),X0)
| status(X0,X1,cax) ),
inference(cnf_transformation,[],[f94]) ).
fof(f199,plain,
! [X2,X3,X0,X1] :
( mighta(X0,X1)
| ~ status(X2,X3,X0)
| ~ status(X2,X3,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f207,plain,
! [X1] : ~ model(X1,sK45),
inference(cnf_transformation,[],[f122]) ).
fof(f219,plain,
~ mighta(cax,thm),
inference(cnf_transformation,[],[f35]) ).
fof(f229,plain,
! [X0] : status(sK45,X0,thm),
inference(resolution,[],[f207,f139]) ).
fof(f230,plain,
! [X0] : status(sK45,X0,cax),
inference(resolution,[],[f207,f176]) ).
fof(f232,plain,
! [X0,X1] :
( ~ status(X0,X1,cax)
| ~ status(X0,X1,thm) ),
inference(resolution,[],[f199,f219]) ).
fof(f235,plain,
! [X0] : ~ status(sK45,X0,thm),
inference(resolution,[],[f230,f232]) ).
fof(f237,plain,
$false,
inference(forward_subsumption_resolution,[],[f235,f229]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS265+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n026.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:51:12 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.67/1.33 % (2862097)Detected formulas, will run a generic FOF schedule.
% 2.67/1.33 % (2862107)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3386596530:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.67/1.33 % (2862107)First to succeed.
% 2.67/1.33 % (2862107)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2862097"
% 2.67/1.33 % (2862102)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=3787287498:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.67/1.33 % (2862108)dis-21_1_sil=8000:lcm=predicate:random_seed=1880444527: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.67/1.33 % (2862105)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2516670462:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.67/1.33 % (2862103)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=2022040345:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.67/1.33 % (2862104)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=167250414:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.67/1.33 % (2862105)Refutation not found, incomplete strategy
% 2.67/1.33 % (2862105)------------------------------
% 2.67/1.33 % (2862105)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.33 % (2862105)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.33 % (2862106)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2756723631:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.67/1.33 % (2862105)CaDiCaL version: 2.1.3
% 2.67/1.33 % (2862105)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.33 % (2862105)Time elapsed: 0.001 s
% 2.67/1.33 % (2862105)Peak memory usage: 88 MB
% 2.67/1.33 % (2862106)Also succeeded, but the first one will report.
% 2.67/1.33 % (2862108)Also succeeded, but the first one will report.
% 2.67/1.33 % (2862107)Refutation found. Thanks to Tanya!
% 2.67/1.33 % SZS status Theorem for theBenchmark
% 2.67/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 2.67/1.33 % (2862107)------------------------------
% 2.67/1.33 % (2862107)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.33 % (2862107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.33 % (2862107)CaDiCaL version: 2.1.3
% 2.67/1.33 % (2862107)Termination reason: Refutation
% 2.67/1.33 % (2862107)Time elapsed: 0.002 s
% 2.67/1.33 % (2862107)Peak memory usage: 88 MB
% 2.67/1.33 % (2862107)Instructions burned: 4 (million)
% 2.67/1.33 % (2862107)------------------------------
% 2.67/1.33 % (2862107)------------------------------
% 2.67/1.33 % (2862097)Success in time 0.29 s
% 2.67/1.33 % Vampire exiting
%------------------------------------------------------------------------------