%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT075+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 : n004.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:29 PM UTC 2026
% Result : Theorem 0.08s 0.44s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 12 unt; 1 def)
% Number of atoms : 65 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 23 ~; 17 |; 8 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 31 ( 0 sgn 28 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
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)
& leq(v600,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl302) ).
fof(f33,negated_conjecture,
~ ~ ? [X0] :
( in_open(X0,v0,v600)
& leq(v600,X0) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f34,plain,
? [X0] :
( in_open(X0,v0,v600)
& leq(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(f40,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f41,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
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)
& leq(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(f69,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| ~ leq(X1,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f70,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ in_open(X0,X1,X2)
| less(X0,X2) ),
inference(cnf_transformation,[],[f49]) ).
fof(f91,plain,
leq(v600,sK0),
inference(cnf_transformation,[],[f62]) ).
fof(f92,plain,
in_open(sK0,v0,v600),
inference(cnf_transformation,[],[f62]) ).
fof(f95,plain,
less(sK0,v600),
inference(resolution,[],[f74,f92]) ).
fof(f96,plain,
leq(sK0,v600),
inference(resolution,[],[f95,f70]) ).
fof(f119,definition,
( spl1_2
<=> v600 = sK0 ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f120,plain,
( v600 != sK0
| spl1_2 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f121,plain,
( v600 = sK0
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f125,plain,
( less(v600,v600)
| ~ spl1_2 ),
inference(superposition,[],[f95,f121]) ).
fof(f129,plain,
( $false
| ~ spl1_2 ),
inference(forward_subsumption_resolution,[],[f125,f63]) ).
fof(f130,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f129]) ).
fof(f134,plain,
( v600 = sK0
| ~ leq(sK0,v600) ),
inference(resolution,[],[f69,f91]) ).
fof(f137,plain,
( ~ leq(sK0,v600)
| spl1_2 ),
inference(forward_subsumption_resolution,[],[f134,f120]) ).
fof(f150,plain,
( $false
| spl1_2 ),
inference(forward_subsumption_resolution,[],[f137,f96]) ).
fof(f151,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f150]) ).
cnf(s2,plain,
~ spl1_2,
inference(sat_conversion,[],[f130]) ).
cnf(s5,plain,
spl1_2,
inference(sat_conversion,[],[f151]) ).
cnf(s6,plain,
$false,
inference(rat,[],[s2,s5]) ).
fof(f152,plain,
$false,
inference(avatar_sat_refutation,[],[s6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT075+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.08/0.37 % Computer : n004.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Sun Sep 27 17:34:22 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.40 Running first-order model finding
% 0.08/0.40 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.08/0.44 % (3774201)Will run a generic schedule for satisfiability detection.
% 0.08/0.44 % (3774211)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3594609906:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.44 % (3774211) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3774201-3774211"...
% 0.08/0.44 % (3774211)...printing done.
% 0.08/0.44 % (3774211)Refutation found. Thanks to Tanya!
% 0.08/0.44 % SZS status Theorem for theBenchmark
% 0.08/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.44 % (3774211)------------------------------
% 0.08/0.44 % (3774211)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.44 % (3774211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.44 % (3774211)CaDiCaL version: 2.1.3
% 0.08/0.44 % (3774211)Termination reason: Refutation
% 0.08/0.44 % (3774211)Time elapsed: 0.002 s
% 0.08/0.44 % (3774211)Peak memory usage: 12 MB
% 0.08/0.44 % (3774211)Instructions burned: 3 (million)
% 0.08/0.44 % (3774201)Success in time 0.027 s
% 0.08/0.44 % Vampire exiting
%------------------------------------------------------------------------------