%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT083+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 : n001.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.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 9 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 20 ~; 12 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 37 ( 34 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(f13,axiom,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
<=> ( less(X1,X0)
& less(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_open) ).
fof(f32,conjecture,
~ ? [X0] :
( in_open(X0,v0,v600)
& less(v600,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl423) ).
fof(f33,negated_conjecture,
~ ~ ? [X0] :
( in_open(X0,v0,v600)
& less(v600,X0) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f34,plain,
? [X0] :
( in_open(X0,v0,v600)
& less(v600,X0) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
=> ( less(X1,X0)
& less(X0,X2) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f38,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f39,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f38]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( less(X1,X0)
& less(X0,X2) )
| ~ in_open(X0,X1,X2) ),
inference(ennf_transformation,[],[f35]) ).
fof(f62,plain,
( in_open(sK0,v0,v600)
& less(v600,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f34]) ).
fof(f63,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f64,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f39]) ).
fof(f74,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ in_open(X0,X1,X2) ),
inference(cnf_transformation,[],[f49]) ).
fof(f91,plain,
less(v600,sK0),
inference(cnf_transformation,[],[f62]) ).
fof(f92,plain,
in_open(sK0,v0,v600),
inference(cnf_transformation,[],[f62]) ).
fof(f100,plain,
! [X0] : less(X0,X0),
inference(consistent_polarity_flipping,[],[f63]) ).
fof(f101,plain,
! [X2,X0,X1] :
( less(X1,X2)
| less(X0,X1)
| ~ less(X0,X2) ),
inference(consistent_polarity_flipping,[],[f64]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ in_open(X0,X1,X2)
| ~ less(X0,X2) ),
inference(consistent_polarity_flipping,[],[f74]) ).
fof(f114,plain,
~ less(v600,sK0),
inference(consistent_polarity_flipping,[],[f91]) ).
fof(f158,plain,
~ less(sK0,v600),
inference(resolution,[],[f112,f92]) ).
fof(f165,plain,
! [X0] :
( less(X0,v600)
| ~ less(X0,sK0) ),
inference(resolution,[],[f101,f114]) ).
fof(f170,plain,
~ less(sK0,sK0),
inference(resolution,[],[f165,f158]) ).
fof(f171,plain,
$false,
inference(resolution,[],[f170,f100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT083+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.10/0.37 % Computer : n001.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:40:46 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/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.10/0.45 % (3829160)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (3829171)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3337906183:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (3829171) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3829160-3829171"...
% 0.10/0.45 % (3829166)% WARNING: option uhcvi not known.
% 0.10/0.45 % (3829171)...printing done.
% 0.10/0.45 % (3829171)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Theorem for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (3829171)------------------------------
% 0.10/0.45 % (3829171)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (3829171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (3829171)CaDiCaL version: 2.1.3
% 0.10/0.45 % (3829171)Termination reason: Refutation
% 0.10/0.45 % (3829171)Time elapsed: 0.002 s
% 0.10/0.45 % (3829171)Peak memory usage: 12 MB
% 0.10/0.45 % (3829171)Instructions burned: 3 (million)
% 0.10/0.45 % (3829160)Success in time 0.034 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------