%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KRS233+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 : n005.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:56 AM UTC 2026
% Result : Theorem 3.69s 1.50s
% Output : Refutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 6 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 41 ~; 39 |; 16 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 70 ( 63 !; 7 ?)
% 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(f17,axiom,
! [X0,X1] :
( ? [X2] :
( model(X2,X0)
& model(X2,not(X1)) )
<=> status(X0,X1,csa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',csa) ).
fof(f23,axiom,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
<=> nevera(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera) ).
fof(f26,axiom,
! [X0,X1] :
( model(X0,X1)
<=> ~ model(X0,not(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not) ).
fof(f33,conjecture,
nevera(csa,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nevera_csa_thm) ).
fof(f34,negated_conjecture,
~ nevera(csa,thm),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f35,plain,
~ nevera(csa,thm),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> ~ status(X2,X3,X1) )
=> nevera(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f37,plain,
! [X0,X1] :
( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
fof(f38,plain,
! [X0,X1] :
( nevera(X0,X1)
| ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f40,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,[],[f37]) ).
fof(f41,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,[],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ( ~ model(sK0(X0,X1),X1)
& model(sK0(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( nevera(X0,X1)
| ( status(sK1(X0,X1),sK2(X0,X1),X1)
& status(sK1(X0,X1),sK2(X0,X1),X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1))],[f38]) ).
fof(f44,plain,
! [X0,X1] :
( ( ? [X2] :
( model(X2,X0)
& model(X2,not(X1)) )
| ~ status(X0,X1,csa) )
& ( status(X0,X1,csa)
| ! [X2] :
( ~ model(X2,X0)
| ~ model(X2,not(X1)) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f45,plain,
! [X0,X1] :
( ( ? [X2] :
( model(X2,X0)
& model(X2,not(X1)) )
| ~ status(X0,X1,csa) )
& ( status(X0,X1,csa)
| ! [X3] :
( ~ model(X3,X0)
| ~ model(X3,not(X1)) ) ) ),
inference(rectify,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( ( ( model(sK3(X0,X1),X0)
& model(sK3(X0,X1),not(X1)) )
| ~ status(X0,X1,csa) )
& ( status(X0,X1,csa)
| ! [X3] :
( ~ model(X3,X0)
| ~ model(X3,not(X1)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f45]) ).
fof(f53,plain,
! [X0,X1] :
( ( model(X0,X1)
| model(X0,not(X1)) )
& ( ~ model(X0,not(X1))
| ~ model(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f55,plain,
~ nevera(csa,thm),
inference(cnf_transformation,[],[f35]) ).
fof(f58,plain,
! [X2,X0,X1] :
( ~ status(X0,X1,thm)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f59,plain,
! [X0,X1] :
( status(sK1(X0,X1),sK2(X0,X1),X0)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f60,plain,
! [X0,X1] :
( status(sK1(X0,X1),sK2(X0,X1),X1)
| nevera(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f62,plain,
! [X0,X1] :
( model(sK3(X0,X1),not(X1))
| ~ status(X0,X1,csa) ),
inference(cnf_transformation,[],[f46]) ).
fof(f63,plain,
! [X0,X1] :
( model(sK3(X0,X1),X0)
| ~ status(X0,X1,csa) ),
inference(cnf_transformation,[],[f46]) ).
fof(f79,plain,
! [X0,X1] :
( ~ model(X0,not(X1))
| ~ model(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f100,plain,
! [X0,X1] :
( ~ model(sK3(X0,X1),X1)
| ~ status(X0,X1,csa) ),
inference(resolution,[],[f62,f79]) ).
fof(f107,plain,
! [X0,X1] :
( model(X1,sK2(X0,thm))
| ~ model(X1,sK1(X0,thm))
| nevera(X0,thm) ),
inference(resolution,[],[f60,f58]) ).
fof(f147,plain,
! [X0,X1] :
( ~ model(sK3(X0,sK2(X1,thm)),sK1(X1,thm))
| nevera(X1,thm)
| ~ status(X0,sK2(X1,thm),csa) ),
inference(resolution,[],[f107,f100]) ).
fof(f223,plain,
! [X0] :
( nevera(X0,thm)
| ~ status(sK1(X0,thm),sK2(X0,thm),csa)
| ~ status(sK1(X0,thm),sK2(X0,thm),csa) ),
inference(resolution,[],[f147,f63]) ).
fof(f226,plain,
! [X0] :
( ~ status(sK1(X0,thm),sK2(X0,thm),csa)
| nevera(X0,thm) ),
inference(duplicate_literal_removal,[],[f223]) ).
fof(f271,plain,
( nevera(csa,thm)
| nevera(csa,thm) ),
inference(resolution,[],[f226,f59]) ).
fof(f272,plain,
nevera(csa,thm),
inference(duplicate_literal_removal,[],[f271]) ).
fof(f273,plain,
$false,
inference(forward_subsumption_resolution,[],[f272,f55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS233+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.11/0.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 13:44:02 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 3.69/1.50 % (3993543)Detected formulas, will run a generic FOF schedule.
% 3.69/1.50 % (3993551)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2276492583:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.69/1.50 % (3993551)Refutation not found, incomplete strategy
% 3.69/1.50 % (3993551)------------------------------
% 3.69/1.50 % (3993551)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.50 % (3993551)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.50 % (3993551)CaDiCaL version: 2.1.3
% 3.69/1.50 % (3993551)Termination reason: Refutation not found, incomplete strategy
% 3.69/1.50 % (3993551)Time elapsed: 0.001 s
% 3.69/1.50 % (3993551)Peak memory usage: 88 MB
% 3.69/1.50 % (3993550)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=2076448896:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.69/1.50 % (3993554)dis-21_1_sil=8000:lcm=predicate:random_seed=1096641422: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.69/1.50 % (3993549)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=354042541:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.69/1.50 % (3993548)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=2027686086:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.69/1.50 % (3993552)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=750767003:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.69/1.50 % (3993553)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1299516064:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.69/1.50 % (3993552)First to succeed.
% 3.69/1.50 % (3993552)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3993543"
% 3.69/1.50 % (3993554)Also succeeded, but the first one will report.
% 3.69/1.50 % (3993553)Also succeeded, but the first one will report.
% 3.69/1.50 % (3993551)------------------------------
% 3.69/1.50 % (3993551)------------------------------
% 3.69/1.50 % (3993562)lrs+10_1_sil=8000:sp=occurrence:random_seed=2215436837:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.69/1.50 % (3993552)Refutation found. Thanks to Tanya!
% 3.69/1.50 % SZS status Theorem for theBenchmark
% 3.69/1.50 % SZS output start Proof for theBenchmark
% See solution above
% 3.69/1.50 % (3993552)------------------------------
% 3.69/1.50 % (3993552)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.50 % (3993552)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.50 % (3993552)CaDiCaL version: 2.1.3
% 3.69/1.50 % (3993552)Termination reason: Refutation
% 3.69/1.50 % (3993552)Time elapsed: 0.006 s
% 3.69/1.50 % (3993552)Peak memory usage: 88 MB
% 3.69/1.50 % (3993552)Instructions burned: 6 (million)
% 3.69/1.50 % (3993552)------------------------------
% 3.69/1.50 % (3993552)------------------------------
% 3.69/1.50 % (3993543)Success in time 0.448 s
% 3.69/1.50 % Vampire exiting
%------------------------------------------------------------------------------