%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT091+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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.46s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 17 unt; 0 def)
% Number of atoms : 93 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 92 ( 44 ~; 34 |; 6 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-8 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 96 ( 94 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( axis_compatible(X0,X1,X2,X3)
<=> ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).
fof(f30,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
<=> ( axis_compatible(X0,X1,X4,X5)
& axis_compatible(X2,X3,X6,X7) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+6.ax',box2_overlap) ).
fof(f33,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+6.ax',shape_closed) ).
fof(f41,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f43,axiom,
less(v400,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v600) ).
fof(f45,axiom,
less(v600,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(f47,conjecture,
box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl624) ).
fof(f48,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(negated_conjecture,[status(cth)],[f47]) ).
fof(f49,plain,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( axis_compatible(X0,X1,X4,X5)
& axis_compatible(X2,X3,X6,X7) )
=> box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(unused_predicate_definition_removal,[],[f30]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) )
=> axis_compatible(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f60,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f65,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f66,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0,X1,X2,X3] :
( axis_compatible(X0,X1,X2,X3)
| ! [X4] :
( ~ in_closed(X4,X0,X1)
| ~ in_closed(X4,X2,X3) ) ),
inference(ennf_transformation,[],[f51]) ).
fof(f78,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
| ~ axis_compatible(X0,X1,X4,X5)
| ~ axis_compatible(X2,X3,X6,X7) ),
inference(ennf_transformation,[],[f50]) ).
fof(f79,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
| ~ axis_compatible(X0,X1,X4,X5)
| ~ axis_compatible(X2,X3,X6,X7) ),
inference(flattening,[],[f78]) ).
fof(f84,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f87,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f90,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f66]) ).
fof(f103,plain,
! [X2,X3,X0,X1,X4] :
( axis_compatible(X0,X1,X2,X3)
| ~ in_closed(X4,X0,X1)
| ~ in_closed(X4,X2,X3) ),
inference(cnf_transformation,[],[f67]) ).
fof(f117,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
| ~ axis_compatible(X0,X1,X4,X5)
| ~ axis_compatible(X2,X3,X6,X7) ),
inference(cnf_transformation,[],[f79]) ).
fof(f122,plain,
! [X2,X0,X1] :
( in_closed(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(cnf_transformation,[],[f33]) ).
fof(f132,plain,
less(v0,v400),
inference(cnf_transformation,[],[f41]) ).
fof(f134,plain,
less(v400,v600),
inference(cnf_transformation,[],[f43]) ).
fof(f136,plain,
less(v600,v800),
inference(cnf_transformation,[],[f45]) ).
fof(f143,plain,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(cnf_transformation,[],[f49]) ).
fof(f144,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f84]) ).
fof(f194,plain,
leq(v0,v400),
inference(resolution,[],[f87,f132]) ).
fof(f196,plain,
leq(v400,v600),
inference(resolution,[],[f87,f134]) ).
fof(f198,plain,
leq(v600,v800),
inference(resolution,[],[f87,f136]) ).
fof(f280,plain,
! [X0] :
( ~ leq(X0,v600)
| leq(X0,v800) ),
inference(resolution,[],[f90,f198]) ).
fof(f283,plain,
! [X0] :
( ~ leq(v400,X0)
| leq(v0,X0) ),
inference(resolution,[],[f90,f194]) ).
fof(f321,plain,
( ~ axis_compatible(v0,v600,v400,v800)
| ~ axis_compatible(v0,v600,v400,v800) ),
inference(resolution,[],[f117,f143]) ).
fof(f322,plain,
~ axis_compatible(v0,v600,v400,v800),
inference(duplicate_literal_removal,[],[f321]) ).
fof(f323,plain,
! [X0] :
( ~ in_closed(X0,v0,v600)
| ~ in_closed(X0,v400,v800) ),
inference(resolution,[],[f322,f103]) ).
fof(f330,plain,
! [X0] :
( ~ in_closed(X0,v400,v800)
| ~ leq(v0,X0)
| ~ leq(X0,v600) ),
inference(resolution,[],[f323,f122]) ).
fof(f337,plain,
! [X0] :
( ~ leq(v0,X0)
| ~ leq(X0,v600)
| ~ leq(v400,X0)
| ~ leq(X0,v800) ),
inference(resolution,[],[f330,f122]) ).
fof(f338,plain,
! [X0] :
( ~ leq(X0,v600)
| ~ leq(v400,X0)
| ~ leq(X0,v800) ),
inference(forward_subsumption_resolution,[],[f337,f283]) ).
fof(f339,plain,
! [X0] :
( ~ leq(X0,v600)
| ~ leq(v400,X0) ),
inference(forward_subsumption_resolution,[],[f338,f280]) ).
fof(f349,plain,
~ leq(v400,v400),
inference(resolution,[],[f339,f196]) ).
fof(f351,plain,
$false,
inference(forward_subsumption_resolution,[],[f349,f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT091+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 17:36:17 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.46 % (45886)Will run a generic schedule for satisfiability detection.
% 0.16/0.46 % (45896)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=512998588:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.46 % (45892)% WARNING: option uhcvi not known.
% 0.16/0.46 % (45892)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=860307316:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.46 % (45893)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=991107075:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.46 % (45891)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=272817510_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.46 % (45894)dis+10_1_sil=32000:sp=arity:random_seed=2560715998:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.46 % (45897)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=117918224:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.46 % (45895)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=485694165:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.46 % Detected minimum model sizes of [4]
% 0.16/0.46 % Detected maximum model sizes of [max]
% 0.16/0.46 % TRYING [4]
% 0.16/0.46 % (45895) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-45886-45895"...
% 0.16/0.46 % (45895)...printing done.
% 0.16/0.46 % (45895)Refutation found. Thanks to Tanya!
% 0.16/0.46 % SZS status Theorem for theBenchmark
% 0.16/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.46 % (45895)------------------------------
% 0.16/0.46 % (45895)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.46 % (45895)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.46 % (45895)CaDiCaL version: 2.1.3
% 0.16/0.46 % (45895)Termination reason: Refutation
% 0.16/0.46 % (45895)Time elapsed: 0.008 s
% 0.16/0.46 % (45895)Peak memory usage: 12 MB
% 0.16/0.46 % (45895)Instructions burned: 10 (million)
% 0.16/0.46 % (45886)Success in time 0.041 s
% 0.16/0.46 % Vampire exiting
%------------------------------------------------------------------------------