%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV064+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 : n011.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.87s 1.15s
% Output : Refutation 2.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 10 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 112 ( 43 ~; 33 |; 34 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : leq(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_leq) ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0005) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(n0,pv54)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) )
& leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(n0,pv54)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) )
& leq(n0,pv10)
& leq(n0,pv53)
& leq(n0,pv54)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& leq(pv54,minus(n5,n1)) ),
inference(flattening,[],[f94]) ).
fof(f121,plain,
leq(pv54,minus(n5,n1)),
inference(cnf_transformation,[],[f95]) ).
fof(f122,plain,
leq(pv53,minus(n5,n1)),
inference(cnf_transformation,[],[f95]) ).
fof(f123,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f95]) ).
fof(f124,plain,
leq(n0,pv54),
inference(cnf_transformation,[],[f95]) ).
fof(f125,plain,
leq(n0,pv53),
inference(cnf_transformation,[],[f95]) ).
fof(f126,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f95]) ).
fof(f127,plain,
( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(n0,pv54)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f132,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f192,plain,
( ~ leq(n0,n0)
| ~ leq(n0,pv53)
| ~ leq(n0,pv54)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) ),
inference(forward_subsumption_resolution,[],[f127,f126]) ).
fof(f193,plain,
( ~ leq(n0,n0)
| ~ leq(n0,pv54)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) ),
inference(forward_subsumption_resolution,[],[f192,f125]) ).
fof(f194,plain,
( ~ leq(n0,n0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) ),
inference(forward_subsumption_resolution,[],[f193,f124]) ).
fof(f195,plain,
( ~ leq(n0,n0)
| ~ leq(pv53,minus(n5,n1))
| ~ leq(pv54,minus(n5,n1)) ),
inference(forward_subsumption_resolution,[],[f194,f123]) ).
fof(f196,plain,
( ~ leq(n0,n0)
| ~ leq(pv54,minus(n5,n1)) ),
inference(forward_subsumption_resolution,[],[f195,f122]) ).
fof(f197,plain,
~ leq(n0,n0),
inference(forward_subsumption_resolution,[],[f196,f121]) ).
fof(f198,plain,
$false,
inference(resolution,[],[f132,f197]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV064+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n011.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:48:45 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/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
% 2.87/1.15 % (3288569)Detected formulas, will run a generic FOF schedule.
% 2.87/1.15 % (3288578)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3789720670:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.87/1.15 % (3288578)First to succeed.
% 2.87/1.15 % (3288578)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3288569"
% 2.87/1.15 % (3288574)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=1961333447:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.87/1.15 % (3288579)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3271160292:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.87/1.15 % (3288575)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=1516163715:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.87/1.15 % (3288577)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1295390090:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.87/1.15 % (3288576)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=1026100425:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.87/1.15 % (3288580)dis-21_1_sil=8000:lcm=predicate:random_seed=2143649643: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.87/1.15 % (3288577)Also succeeded, but the first one will report.
% 2.87/1.15 % (3288580)Also succeeded, but the first one will report.
% 2.87/1.15 % (3288579)Also succeeded, but the first one will report.
% 2.87/1.15 % (3288578)Refutation found. Thanks to Tanya!
% 2.87/1.15 % SZS status Theorem for theBenchmark
% 2.87/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 2.87/1.15 % (3288578)------------------------------
% 2.87/1.15 % (3288578)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.87/1.15 % (3288578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.87/1.15 % (3288578)CaDiCaL version: 2.1.3
% 2.87/1.15 % (3288578)Termination reason: Refutation
% 2.87/1.15 % (3288578)Time elapsed: 0.002 s
% 2.87/1.15 % (3288578)Peak memory usage: 88 MB
% 2.87/1.15 % (3288578)Instructions burned: 2 (million)
% 2.87/1.15 % (3288578)------------------------------
% 2.87/1.15 % (3288578)------------------------------
% 2.87/1.15 % (3288569)Success in time 0.319 s
% 2.87/1.15 % Vampire exiting
%------------------------------------------------------------------------------