%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT084+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 : n010.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.10s 0.46s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 12 unt; 2 def)
% Number of atoms : 81 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 70 ( 25 ~; 20 |; 19 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 31 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',transitive) ).
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(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(f39,conjecture,
~ ? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& leq(v600,X0)
& in_lopen(X1,v0,v400)
& less(v400,X1)
& in_lopen(X2,v0,v200)
& leq(v200,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl432) ).
fof(f40,negated_conjecture,
~ ~ ? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& leq(v600,X0)
& in_lopen(X1,v0,v400)
& less(v400,X1)
& in_lopen(X2,v0,v200)
& leq(v200,X2) ),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f41,plain,
? [X0,X1,X2] :
( in_lopen(X0,v0,v600)
& leq(v600,X0)
& in_lopen(X1,v0,v400)
& less(v400,X1)
& in_lopen(X2,v0,v200)
& leq(v200,X2) ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( less(X1,X0)
& leq(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f47,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f48,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f47]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& leq(X0,X2) )
| ~ in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f42]) ).
fof(f69,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f72,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| less(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f4]) ).
fof(f80,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f58]) ).
fof(f109,plain,
less(v400,sK1),
inference(cnf_transformation,[],[f41]) ).
fof(f110,plain,
in_lopen(sK1,v0,v400),
inference(cnf_transformation,[],[f41]) ).
fof(f163,plain,
leq(sK1,v400),
inference(resolution,[],[f80,f110]) ).
fof(f180,plain,
! [X0] :
( less(X0,sK1)
| ~ less(X0,v400) ),
inference(resolution,[],[f70,f109]) ).
fof(f198,plain,
( less(sK1,v400)
| v400 = sK1 ),
inference(resolution,[],[f72,f163]) ).
fof(f210,definition,
( spl3_12
<=> v400 = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).
fof(f212,plain,
( v400 = sK1
| ~ spl3_12 ),
inference(avatar_component_clause,[],[f210]) ).
fof(f214,definition,
( spl3_13
<=> less(sK1,v400) ),
introduced(definition,[new_symbols(definition,[spl3_13])],[avatar_definition]) ).
fof(f216,plain,
( less(sK1,v400)
| ~ spl3_13 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f217,plain,
( spl3_12
| spl3_13 ),
inference(avatar_split_clause,[],[f198,f214,f210]) ).
fof(f326,plain,
( less(v400,v400)
| ~ spl3_12 ),
inference(superposition,[],[f109,f212]) ).
fof(f327,plain,
( $false
| ~ spl3_12 ),
inference(forward_subsumption_resolution,[],[f326,f69]) ).
fof(f328,plain,
~ spl3_12,
inference(avatar_contradiction_clause,[],[f327]) ).
fof(f352,plain,
~ less(sK1,v400),
inference(resolution,[],[f180,f69]) ).
fof(f355,plain,
( $false
| ~ spl3_13 ),
inference(forward_subsumption_resolution,[],[f352,f216]) ).
fof(f356,plain,
~ spl3_13,
inference(avatar_contradiction_clause,[],[f355]) ).
cnf(s11,plain,
( spl3_12
| spl3_13 ),
inference(sat_conversion,[],[f217]) ).
cnf(s19,plain,
~ spl3_12,
inference(sat_conversion,[],[f328]) ).
cnf(s20,plain,
~ spl3_13,
inference(sat_conversion,[],[f356]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s11,s20,s19]) ).
fof(f357,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT084+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.10/0.38 % Computer : n010.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 17:36:32 UTC 2026
% 0.10/0.38 % 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.10/0.46 % (1191131)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (1191140)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3681901095:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % (1191137)% WARNING: option uhcvi not known.
% 0.10/0.46 % (1191140) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1191131-1191140"...
% 0.10/0.46 % (1191140)...printing done.
% 0.10/0.46 % (1191140)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Theorem for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46 % (1191140)------------------------------
% 0.10/0.46 % (1191140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46 % (1191140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46 % (1191140)CaDiCaL version: 2.1.3
% 0.10/0.46 % (1191140)Termination reason: Refutation
% 0.10/0.46 % (1191140)Time elapsed: 0.004 s
% 0.10/0.46 % (1191140)Peak memory usage: 12 MB
% 0.10/0.46 % (1191140)Instructions burned: 8 (million)
% 0.10/0.46 % (1191131)Success in time 0.035 s
% 0.10/0.46 % Vampire exiting
%------------------------------------------------------------------------------