%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV189+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 01:08:20 PM UTC 2026
% Result : Theorem 3.60s 1.20s
% Output : Refutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 15 unt; 0 def)
% Number of atoms : 126 ( 26 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 126 ( 46 ~; 37 |; 30 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-3 aty)
% Number of variables : 62 ( 56 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_leq) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_gt1) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',succ_plus_1_l) ).
fof(f42,axiom,
! [X0,X1] :
( leq(succ(X0),succ(X1))
<=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_succ) ).
fof(f53,conjecture,
( ! [X0] :
( ( leq(n0,X0)
& leq(X0,n4) )
=> a_select3(center_init,X0,n0) = init )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,tptp_minus_1) )
=> ! [X2] :
( ( leq(n0,X2)
& leq(X2,n4) )
=> a_select3(q_init,X1,X2) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0121) ).
fof(f54,negated_conjecture,
~ ( ! [X0] :
( ( leq(n0,X0)
& leq(X0,n4) )
=> a_select3(center_init,X0,n0) = init )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,tptp_minus_1) )
=> ! [X2] :
( ( leq(n0,X2)
& leq(X2,n4) )
=> a_select3(q_init,X1,X2) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f58,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_0_tptp_minus_1) ).
fof(f78,axiom,
! [X0] :
( ( leq(n0,X0)
& leq(X0,n0) )
=> X0 = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f87,plain,
( ? [X1] :
( ? [X2] :
( init != a_select3(q_init,X1,X2)
& leq(n0,X2)
& leq(X2,n4) )
& leq(n0,X1)
& leq(X1,tptp_minus_1) )
& ! [X0] :
( a_select3(center_init,X0,n0) = init
| ~ leq(n0,X0)
| ~ leq(X0,n4) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( ? [X1] :
( ? [X2] :
( init != a_select3(q_init,X1,X2)
& leq(n0,X2)
& leq(X2,n4) )
& leq(n0,X1)
& leq(X1,tptp_minus_1) )
& ! [X0] :
( a_select3(center_init,X0,n0) = init
| ~ leq(n0,X0)
| ~ leq(X0,n4) ) ),
inference(flattening,[],[f87]) ).
fof(f89,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f90,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(flattening,[],[f89]) ).
fof(f91,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f92,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f91]) ).
fof(f97,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f110,plain,
( ? [X0] :
( ? [X1] :
( init != a_select3(q_init,X0,X1)
& leq(n0,X1)
& leq(X1,n4) )
& leq(n0,X0)
& leq(X0,tptp_minus_1) )
& ! [X2] :
( init = a_select3(center_init,X2,n0)
| ~ leq(n0,X2)
| ~ leq(X2,n4) ) ),
inference(rectify,[],[f88]) ).
fof(f111,plain,
( init != a_select3(q_init,sK0,sK1)
& leq(n0,sK1)
& leq(sK1,n4)
& leq(n0,sK0)
& leq(sK0,tptp_minus_1)
& ! [X2] :
( init = a_select3(center_init,X2,n0)
| ~ leq(n0,X2)
| ~ leq(X2,n4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f110]) ).
fof(f112,plain,
! [X0,X1] :
( ( leq(succ(X0),succ(X1))
| ~ leq(X0,X1) )
& ( leq(X0,X1)
| ~ leq(succ(X0),succ(X1)) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f113,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f115,plain,
leq(sK0,tptp_minus_1),
inference(cnf_transformation,[],[f111]) ).
fof(f116,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f111]) ).
fof(f120,plain,
! [X0] :
( ~ leq(n0,X0)
| n0 = X0
| ~ leq(X0,n0) ),
inference(cnf_transformation,[],[f90]) ).
fof(f121,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f92]) ).
fof(f126,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[],[f58]) ).
fof(f129,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f137,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f97]) ).
fof(f138,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f164,plain,
! [X0,X1] :
( leq(succ(X0),succ(X1))
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
fof(f165,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f175,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f177,plain,
n0 = plus(n1,tptp_minus_1),
inference(definition_unfolding,[],[f129,f175]) ).
fof(f186,plain,
! [X0,X1] :
( leq(plus(n1,X0),plus(n1,X1))
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f164,f175,f175]) ).
fof(f189,plain,
! [X0,X1] :
( gt(plus(n1,X1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f165,f175]) ).
fof(f225,plain,
! [X0] : ~ leq(plus(n1,X0),X0),
inference(resolution,[],[f189,f138]) ).
fof(f241,plain,
( ~ leq(sK0,n0)
| n0 = sK0 ),
inference(resolution,[],[f120,f116]) ).
fof(f251,plain,
! [X0] :
( ~ leq(sK0,X0)
| ~ leq(X0,n0)
| n0 = sK0 ),
inference(resolution,[],[f121,f241]) ).
fof(f264,plain,
( ~ leq(tptp_minus_1,n0)
| n0 = sK0 ),
inference(resolution,[],[f251,f115]) ).
fof(f270,plain,
( n0 = sK0
| ~ gt(n0,tptp_minus_1) ),
inference(resolution,[],[f264,f137]) ).
fof(f271,plain,
n0 = sK0,
inference(forward_subsumption_resolution,[],[f270,f126]) ).
fof(f339,plain,
! [X0] :
( leq(plus(n1,X0),n0)
| ~ leq(X0,tptp_minus_1) ),
inference(superposition,[],[f186,f177]) ).
fof(f343,plain,
! [X0] :
( leq(plus(n1,X0),sK0)
| ~ leq(X0,tptp_minus_1) ),
inference(forward_demodulation,[],[f339,f271]) ).
fof(f462,plain,
~ leq(sK0,tptp_minus_1),
inference(resolution,[],[f343,f225]) ).
fof(f470,plain,
$false,
inference(forward_subsumption_resolution,[],[f462,f115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV189+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.16 % Computer : n007.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Mon Sep 28 10:06:10 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.20 Running first-order theorem proving
% 0.11/0.20 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.60/1.20 % (2297709)Detected formulas, will run a generic FOF schedule.
% 3.60/1.20 % (2297714)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=701036741:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.60/1.20 % (2297715)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=1496817379:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.60/1.20 % (2297718)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1406427441:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.60/1.20 % (2297717)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=214340848:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.60/1.20 % (2297716)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=498238409:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.60/1.20 % (2297720)dis-21_1_sil=8000:lcm=predicate:random_seed=262836710: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.60/1.20 % (2297719)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2122999593:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.60/1.20 % (2297718)First to succeed.
% 3.60/1.20 % (2297718)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2297709"
% 3.60/1.20 % (2297719)Also succeeded, but the first one will report.
% 3.60/1.20 % (2297717)Refutation not found, incomplete strategy
% 3.60/1.20 % (2297717)------------------------------
% 3.60/1.20 % (2297717)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.20 % (2297717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.20 % (2297717)CaDiCaL version: 2.1.3
% 3.60/1.20 % (2297717)Termination reason: Refutation not found, incomplete strategy
% 3.60/1.20 % (2297717)Time elapsed: 0.032 s
% 3.60/1.20 % (2297717)Peak memory usage: 88 MB
% 3.60/1.20 % (2297717)Instructions burned: 61 (million)
% 3.60/1.20 % (2297720)Instruction limit reached!
% 3.60/1.20 % (2297720)------------------------------
% 3.60/1.20 % (2297720)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.20 % (2297720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.20 % (2297720)CaDiCaL version: 2.1.3
% 3.60/1.20 % (2297720)Termination reason: Instruction limit
% 3.60/1.20 % (2297720)Termination phase: Saturation
% 3.60/1.20 % (2297720)Time elapsed: 0.069 s
% 3.60/1.20 % (2297720)Peak memory usage: 88 MB
% 3.60/1.20 % (2297720)Instructions burned: 130 (million)
% 3.60/1.20 % (2297728)lrs+10_1_sil=8000:sp=occurrence:random_seed=355079890:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.60/1.20 % (2297728)Also succeeded, but the first one will report.
% 3.60/1.20 % (2297718)Refutation found. Thanks to Tanya!
% 3.60/1.20 % SZS status Theorem for theBenchmark
% 3.60/1.20 % SZS output start Proof for theBenchmark
% See solution above
% 3.70/1.20 % (2297718)------------------------------
% 3.70/1.20 % (2297718)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.20 % (2297718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.20 % (2297718)CaDiCaL version: 2.1.3
% 3.70/1.20 % (2297718)Termination reason: Refutation
% 3.70/1.20 % (2297718)Time elapsed: 0.010 s
% 3.70/1.20 % (2297718)Peak memory usage: 88 MB
% 3.70/1.20 % (2297718)Instructions burned: 14 (million)
% 3.70/1.20 % (2297718)------------------------------
% 3.70/1.20 % (2297718)------------------------------
% 3.70/1.20 % (2297709)Success in time 0.442 s
% 3.70/1.20 % Vampire exiting
%------------------------------------------------------------------------------