%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT078+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 : 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:04:30 PM UTC 2026
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 96 ( 29 equ)
% Maximal formula atoms : 21 ( 3 avg)
% Number of connectives : 107 ( 43 ~; 19 |; 40 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 49 ( 40 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
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(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(f54,axiom,
less(v600,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v1200) ).
fof(f56,axiom,
( v0 != v8
& v0 != v32
& v0 != v200
& v0 != v600
& v0 != v800
& v0 != v1200
& v8 != v32
& v8 != v200
& v8 != v600
& v8 != v800
& v8 != v1200
& v32 != v200
& v32 != v600
& v32 != v800
& v32 != v1200
& v200 != v600
& v200 != v800
& v200 != v1200
& v600 != v800
& v600 != v1200
& v800 != v1200 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(f57,conjecture,
~ ? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& leq(v1200,X0)
& in_lopen(X1,v0,v800)
& leq(v200,X1)
& in_lopen(X2,v0,v32)
& leq(v8,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl341) ).
fof(f58,negated_conjecture,
~ ~ ? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& leq(v1200,X0)
& in_lopen(X1,v0,v800)
& leq(v200,X1)
& in_lopen(X2,v0,v32)
& leq(v8,X2) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f59,plain,
? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& leq(v1200,X0)
& in_lopen(X1,v0,v800)
& leq(v200,X1)
& in_lopen(X2,v0,v32)
& leq(v8,X2) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( less(X1,X0)
& leq(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f70,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f71,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f70]) ).
fof(f77,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f78,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f60]) ).
fof(f95,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f96,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| ~ leq(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f71]) ).
fof(f100,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f78]) ).
fof(f101,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f135,plain,
less(v600,v1200),
inference(cnf_transformation,[],[f54]) ).
fof(f138,plain,
v600 != v1200,
inference(cnf_transformation,[],[f56]) ).
fof(f162,plain,
leq(v1200,sK0),
inference(cnf_transformation,[],[f59]) ).
fof(f163,plain,
in_lopen(sK0,v0,v600),
inference(cnf_transformation,[],[f59]) ).
fof(f172,plain,
! [X2,X0,X1] :
( in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(consistent_polarity_flipping,[],[f101]) ).
fof(f173,plain,
~ in_lopen(sK0,v0,v600),
inference(consistent_polarity_flipping,[],[f163]) ).
fof(f237,plain,
leq(v600,v1200),
inference(resolution,[],[f95,f135]) ).
fof(f242,plain,
leq(sK0,v600),
inference(resolution,[],[f172,f173]) ).
fof(f362,plain,
! [X0] :
( ~ leq(sK0,X0)
| leq(v1200,X0) ),
inference(resolution,[],[f100,f162]) ).
fof(f614,plain,
leq(v1200,v600),
inference(resolution,[],[f362,f242]) ).
fof(f636,plain,
( ~ leq(v600,v1200)
| v600 = v1200 ),
inference(resolution,[],[f614,f96]) ).
fof(f639,plain,
v600 = v1200,
inference(forward_subsumption_resolution,[],[f636,f237]) ).
fof(f640,plain,
$false,
inference(forward_subsumption_resolution,[],[f639,f138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT078+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.13/0.40 % Computer : n008.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 17:35:09 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.45 Running first-order model finding
% 0.13/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.21/0.50 % (1484179)Will run a generic schedule for satisfiability detection.
% 0.21/0.50 % (1484185)% WARNING: option uhcvi not known.
% 0.21/0.50 % (1484185)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=726290023:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.50 % (1484185) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1484179-1484185"...
% 0.21/0.50 % (1484185)...printing done.
% 0.21/0.50 % (1484185)Refutation found. Thanks to Tanya!
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50 % (1484185)------------------------------
% 0.21/0.50 % (1484185)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.50 % (1484185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.50 % (1484185)CaDiCaL version: 2.1.3
% 0.21/0.50 % (1484185)Termination reason: Refutation
% 0.21/0.50 % (1484185)Time elapsed: 0.008 s
% 0.21/0.50 % (1484185)Peak memory usage: 12 MB
% 0.21/0.50 % (1484185)Instructions burned: 13 (million)
% 0.21/0.50 % (1484179)Success in time 0.032 s
% 0.21/0.50 % Vampire exiting
%------------------------------------------------------------------------------