%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:02 PM UTC 2026
% Result : Theorem 2.36s 0.72s
% Output : Refutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 18 unt; 4 def)
% Number of atoms : 90 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 78 ( 30 ~; 28 |; 13 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : leq(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_leq) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_gt_pred) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pred_minus_1) ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f66,axiom,
gt(n5,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_5_0) ).
fof(f94,plain,
( ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) )
& leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) )
& leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ),
inference(flattening,[],[f94]) ).
fof(f120,plain,
! [X0,X1] :
( ( leq(X0,pred(X1))
| ~ gt(X1,X0) )
& ( gt(X1,X0)
| ~ leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f121,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f95]) ).
fof(f122,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f95]) ).
fof(f123,plain,
( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f135,plain,
gt(n5,n0),
inference(cnf_transformation,[],[f66]) ).
fof(f172,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f179,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f194,plain,
! [X0,X1] :
( leq(X0,pred(X1))
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f220,plain,
! [X0,X1] :
( leq(X0,minus(X1,n1))
| ~ gt(X1,X0) ),
inference(definition_unfolding,[],[f194,f179]) ).
fof(f253,definition,
( spl1_1
<=> leq(pv10,minus(n135300,n1)) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f254,plain,
( ~ leq(pv10,minus(n135300,n1))
| spl1_1 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f256,definition,
( spl1_2
<=> leq(n0,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f257,plain,
( ~ leq(n0,minus(n5,n1))
| spl1_2 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f259,definition,
( spl1_3
<=> leq(n0,pv10) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f260,plain,
( ~ leq(n0,pv10)
| spl1_3 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,definition,
( spl1_4
<=> leq(n0,n0) ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f263,plain,
( ~ leq(n0,n0)
| spl1_4 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f264,plain,
( ~ spl1_1
| ~ spl1_2
| ~ spl1_3
| ~ spl1_4 ),
inference(avatar_split_clause,[],[f123,f262,f259,f256,f253]) ).
fof(f265,plain,
( $false
| spl1_1 ),
inference(resolution,[],[f121,f254]) ).
fof(f266,plain,
spl1_1,
inference(avatar_contradiction_clause,[],[f265]) ).
fof(f283,plain,
( ~ gt(n5,n0)
| spl1_2 ),
inference(resolution,[],[f220,f257]) ).
fof(f286,plain,
( $false
| spl1_2 ),
inference(resolution,[],[f283,f135]) ).
fof(f287,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f286]) ).
fof(f288,plain,
( $false
| spl1_3 ),
inference(resolution,[],[f260,f122]) ).
fof(f291,plain,
spl1_3,
inference(avatar_contradiction_clause,[],[f288]) ).
fof(f292,plain,
( $false
| spl1_4 ),
inference(resolution,[],[f263,f172]) ).
fof(f295,plain,
spl1_4,
inference(avatar_contradiction_clause,[],[f292]) ).
cnf(s1,plain,
( ~ spl1_1
| ~ spl1_2
| ~ spl1_3
| ~ spl1_4 ),
inference(sat_conversion,[],[f264]) ).
cnf(s2,plain,
spl1_1,
inference(sat_conversion,[],[f266]) ).
cnf(s3,plain,
spl1_2,
inference(sat_conversion,[],[f287]) ).
cnf(s4,plain,
spl1_3,
inference(sat_conversion,[],[f291]) ).
cnf(s5,plain,
spl1_4,
inference(sat_conversion,[],[f295]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s1,s5,s4,s3,s2]) ).
fof(f296,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 09:48:04 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.12 Running first-order theorem proving
% 0.09/0.12 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
% 2.36/0.72 % (3271592)Detected formulas, will run a generic FOF schedule.
% 2.36/0.72 % (3271602)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3701728648:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.36/0.72 % (3271598)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=3917065817:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.36/0.72 % (3271599)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=154488725:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.36/0.72 % (3271601)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=873204048:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.36/0.72 % (3271597)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=4083555900:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.36/0.72 % (3271600)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1773693625:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.36/0.72 % (3271603)dis-21_1_sil=8000:lcm=predicate:random_seed=1762097741: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.36/0.72 % (3271603)First to succeed.
% 2.36/0.72 % (3271603)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3271592"
% 2.36/0.72 % (3271601)Also succeeded, but the first one will report.
% 2.36/0.72 % (3271602)Also succeeded, but the first one will report.
% 2.36/0.72 % (3271600)Instruction limit reached!
% 2.36/0.72 % (3271600)------------------------------
% 2.36/0.72 % (3271600)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.36/0.72 % (3271600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.36/0.72 % (3271600)CaDiCaL version: 2.1.3
% 2.36/0.72 % (3271600)Termination reason: Instruction limit
% 2.36/0.72 % (3271600)Termination phase: Saturation
% 2.36/0.72 % (3271600)Time elapsed: 0.025 s
% 2.36/0.72 % (3271600)Peak memory usage: 88 MB
% 2.36/0.72 % (3271600)Instructions burned: 110 (million)
% 2.36/0.72 % (3271611)lrs+10_1_sil=8000:sp=occurrence:random_seed=2474421479:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.36/0.72 % (3271611)Also succeeded, but the first one will report.
% 2.36/0.72 % (3271603)Refutation found. Thanks to Tanya!
% 2.36/0.72 % SZS status Theorem for theBenchmark
% 2.36/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 2.36/0.72 % (3271603)------------------------------
% 2.36/0.72 % (3271603)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.36/0.72 % (3271603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.36/0.72 % (3271603)CaDiCaL version: 2.1.3
% 2.36/0.72 % (3271603)Termination reason: Refutation
% 2.36/0.72 % (3271603)Time elapsed: 0.002 s
% 2.36/0.72 % (3271603)Peak memory usage: 89 MB
% 2.36/0.72 % (3271603)Instructions burned: 4 (million)
% 2.36/0.72 % (3271603)------------------------------
% 2.36/0.72 % (3271603)------------------------------
% 2.36/0.72 % (3271592)Success in time 0.301 s
% 2.36/0.72 % Vampire exiting
%------------------------------------------------------------------------------