%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 3.61s 1.52s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 17 unt; 0 def)
% Number of atoms : 103 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 92 ( 33 ~; 38 |; 17 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 52 ( 43 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexive) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_less_trans) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& leq(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_leq_trans) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( less(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_lopen) ).
fof(f37,axiom,
less(v50,v100),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v50_v100) ).
fof(f40,axiom,
less(v100,v200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v100_v200) ).
fof(f42,axiom,
less(v200,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(f44,conjecture,
~ ? [X0,X1,X2] :
( ( in_lopen(X0,v0,v200)
| in_lopen(X1,v0,v100)
| in_lopen(X2,v0,v50) )
& leq(v400,X0)
& leq(v200,X1)
& leq(v100,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl445) ).
fof(f45,negated_conjecture,
~ ~ ? [X0,X1,X2] :
( ( in_lopen(X0,v0,v200)
| in_lopen(X1,v0,v100)
| in_lopen(X2,v0,v50) )
& leq(v400,X0)
& leq(v200,X1)
& leq(v100,X2) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,plain,
? [X0,X1,X2] :
( ( in_lopen(X0,v0,v200)
| in_lopen(X1,v0,v100)
| in_lopen(X2,v0,v50) )
& leq(v400,X0)
& leq(v200,X1)
& leq(v100,X2) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( less(X1,X0)
& leq(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f50,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f51,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f53,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f52]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f60,plain,
( ( in_lopen(sK0,v0,v200)
| in_lopen(sK1,v0,v100)
| in_lopen(sK2,v0,v50) )
& leq(v400,sK0)
& leq(v200,sK1)
& leq(v100,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f46]) ).
fof(f63,plain,
leq(v100,sK2),
inference(cnf_transformation,[],[f60]) ).
fof(f64,plain,
leq(v200,sK1),
inference(cnf_transformation,[],[f60]) ).
fof(f65,plain,
leq(v400,sK0),
inference(cnf_transformation,[],[f60]) ).
fof(f66,plain,
( in_lopen(sK2,v0,v50)
| in_lopen(sK1,v0,v100)
| in_lopen(sK0,v0,v200) ),
inference(cnf_transformation,[],[f60]) ).
fof(f68,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f69,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f75,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f93,plain,
less(v50,v100),
inference(cnf_transformation,[],[f37]) ).
fof(f95,plain,
less(v100,v200),
inference(cnf_transformation,[],[f40]) ).
fof(f96,plain,
less(v200,v400),
inference(cnf_transformation,[],[f42]) ).
fof(f98,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f101,plain,
( in_lopen(sK1,v0,v100)
| leq(sK2,v50)
| in_lopen(sK0,v0,v200) ),
inference(resolution,[],[f75,f66]) ).
fof(f102,plain,
( in_lopen(sK0,v0,v200)
| leq(sK2,v50)
| leq(sK1,v100) ),
inference(resolution,[],[f101,f75]) ).
fof(f103,plain,
( leq(sK2,v50)
| leq(sK1,v100)
| leq(sK0,v200) ),
inference(resolution,[],[f102,f75]) ).
fof(f109,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ less(X0,X1) ),
inference(resolution,[],[f68,f98]) ).
fof(f157,plain,
~ less(sK2,v100),
inference(resolution,[],[f109,f63]) ).
fof(f158,plain,
~ less(sK1,v200),
inference(resolution,[],[f109,f64]) ).
fof(f159,plain,
~ less(sK0,v400),
inference(resolution,[],[f109,f65]) ).
fof(f167,plain,
! [X0] :
( ~ leq(sK2,X0)
| ~ less(X0,v100) ),
inference(resolution,[],[f157,f69]) ).
fof(f172,plain,
! [X0] :
( ~ leq(sK1,X0)
| ~ less(X0,v200) ),
inference(resolution,[],[f158,f69]) ).
fof(f177,plain,
! [X0] :
( ~ leq(sK0,X0)
| ~ less(X0,v400) ),
inference(resolution,[],[f159,f69]) ).
fof(f227,plain,
( ~ less(v50,v100)
| leq(sK1,v100)
| leq(sK0,v200) ),
inference(resolution,[],[f167,f103]) ).
fof(f231,plain,
( leq(sK1,v100)
| leq(sK0,v200) ),
inference(forward_subsumption_resolution,[],[f227,f93]) ).
fof(f284,plain,
( leq(sK0,v200)
| ~ less(v100,v200) ),
inference(resolution,[],[f231,f172]) ).
fof(f290,plain,
leq(sK0,v200),
inference(forward_subsumption_resolution,[],[f284,f95]) ).
fof(f297,plain,
~ less(v200,v400),
inference(resolution,[],[f290,f177]) ).
fof(f304,plain,
$false,
inference(forward_subsumption_resolution,[],[f297,f96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 % Computer : n008.cluster.edu
% 0.12/0.41 % Model : x86_64 x86_64
% 0.12/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.41 % Memory : 8046.5625MB
% 0.12/0.41 % OS : Linux 6.8.0-71-generic
% 0.12/0.41 % CPULimit : 300
% 0.12/0.41 % WCLimit : 300
% 0.12/0.41 % DateTime : Sun Sep 27 17:35:55 UTC 2026
% 0.12/0.42 % CPUTime :
% 0.12/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.45 Running first-order theorem proving
% 0.12/0.45 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
% 3.61/1.52 % (1486276)Detected formulas, will run a generic FOF schedule.
% 3.61/1.52 % (1486323)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=1269761593:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.61/1.52 % (1486325)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3196045473:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.61/1.52 % (1486328)dis-21_1_sil=8000:lcm=predicate:random_seed=2963935261: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.61/1.52 % (1486326)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1717006982:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.61/1.52 % (1486322)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=2895987568:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.61/1.52 % (1486321)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=1255146804:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.61/1.52 % (1486326)First to succeed.
% 3.61/1.52 % (1486325)Refutation not found, incomplete strategy
% 3.61/1.52 % (1486325)------------------------------
% 3.61/1.52 % (1486325)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.52 % (1486325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.52 % (1486325)CaDiCaL version: 2.1.3
% 3.61/1.52 % (1486325)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.52 % (1486325)Time elapsed: 0.006 s
% 3.61/1.52 % (1486325)Peak memory usage: 88 MB
% 3.61/1.52 % (1486325)Instructions burned: 6 (million)
% 3.61/1.52 % (1486326)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1486276"
% 3.61/1.52 % (1486328)Also succeeded, but the first one will report.
% 3.61/1.52 % (1486327)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2805688420:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.61/1.52 % (1486327)Also succeeded, but the first one will report.
% 3.61/1.52 % (1486325)------------------------------
% 3.61/1.52 % (1486325)------------------------------
% 3.61/1.52 % (1486326)Refutation found. Thanks to Tanya!
% 3.61/1.52 % SZS status Theorem for theBenchmark
% 3.61/1.52 % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.52 % (1486326)------------------------------
% 3.61/1.52 % (1486326)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.52 % (1486326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.52 % (1486326)CaDiCaL version: 2.1.3
% 3.61/1.52 % (1486326)Termination reason: Refutation
% 3.61/1.52 % (1486326)Time elapsed: 0.006 s
% 3.61/1.52 % (1486326)Peak memory usage: 88 MB
% 3.61/1.52 % (1486326)Instructions burned: 8 (million)
% 3.61/1.52 % (1486326)------------------------------
% 3.61/1.52 % (1486326)------------------------------
% 3.61/1.52 % (1486276)Success in time 0.418 s
% 3.61/1.52 % Vampire exiting
%------------------------------------------------------------------------------