%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 12:02:21 PM UTC 2026
% Result : Theorem 2.48s 1.10s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 19 unt; 2 def)
% Number of atoms : 95 ( 14 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 78 ( 28 ~; 21 |; 24 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 34 ( 0 sgn 25 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexive) ).
fof(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_antisym) ).
fof(f10,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_closed) ).
fof(f55,axiom,
less(v600,v601),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v601) ).
fof(f57,conjecture,
~ ? [X0,X1,X2] :
( in_closed(X0,v600,v600)
& in_closed(X0,v601,v601)
& less(v300,X1)
& in_open(X1,v0,v500)
& leq(v16,X2)
& in_lopen(X2,v0,v32) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl411) ).
fof(f58,negated_conjecture,
~ ~ ? [X0,X1,X2] :
( in_closed(X0,v600,v600)
& in_closed(X0,v601,v601)
& less(v300,X1)
& in_open(X1,v0,v500)
& leq(v16,X2)
& in_lopen(X2,v0,v32) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f59,plain,
? [X0,X1,X2] :
( in_closed(X0,v600,v600)
& in_closed(X0,v601,v601)
& less(v300,X1)
& in_open(X1,v0,v500)
& leq(v16,X2)
& in_lopen(X2,v0,v32) ),
inference(flattening,[],[f58]) ).
fof(f62,plain,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
=> ( leq(X1,X0)
& leq(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f72,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f73,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f72]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ( leq(X1,X0)
& leq(X0,X2) )
| ~ in_closed(X0,X1,X2) ),
inference(ennf_transformation,[],[f62]) ).
fof(f77,plain,
( in_closed(sK0,v600,v600)
& in_closed(sK0,v601,v601)
& less(v300,sK1)
& in_open(sK1,v0,v500)
& leq(v16,sK2)
& in_lopen(sK2,v0,v32) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f59]) ).
fof(f84,plain,
in_closed(sK0,v601,v601),
inference(cnf_transformation,[],[f77]) ).
fof(f85,plain,
in_closed(sK0,v600,v600),
inference(cnf_transformation,[],[f77]) ).
fof(f87,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f92,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f96,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f74]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f143,plain,
less(v600,v601),
inference(cnf_transformation,[],[f55]) ).
fof(f230,plain,
leq(sK0,v601),
inference(resolution,[],[f84,f96]) ).
fof(f231,plain,
leq(v601,sK0),
inference(resolution,[],[f84,f97]) ).
fof(f251,plain,
leq(sK0,v600),
inference(resolution,[],[f85,f96]) ).
fof(f252,plain,
leq(v600,sK0),
inference(resolution,[],[f85,f97]) ).
fof(f266,plain,
( ~ leq(v601,sK0)
| v601 = sK0 ),
inference(resolution,[],[f230,f92]) ).
fof(f270,plain,
v601 = sK0,
inference(forward_subsumption_resolution,[],[f266,f231]) ).
fof(f276,definition,
( spl24_10
<=> v601 = sK0 ),
introduced(definition,[new_symbols(definition,[spl24_10])],[avatar_definition]) ).
fof(f278,plain,
( v601 = sK0
| ~ spl24_10 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f280,plain,
spl24_10,
inference(avatar_split_clause,[],[f270,f276]) ).
fof(f290,plain,
( ~ leq(v600,sK0)
| v600 = sK0 ),
inference(resolution,[],[f251,f92]) ).
fof(f297,plain,
v600 = sK0,
inference(forward_subsumption_resolution,[],[f290,f252]) ).
fof(f301,definition,
( spl24_11
<=> v600 = v601 ),
introduced(definition,[new_symbols(definition,[spl24_11])],[avatar_definition]) ).
fof(f302,plain,
( v600 != v601
| spl24_11 ),
inference(avatar_component_clause,[],[f301]) ).
fof(f303,plain,
( v600 = v601
| ~ spl24_11 ),
inference(avatar_component_clause,[],[f301]) ).
fof(f384,plain,
( v600 = v601
| ~ spl24_10 ),
inference(superposition,[],[f297,f278]) ).
fof(f401,plain,
( less(v600,v600)
| ~ spl24_11 ),
inference(superposition,[],[f143,f303]) ).
fof(f412,plain,
( $false
| ~ spl24_11 ),
inference(forward_subsumption_resolution,[],[f401,f87]) ).
fof(f413,plain,
~ spl24_11,
inference(avatar_contradiction_clause,[],[f412]) ).
fof(f416,plain,
( $false
| ~ spl24_10
| spl24_11 ),
inference(forward_subsumption_resolution,[],[f384,f302]) ).
fof(f417,plain,
( ~ spl24_10
| spl24_11 ),
inference(avatar_contradiction_clause,[],[f416]) ).
cnf(s7,plain,
spl24_10,
inference(sat_conversion,[],[f280]) ).
cnf(s13,plain,
~ spl24_11,
inference(sat_conversion,[],[f413]) ).
cnf(s15,plain,
( ~ spl24_10
| spl24_11 ),
inference(sat_conversion,[],[f417]) ).
cnf(s16,plain,
~ spl24_10,
inference(rat,[],[s15,s13]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s7,s16]) ).
fof(f418,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 17:34:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/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
% 2.48/1.10 % (1049297)Detected formulas, will run a generic FOF schedule.
% 2.48/1.10 % (1049308)dis-21_1_sil=8000:lcm=predicate:random_seed=1267992513: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.48/1.10 % (1049307)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2438534007:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.48/1.10 % (1049303)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=2473173799:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.48/1.10 % (1049304)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=1385141472:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.48/1.10 % (1049305)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2500643406:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.48/1.10 % (1049302)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=1945314602:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.48/1.10 % (1049306)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1959183988:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.48/1.10 % (1049305)First to succeed.
% 2.48/1.10 % (1049306)Also succeeded, but the first one will report.
% 2.48/1.10 % (1049305)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1049297"
% 2.48/1.10 % (1049307)Also succeeded, but the first one will report.
% 2.48/1.10 % (1049308)Also succeeded, but the first one will report.
% 2.48/1.10 % (1049305)Refutation found. Thanks to Tanya!
% 2.48/1.10 % SZS status Theorem for theBenchmark
% 2.48/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 2.48/1.11 % (1049305)------------------------------
% 2.48/1.11 % (1049305)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/1.11 % (1049305)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/1.11 % (1049305)CaDiCaL version: 2.1.3
% 2.48/1.11 % (1049305)Termination reason: Refutation
% 2.48/1.11 % (1049305)Time elapsed: 0.003 s
% 2.48/1.11 % (1049305)Peak memory usage: 89 MB
% 2.48/1.11 % (1049305)Instructions burned: 6 (million)
% 2.48/1.11 % (1049305)------------------------------
% 2.48/1.11 % (1049305)------------------------------
% 2.48/1.11 % (1049297)Success in time 0.302 s
% 2.48/1.11 % Vampire exiting
%------------------------------------------------------------------------------