%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:04:31 PM UTC 2026
% Result : Theorem 0.16s 0.50s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 94 ( 32 unt; 7 def)
% Number of atoms : 204 ( 22 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 189 ( 79 ~; 70 |; 27 &)
% ( 8 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 64 ( 0 sgn 55 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& leq(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( less(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(f37,axiom,
less(v50,v100),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v50_v100) ).
fof(f40,axiom,
less(v100,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v100_v200) ).
fof(f42,axiom,
less(v200,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(f43,axiom,
( v0 != v50
& v0 != v100
& v0 != v200
& v0 != v400
& v50 != v100
& v50 != v200
& v50 != v400
& v100 != v200
& v100 != v400
& v200 != v400 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
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/sandbox/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(f55,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f56,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f60,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f61,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f63,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f47]) ).
fof(f77,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(f78,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f84,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| ~ leq(X1,X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f85,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| leq(X0,X2)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f63]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f108,plain,
less(v50,v100),
inference(cnf_transformation,[],[f37]) ).
fof(f111,plain,
less(v100,v200),
inference(cnf_transformation,[],[f40]) ).
fof(f113,plain,
less(v200,v400),
inference(cnf_transformation,[],[f42]) ).
fof(f119,plain,
v50 != v100,
inference(cnf_transformation,[],[f43]) ).
fof(f124,plain,
leq(v100,sK2),
inference(cnf_transformation,[],[f77]) ).
fof(f125,plain,
leq(v200,sK1),
inference(cnf_transformation,[],[f77]) ).
fof(f126,plain,
leq(v400,sK0),
inference(cnf_transformation,[],[f77]) ).
fof(f127,plain,
( in_lopen(sK0,v0,v200)
| in_lopen(sK1,v0,v100)
| in_lopen(sK2,v0,v50) ),
inference(cnf_transformation,[],[f77]) ).
fof(f129,definition,
( spl3_1
<=> in_lopen(sK2,v0,v50) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f131,plain,
( in_lopen(sK2,v0,v50)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f129]) ).
fof(f133,definition,
( spl3_2
<=> in_lopen(sK1,v0,v100) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f135,plain,
( in_lopen(sK1,v0,v100)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f133]) ).
fof(f137,definition,
( spl3_3
<=> in_lopen(sK0,v0,v200) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f139,plain,
( in_lopen(sK0,v0,v200)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f137]) ).
fof(f140,plain,
( spl3_1
| spl3_2
| spl3_3 ),
inference(avatar_split_clause,[],[f127,f137,f133,f129]) ).
fof(f146,plain,
leq(v50,v100),
inference(resolution,[],[f85,f108]) ).
fof(f152,plain,
( leq(sK1,v100)
| ~ spl3_2 ),
inference(resolution,[],[f89,f135]) ).
fof(f187,definition,
( spl3_5
<=> v100 = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f189,plain,
( v100 = sK1
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f226,plain,
( v100 = sK1
| ~ leq(v100,sK1)
| ~ spl3_2 ),
inference(resolution,[],[f84,f152]) ).
fof(f228,definition,
( spl3_12
<=> leq(v100,sK1) ),
introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).
fof(f230,plain,
( ~ leq(v100,sK1)
| spl3_12 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f231,plain,
( ~ spl3_12
| spl3_5
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f226,f133,f187,f228]) ).
fof(f272,plain,
! [X0] :
( ~ less(X0,v200)
| less(X0,sK1) ),
inference(resolution,[],[f87,f125]) ).
fof(f273,plain,
! [X0] :
( ~ less(X0,v400)
| less(X0,sK0) ),
inference(resolution,[],[f87,f126]) ).
fof(f278,plain,
! [X0] :
( ~ leq(sK2,X0)
| leq(v100,X0) ),
inference(resolution,[],[f88,f124]) ).
fof(f325,plain,
less(v100,sK1),
inference(resolution,[],[f272,f111]) ).
fof(f333,plain,
less(v200,sK0),
inference(resolution,[],[f273,f113]) ).
fof(f338,plain,
leq(v100,sK1),
inference(resolution,[],[f325,f85]) ).
fof(f339,plain,
( $false
| spl3_12 ),
inference(forward_subsumption_resolution,[],[f338,f230]) ).
fof(f340,plain,
spl3_12,
inference(avatar_contradiction_clause,[],[f339]) ).
fof(f349,plain,
( leq(sK0,v200)
| ~ spl3_3 ),
inference(resolution,[],[f139,f89]) ).
fof(f353,plain,
( v200 = sK0
| ~ leq(v200,sK0)
| ~ spl3_3 ),
inference(resolution,[],[f349,f84]) ).
fof(f360,definition,
( spl3_19
<=> v200 = sK0 ),
introduced(definition,[new_symbols(definition,[spl3_19])],[avatar_definition]) ).
fof(f362,plain,
( v200 = sK0
| ~ spl3_19 ),
inference(avatar_component_clause,[],[f360]) ).
fof(f365,definition,
( spl3_20
<=> leq(v200,sK0) ),
introduced(definition,[new_symbols(definition,[spl3_20])],[avatar_definition]) ).
fof(f367,plain,
( ~ leq(v200,sK0)
| spl3_20 ),
inference(avatar_component_clause,[],[f365]) ).
fof(f368,plain,
( ~ spl3_20
| spl3_19
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f353,f137,f360,f365]) ).
fof(f379,plain,
( less(v100,v100)
| ~ spl3_5 ),
inference(superposition,[],[f325,f189]) ).
fof(f380,plain,
( $false
| ~ spl3_5 ),
inference(forward_subsumption_resolution,[],[f379,f78]) ).
fof(f381,plain,
~ spl3_5,
inference(avatar_contradiction_clause,[],[f380]) ).
fof(f416,plain,
( v50 = v100
| ~ leq(v100,v50) ),
inference(resolution,[],[f146,f84]) ).
fof(f418,plain,
~ leq(v100,v50),
inference(forward_subsumption_resolution,[],[f416,f119]) ).
fof(f436,plain,
leq(v200,sK0),
inference(resolution,[],[f333,f85]) ).
fof(f437,plain,
( $false
| spl3_20 ),
inference(forward_subsumption_resolution,[],[f436,f367]) ).
fof(f438,plain,
spl3_20,
inference(avatar_contradiction_clause,[],[f437]) ).
fof(f465,plain,
( less(v200,v200)
| ~ spl3_19 ),
inference(superposition,[],[f333,f362]) ).
fof(f470,plain,
( $false
| ~ spl3_19 ),
inference(forward_subsumption_resolution,[],[f465,f78]) ).
fof(f471,plain,
~ spl3_19,
inference(avatar_contradiction_clause,[],[f470]) ).
fof(f475,plain,
( leq(sK2,v50)
| ~ spl3_1 ),
inference(resolution,[],[f131,f89]) ).
fof(f476,plain,
( leq(v100,v50)
| ~ spl3_1 ),
inference(resolution,[],[f475,f278]) ).
fof(f492,plain,
( $false
| ~ spl3_1 ),
inference(forward_subsumption_resolution,[],[f476,f418]) ).
fof(f493,plain,
~ spl3_1,
inference(avatar_contradiction_clause,[],[f492]) ).
cnf(s1,plain,
( spl3_1
| spl3_2
| spl3_3 ),
inference(sat_conversion,[],[f140]) ).
cnf(s6,plain,
( ~ spl3_2
| spl3_5
| ~ spl3_12 ),
inference(sat_conversion,[],[f231]) ).
cnf(s11,plain,
spl3_12,
inference(sat_conversion,[],[f340]) ).
cnf(s14,plain,
( ~ spl3_3
| spl3_19
| ~ spl3_20 ),
inference(sat_conversion,[],[f368]) ).
cnf(s15,plain,
~ spl3_5,
inference(sat_conversion,[],[f381]) ).
cnf(s18,plain,
spl3_20,
inference(sat_conversion,[],[f438]) ).
cnf(s20,plain,
~ spl3_19,
inference(sat_conversion,[],[f471]) ).
cnf(s23,plain,
~ spl3_1,
inference(sat_conversion,[],[f493]) ).
cnf(s25,plain,
~ spl3_3,
inference(rat,[],[s14,s18,s20]) ).
cnf(s28,plain,
~ spl3_2,
inference(rat,[],[s6,s11,s15]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s1,s25,s28,s23]) ).
fof(f495,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 % Computer : n014.cluster.edu
% 0.11/0.42 % Model : x86_64 x86_64
% 0.11/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.42 % Memory : 8046.5625MB
% 0.11/0.42 % OS : Linux 6.8.0-71-generic
% 0.11/0.42 % CPULimit : 300
% 0.11/0.42 % WCLimit : 300
% 0.11/0.42 % DateTime : Sun Sep 27 17:35:02 UTC 2026
% 0.11/0.42 % CPUTime :
% 0.11/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.45 Running first-order model finding
% 0.11/0.45 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.50 % (1049707)Will run a generic schedule for satisfiability detection.
% 0.16/0.50 % (1049717)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3830591117:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.50 % (1049713)% WARNING: option uhcvi not known.
% 0.16/0.50 % (1049717) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1049707-1049717"...
% 0.16/0.50 % (1049717)...printing done.
% 0.16/0.50 % (1049717)Refutation found. Thanks to Tanya!
% 0.16/0.50 % SZS status Theorem for theBenchmark
% 0.16/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.50 % (1049717)------------------------------
% 0.16/0.50 % (1049717)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.50 % (1049717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.50 % (1049717)CaDiCaL version: 2.1.3
% 0.16/0.50 % (1049717)Termination reason: Refutation
% 0.16/0.50 % (1049717)Time elapsed: 0.005 s
% 0.16/0.50 % (1049717)Peak memory usage: 12 MB
% 0.16/0.50 % (1049717)Instructions burned: 11 (million)
% 0.16/0.50 % (1049707)Success in time 0.034 s
% 0.16/0.50 % Vampire exiting
%------------------------------------------------------------------------------