%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT082+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.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 18 unt; 2 def)
% Number of atoms : 111 ( 36 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 120 ( 53 ~; 23 |; 39 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 31 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
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(f10,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_closed) ).
fof(f56,axiom,
( v0 != v16
& v0 != v32
& v0 != v300
& v0 != v500
& v0 != v600
& v0 != v601
& v16 != v32
& v16 != v300
& v16 != v500
& v16 != v600
& v16 != v601
& v32 != v300
& v32 != v500
& v32 != v600
& v32 != v601
& v300 != v500
& v300 != v600
& v300 != v601
& v500 != v600
& v500 != v601
& v600 != v601 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(f57,conjecture,
~ ? [X0,X1,X2] :
( in_closed(X0,v600,v600)
& in_closed(X0,v601,v601)
& less(v300,X1)
& in_open(X1,v0,v500)
& leq(v16,X2)
& in_lopen(X2,v0,v32) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl411) ).
fof(f58,negated_conjecture,
~ ~ ? [X0,X1,X2] :
( in_closed(X0,v600,v600)
& in_closed(X0,v601,v601)
& less(v300,X1)
& in_open(X1,v0,v500)
& leq(v16,X2)
& in_lopen(X2,v0,v32) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f59,plain,
? [X0,X1,X2] :
( in_closed(X0,v600,v600)
& in_closed(X0,v601,v601)
& less(v300,X1)
& in_open(X1,v0,v500)
& leq(v16,X2)
& in_lopen(X2,v0,v32) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
=> ( leq(X1,X0)
& leq(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f72,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f73,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f72]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ( leq(X1,X0)
& leq(X0,X2) )
| ~ in_closed(X0,X1,X2) ),
inference(ennf_transformation,[],[f60]) ).
fof(f100,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f81]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f145,plain,
v600 != v601,
inference(cnf_transformation,[],[f56]) ).
fof(f170,plain,
in_closed(sK0,v601,v601),
inference(cnf_transformation,[],[f59]) ).
fof(f171,plain,
in_closed(sK0,v600,v600),
inference(cnf_transformation,[],[f59]) ).
fof(f182,plain,
! [X0,X1] :
( leq(X1,X0)
| leq(X0,X1)
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f100]) ).
fof(f187,plain,
! [X2,X0,X1] :
( in_closed(X0,X1,X2)
| ~ leq(X1,X0) ),
inference(consistent_polarity_flipping,[],[f106]) ).
fof(f188,plain,
! [X2,X0,X1] :
( in_closed(X0,X1,X2)
| ~ leq(X0,X2) ),
inference(consistent_polarity_flipping,[],[f105]) ).
fof(f191,plain,
~ in_closed(sK0,v600,v600),
inference(consistent_polarity_flipping,[],[f171]) ).
fof(f192,plain,
~ in_closed(sK0,v601,v601),
inference(consistent_polarity_flipping,[],[f170]) ).
fof(f239,plain,
~ leq(v600,sK0),
inference(resolution,[],[f187,f191]) ).
fof(f240,plain,
~ leq(v601,sK0),
inference(resolution,[],[f187,f192]) ).
fof(f241,plain,
~ leq(sK0,v600),
inference(resolution,[],[f188,f191]) ).
fof(f242,plain,
~ leq(sK0,v601),
inference(resolution,[],[f188,f192]) ).
fof(f283,definition,
( spl3_10
<=> v600 = sK0 ),
introduced(definition,[new_symbols(definition,[spl3_10])],[avatar_definition]) ).
fof(f285,plain,
( v600 = sK0
| ~ spl3_10 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f302,definition,
( spl3_14
<=> v601 = sK0 ),
introduced(definition,[new_symbols(definition,[spl3_14])],[avatar_definition]) ).
fof(f304,plain,
( v601 = sK0
| ~ spl3_14 ),
inference(avatar_component_clause,[],[f302]) ).
fof(f321,plain,
( leq(v600,sK0)
| v600 = sK0 ),
inference(resolution,[],[f182,f241]) ).
fof(f323,plain,
v600 = sK0,
inference(forward_subsumption_resolution,[],[f321,f239]) ).
fof(f325,plain,
spl3_10,
inference(avatar_split_clause,[],[f323,f283]) ).
fof(f382,plain,
( leq(v601,sK0)
| v601 = sK0 ),
inference(resolution,[],[f242,f182]) ).
fof(f389,plain,
v601 = sK0,
inference(forward_subsumption_resolution,[],[f382,f240]) ).
fof(f391,plain,
spl3_14,
inference(avatar_split_clause,[],[f389,f302]) ).
fof(f435,plain,
( v600 = v601
| ~ spl3_10
| ~ spl3_14 ),
inference(forward_demodulation,[],[f304,f285]) ).
fof(f436,plain,
( $false
| ~ spl3_10
| ~ spl3_14 ),
inference(forward_subsumption_resolution,[],[f435,f145]) ).
fof(f437,plain,
( ~ spl3_10
| ~ spl3_14 ),
inference(avatar_contradiction_clause,[],[f436]) ).
cnf(s14,plain,
spl3_10,
inference(sat_conversion,[],[f325]) ).
cnf(s17,plain,
spl3_14,
inference(sat_conversion,[],[f391]) ).
cnf(s20,plain,
( ~ spl3_10
| ~ spl3_14 ),
inference(sat_conversion,[],[f437]) ).
cnf(s21,plain,
~ spl3_10,
inference(rat,[],[s20,s17]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s14,s21]) ).
fof(f438,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 17:35:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.17/0.47 % (1485351)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (1485357)% WARNING: option uhcvi not known.
% 0.17/0.47 % (1485357)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4205841357:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47 % (1485357) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1485351-1485357"...
% 0.17/0.47 % (1485357)...printing done.
% 0.17/0.47 % (1485356)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=21612931_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47 % (1485358)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1964722371:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47 % (1485359)dis+10_1_sil=32000:sp=arity:random_seed=2111420783:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (1485360)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=188386081:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (1485357)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (1485357)------------------------------
% 0.17/0.47 % (1485357)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (1485357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (1485357)CaDiCaL version: 2.1.3
% 0.17/0.47 % (1485357)Termination reason: Refutation
% 0.17/0.47 % (1485357)Time elapsed: 0.005 s
% 0.17/0.47 % (1485357)Peak memory usage: 13 MB
% 0.17/0.47 % (1485357)Instructions burned: 9 (million)
% 0.17/0.47 % (1485351)Success in time 0.047 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------