%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV067+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 : n016.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 3.55s 1.25s
% Output : Refutation 3.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 17 unt; 4 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 150 ( 56 ~; 49 |; 33 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 19 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f53,conjecture,
( ( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) )
=> ( leq(n0,pv10)
& leq(n0,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) )
& ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0008) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) )
=> ( leq(n0,pv10)
& leq(n0,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) )
& ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f68,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
fof(f100,plain,
( ( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1))
| ( ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ~ gt(a_select3(q,pv10,pv63),pv78) )
| ( ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& gt(a_select3(q,pv10,pv63),pv78) ) )
& leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f101,plain,
( ( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1))
| ( ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ~ gt(a_select3(q,pv10,pv63),pv78) )
| ( ( ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& gt(a_select3(q,pv10,pv63),pv78) ) )
& leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) ),
inference(flattening,[],[f100]) ).
fof(f117,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f121,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f122,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f121]) ).
fof(f170,plain,
leq(pv63,minus(n5,n1)),
inference(cnf_transformation,[],[f101]) ).
fof(f171,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f101]) ).
fof(f172,plain,
leq(n1,pv63),
inference(cnf_transformation,[],[f101]) ).
fof(f173,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f101]) ).
fof(f177,plain,
( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ),
inference(cnf_transformation,[],[f101]) ).
fof(f191,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f68]) ).
fof(f222,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f229,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f122]) ).
fof(f402,plain,
( ~ leq(n0,pv10)
| ~ leq(n0,pv63)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv63,minus(n5,n1)) ),
inference(duplicate_literal_removal,[],[f177]) ).
fof(f407,definition,
( spl24_2
<=> leq(pv63,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[spl24_2])],[avatar_definition]) ).
fof(f408,plain,
( ~ leq(pv63,minus(n5,n1))
| spl24_2 ),
inference(avatar_component_clause,[],[f407]) ).
fof(f410,definition,
( spl24_3
<=> leq(pv10,minus(n135300,n1)) ),
introduced(definition,[new_symbols(definition,[spl24_3])],[avatar_definition]) ).
fof(f411,plain,
( ~ leq(pv10,minus(n135300,n1))
| spl24_3 ),
inference(avatar_component_clause,[],[f410]) ).
fof(f413,definition,
( spl24_4
<=> leq(n0,pv63) ),
introduced(definition,[new_symbols(definition,[spl24_4])],[avatar_definition]) ).
fof(f414,plain,
( ~ leq(n0,pv63)
| spl24_4 ),
inference(avatar_component_clause,[],[f413]) ).
fof(f416,definition,
( spl24_5
<=> leq(n0,pv10) ),
introduced(definition,[new_symbols(definition,[spl24_5])],[avatar_definition]) ).
fof(f417,plain,
( ~ leq(n0,pv10)
| spl24_5 ),
inference(avatar_component_clause,[],[f416]) ).
fof(f421,plain,
( ~ spl24_2
| ~ spl24_3
| ~ spl24_4
| ~ spl24_5 ),
inference(avatar_split_clause,[],[f402,f416,f413,f410,f407]) ).
fof(f422,plain,
( $false
| spl24_2 ),
inference(resolution,[],[f170,f408]) ).
fof(f423,plain,
spl24_2,
inference(avatar_contradiction_clause,[],[f422]) ).
fof(f424,plain,
( $false
| spl24_3 ),
inference(resolution,[],[f171,f411]) ).
fof(f425,plain,
spl24_3,
inference(avatar_contradiction_clause,[],[f424]) ).
fof(f427,plain,
leq(n0,n1),
inference(resolution,[],[f222,f191]) ).
fof(f502,plain,
( ! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,pv63) )
| spl24_4 ),
inference(resolution,[],[f229,f414]) ).
fof(f507,plain,
( ~ leq(n0,n1)
| spl24_4 ),
inference(resolution,[],[f502,f172]) ).
fof(f508,plain,
( $false
| spl24_4 ),
inference(resolution,[],[f507,f427]) ).
fof(f510,plain,
spl24_4,
inference(avatar_contradiction_clause,[],[f508]) ).
fof(f511,plain,
( $false
| spl24_5 ),
inference(resolution,[],[f417,f173]) ).
fof(f513,plain,
spl24_5,
inference(avatar_contradiction_clause,[],[f511]) ).
cnf(s3,plain,
( ~ spl24_2
| ~ spl24_3
| ~ spl24_4
| ~ spl24_5 ),
inference(sat_conversion,[],[f421]) ).
cnf(s4,plain,
spl24_2,
inference(sat_conversion,[],[f423]) ).
cnf(s5,plain,
spl24_3,
inference(sat_conversion,[],[f425]) ).
cnf(s6,plain,
spl24_4,
inference(sat_conversion,[],[f510]) ).
cnf(s7,plain,
spl24_5,
inference(sat_conversion,[],[f513]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s3,s7,s6,s5,s4]) ).
fof(f514,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV067+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.10/0.18 % Computer : n016.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Mon Sep 28 09:53:33 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running first-order theorem proving
% 0.10/0.21 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.55/1.25 % (3522953)Detected formulas, will run a generic FOF schedule.
% 3.55/1.25 % (3522959)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=2754361906:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.55/1.25 % (3522958)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=3763910527:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.55/1.25 % (3522962)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4211843881:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.55/1.25 % (3522961)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1628533904:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.55/1.25 % (3522963)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=166877050:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.55/1.25 % (3522964)dis-21_1_sil=8000:lcm=predicate:random_seed=2435455536: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.55/1.25 % (3522960)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=3632202985:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.55/1.25 % (3522964)First to succeed.
% 3.55/1.25 % (3522962)Also succeeded, but the first one will report.
% 3.55/1.25 % (3522964)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3522953"
% 3.55/1.25 % (3522963)Also succeeded, but the first one will report.
% 3.55/1.25 % (3522961)Instruction limit reached!
% 3.55/1.25 % (3522961)------------------------------
% 3.55/1.25 % (3522961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.25 % (3522961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.25 % (3522961)CaDiCaL version: 2.1.3
% 3.55/1.25 % (3522961)Termination reason: Instruction limit
% 3.55/1.25 % (3522961)Termination phase: Saturation
% 3.55/1.25 % (3522961)Time elapsed: 0.064 s
% 3.55/1.25 % (3522961)Peak memory usage: 88 MB
% 3.55/1.25 % (3522961)Instructions burned: 110 (million)
% 3.55/1.25 % (3522972)lrs+10_1_sil=8000:sp=occurrence:random_seed=3491130105:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.55/1.25 % (3522972)Also succeeded, but the first one will report.
% 3.55/1.25 % (3522964)Refutation found. Thanks to Tanya!
% 3.55/1.25 % SZS status Theorem for theBenchmark
% 3.55/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 3.55/1.25 % (3522964)------------------------------
% 3.55/1.25 % (3522964)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.25 % (3522964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.25 % (3522964)CaDiCaL version: 2.1.3
% 3.55/1.25 % (3522964)Termination reason: Refutation
% 3.55/1.25 % (3522964)Time elapsed: 0.007 s
% 3.55/1.25 % (3522964)Peak memory usage: 89 MB
% 3.55/1.25 % (3522964)Instructions burned: 11 (million)
% 3.55/1.25 % (3522964)------------------------------
% 3.55/1.25 % (3522964)------------------------------
% 3.55/1.25 % (3522953)Success in time 0.417 s
% 3.55/1.25 % Vampire exiting
%------------------------------------------------------------------------------