%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT087+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:31 PM UTC 2026
% Result : Theorem 0.14s 0.47s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 11 unt; 0 def)
% Number of atoms : 45 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 43 ( 19 ~; 15 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 28 ( 26 !; 2 ?)
% 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(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(f31,axiom,
less(v0,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v200) ).
fof(f33,axiom,
less(v200,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v600) ).
fof(f35,conjecture,
? [X0] : in_lopen(X0,v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl500) ).
fof(f36,negated_conjecture,
~ ? [X0] : in_lopen(X0,v0,v600),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& leq(X0,X2) )
=> in_lopen(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f52,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
| ~ less(X1,X0)
| ~ leq(X0,X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f53,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
| ~ less(X1,X0)
| ~ leq(X0,X2) ),
inference(flattening,[],[f52]) ).
fof(f64,plain,
! [X0] : ~ in_lopen(X0,v0,v600),
inference(ennf_transformation,[],[f36]) ).
fof(f65,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f66,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f65]) ).
fof(f72,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f78,plain,
! [X2,X0,X1] :
( in_lopen(X0,X1,X2)
| ~ less(X1,X0)
| ~ leq(X0,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f92,plain,
less(v0,v200),
inference(cnf_transformation,[],[f31]) ).
fof(f94,plain,
less(v200,v600),
inference(cnf_transformation,[],[f33]) ).
fof(f98,plain,
! [X0] : ~ in_lopen(X0,v0,v600),
inference(cnf_transformation,[],[f64]) ).
fof(f150,plain,
leq(v200,v600),
inference(resolution,[],[f72,f94]) ).
fof(f188,plain,
! [X0] :
( ~ leq(X0,v600)
| ~ less(v0,X0) ),
inference(resolution,[],[f78,f98]) ).
fof(f191,plain,
~ less(v0,v200),
inference(resolution,[],[f188,f150]) ).
fof(f192,plain,
$false,
inference(forward_subsumption_resolution,[],[f191,f92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT087+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.40 % Computer : n010.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Sun Sep 27 17:35:32 UTC 2026
% 0.10/0.41 % CPUTime :
% 0.10/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43 Running first-order model finding
% 0.10/0.43 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.14/0.47 % (1190718)Will run a generic schedule for satisfiability detection.
% 0.14/0.47 % (1190726)dis+10_1_sil=32000:sp=arity:random_seed=4154861562:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.14/0.47 % (1190726) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1190718-1190726"...
% 0.14/0.47 % (1190726)...printing done.
% 0.14/0.47 % (1190726)Refutation found. Thanks to Tanya!
% 0.14/0.47 % SZS status Theorem for theBenchmark
% 0.14/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.47 % (1190726)------------------------------
% 0.14/0.47 % (1190726)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.47 % (1190726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.48 % (1190726)CaDiCaL version: 2.1.3
% 0.14/0.48 % (1190726)Termination reason: Refutation
% 0.14/0.48 % (1190726)Time elapsed: 0.002 s
% 0.14/0.48 % (1190726)Peak memory usage: 12 MB
% 0.14/0.48 % (1190726)Instructions burned: 3 (million)
% 0.14/0.48 % (1190718)Success in time 0.036 s
% 0.14/0.48 % Vampire exiting
%------------------------------------------------------------------------------