%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT077+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 : n015.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:20 PM UTC 2026
% Result : Theorem 2.59s 1.34s
% Output : Refutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 16 unt; 2 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 95 ( 49 ~; 34 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f14,axiom,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
<=> ( less(X1,X0)
& less(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_open) ).
fof(f35,axiom,
less(v0,v200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v200) ).
fof(f36,axiom,
less(v0,v500),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v500) ).
fof(f38,axiom,
less(v100,v200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v100_v200) ).
fof(f41,axiom,
less(v200,v500),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v200_v500) ).
fof(f43,axiom,
less(v500,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v500_v800) ).
fof(f45,conjecture,
? [X0,X1] :
( less(v200,X0)
& in_open(X0,v0,v800)
& less(v100,X1)
& in_open(X1,v0,v500) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl327) ).
fof(f46,negated_conjecture,
~ ? [X0,X1] :
( less(v200,X0)
& in_open(X0,v0,v800)
& less(v100,X1)
& in_open(X1,v0,v500) ),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& less(X0,X2) )
=> in_open(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f14]) ).
fof(f65,plain,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
| ~ less(X1,X0)
| ~ less(X0,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f66,plain,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
| ~ less(X1,X0)
| ~ less(X0,X2) ),
inference(flattening,[],[f65]) ).
fof(f77,plain,
! [X0,X1] :
( ~ less(v200,X0)
| ~ in_open(X0,v0,v800)
| ~ less(v100,X1)
| ~ in_open(X1,v0,v500) ),
inference(ennf_transformation,[],[f46]) ).
fof(f94,plain,
! [X2,X0,X1] :
( in_open(X0,X1,X2)
| ~ less(X1,X0)
| ~ less(X0,X2) ),
inference(cnf_transformation,[],[f66]) ).
fof(f109,plain,
less(v0,v200),
inference(cnf_transformation,[],[f35]) ).
fof(f110,plain,
less(v0,v500),
inference(cnf_transformation,[],[f36]) ).
fof(f112,plain,
less(v100,v200),
inference(cnf_transformation,[],[f38]) ).
fof(f115,plain,
less(v200,v500),
inference(cnf_transformation,[],[f41]) ).
fof(f117,plain,
less(v500,v800),
inference(cnf_transformation,[],[f43]) ).
fof(f128,plain,
! [X0,X1] :
( ~ less(v200,X0)
| ~ in_open(X0,v0,v800)
| ~ less(v100,X1)
| ~ in_open(X1,v0,v500) ),
inference(cnf_transformation,[],[f77]) ).
fof(f138,definition,
( spl1_1
<=> ! [X1] :
( ~ less(v100,X1)
| ~ in_open(X1,v0,v500) ) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f139,plain,
( ! [X1] :
( ~ in_open(X1,v0,v500)
| ~ less(v100,X1) )
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f141,definition,
( spl1_2
<=> ! [X0] :
( ~ less(v200,X0)
| ~ in_open(X0,v0,v800) ) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f142,plain,
( ! [X0] :
( ~ in_open(X0,v0,v800)
| ~ less(v200,X0) )
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f141]) ).
fof(f143,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f128,f141,f138]) ).
fof(f216,plain,
( ! [X0] :
( ~ less(v200,X0)
| ~ less(X0,v800)
| ~ less(v0,X0) )
| ~ spl1_2 ),
inference(resolution,[],[f94,f142]) ).
fof(f217,plain,
( ~ less(v500,v800)
| ~ less(v0,v500)
| ~ spl1_2 ),
inference(resolution,[],[f216,f115]) ).
fof(f222,plain,
( ~ less(v0,v500)
| ~ spl1_2 ),
inference(forward_subsumption_resolution,[],[f217,f117]) ).
fof(f223,plain,
( $false
| ~ spl1_2 ),
inference(forward_subsumption_resolution,[],[f222,f110]) ).
fof(f224,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f223]) ).
fof(f225,plain,
( ! [X0] :
( ~ less(v100,X0)
| ~ less(v0,X0)
| ~ less(X0,v500) )
| ~ spl1_1 ),
inference(resolution,[],[f139,f94]) ).
fof(f226,plain,
( ~ less(v0,v200)
| ~ less(v200,v500)
| ~ spl1_1 ),
inference(resolution,[],[f225,f112]) ).
fof(f233,plain,
( ~ less(v200,v500)
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f226,f109]) ).
fof(f234,plain,
( $false
| ~ spl1_1 ),
inference(forward_subsumption_resolution,[],[f233,f115]) ).
fof(f235,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f234]) ).
cnf(s1,plain,
( spl1_1
| spl1_2 ),
inference(sat_conversion,[],[f143]) ).
cnf(s11,plain,
~ spl1_2,
inference(sat_conversion,[],[f224]) ).
cnf(s12,plain,
~ spl1_1,
inference(sat_conversion,[],[f235]) ).
cnf(s18,plain,
$false,
inference(rat,[],[s1,s11,s12]) ).
fof(f236,plain,
$false,
inference(avatar_sat_refutation,[],[s18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT077+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.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 17:37:16 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 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.59/1.34 % (1890098)Detected formulas, will run a generic FOF schedule.
% 2.59/1.34 % (1890144)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3936307777:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.59/1.34 % (1890144)First to succeed.
% 2.59/1.34 % (1890144)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1890098"
% 2.59/1.34 % (1890141)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=612102252:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.59/1.34 % (1890138)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=2036605685:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.59/1.34 % (1890140)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=2050607760:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.59/1.34 % (1890141)Also succeeded, but the first one will report.
% 2.59/1.34 % (1890137)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=2151434022:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.59/1.34 % (1890143)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3645564199:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.59/1.34 % (1890143)Also succeeded, but the first one will report.
% 2.59/1.34 % (1890145)dis-21_1_sil=8000:lcm=predicate:random_seed=2346607158: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.59/1.34 % (1890145)Also succeeded, but the first one will report.
% 2.59/1.34 % (1890144)Refutation found. Thanks to Tanya!
% 2.59/1.34 % SZS status Theorem for theBenchmark
% 2.59/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 2.59/1.34 % (1890144)------------------------------
% 2.59/1.34 % (1890144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.34 % (1890144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.34 % (1890144)CaDiCaL version: 2.1.3
% 2.59/1.34 % (1890144)Termination reason: Refutation
% 2.59/1.34 % (1890144)Time elapsed: 0.003 s
% 2.59/1.34 % (1890144)Peak memory usage: 90 MB
% 2.59/1.34 % (1890144)Instructions burned: 5 (million)
% 2.59/1.34 % (1890144)------------------------------
% 2.59/1.34 % (1890144)------------------------------
% 2.59/1.34 % (1890098)Success in time 0.271 s
% 2.59/1.34 % Vampire exiting
%------------------------------------------------------------------------------