%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT092+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 : n009.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:32 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 70 ( 35 ~; 28 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 36 ( 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f13,axiom,
! [X0,X1,X2,X3] :
( ( leq(X2,X0)
& leq(X0,X3)
& less(X0,X1)
& leq(X1,X3) )
=> completion_conflict(X0,X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
fof(f38,axiom,
less(v0,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f39,axiom,
less(v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(f40,axiom,
less(v800,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v800_v1200) ).
fof(f42,conjecture,
completion_conflict(v400,v800,v0,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl633) ).
fof(f43,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f44,plain,
~ completion_conflict(v400,v800,v0,v1200),
inference(flattening,[],[f43]) ).
fof(f52,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f53,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f52]) ).
fof(f56,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f65,plain,
! [X0,X1,X2,X3] :
( completion_conflict(X0,X1,X2,X3)
| ~ leq(X2,X0)
| ~ leq(X0,X3)
| ~ less(X0,X1)
| ~ leq(X1,X3) ),
inference(ennf_transformation,[],[f13]) ).
fof(f66,plain,
! [X0,X1,X2,X3] :
( completion_conflict(X0,X1,X2,X3)
| ~ leq(X2,X0)
| ~ leq(X0,X3)
| ~ less(X0,X1)
| ~ leq(X1,X3) ),
inference(flattening,[],[f65]) ).
fof(f83,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f89,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f94,plain,
! [X2,X3,X0,X1] :
( completion_conflict(X0,X1,X2,X3)
| ~ less(X0,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| ~ leq(X1,X3) ),
inference(cnf_transformation,[],[f66]) ).
fof(f118,plain,
less(v0,v400),
inference(cnf_transformation,[],[f38]) ).
fof(f119,plain,
less(v400,v800),
inference(cnf_transformation,[],[f39]) ).
fof(f120,plain,
less(v800,v1200),
inference(cnf_transformation,[],[f40]) ).
fof(f127,plain,
~ completion_conflict(v400,v800,v0,v1200),
inference(cnf_transformation,[],[f44]) ).
fof(f177,plain,
leq(v0,v400),
inference(resolution,[],[f89,f118]) ).
fof(f179,plain,
leq(v800,v1200),
inference(resolution,[],[f89,f120]) ).
fof(f189,plain,
! [X0] :
( less(X0,v1200)
| ~ less(X0,v800) ),
inference(resolution,[],[f83,f120]) ).
fof(f290,plain,
! [X0] :
( ~ less(X0,v800)
| leq(X0,v1200) ),
inference(resolution,[],[f189,f89]) ).
fof(f320,plain,
( ~ less(v400,v800)
| ~ leq(v400,v1200)
| ~ leq(v0,v400)
| ~ leq(v800,v1200) ),
inference(resolution,[],[f94,f127]) ).
fof(f321,plain,
( ~ less(v400,v800)
| ~ leq(v0,v400)
| ~ leq(v800,v1200) ),
inference(forward_subsumption_resolution,[],[f320,f290]) ).
fof(f322,plain,
( ~ leq(v0,v400)
| ~ leq(v800,v1200) ),
inference(forward_subsumption_resolution,[],[f321,f119]) ).
fof(f323,plain,
~ leq(v800,v1200),
inference(forward_subsumption_resolution,[],[f322,f177]) ).
fof(f324,plain,
$false,
inference(forward_subsumption_resolution,[],[f323,f179]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT092+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.38 % Computer : n009.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:31 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 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.45 % (2274413)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (2274422)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3251490124:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (2274419)% WARNING: option uhcvi not known.
% 0.10/0.45 % (2274422) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2274413-2274422"...
% 0.10/0.45 % (2274422)...printing done.
% 0.10/0.45 % (2274422)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 % (2274422)------------------------------
% 0.10/0.45 % (2274422)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (2274422)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (2274422)CaDiCaL version: 2.1.3
% 0.10/0.45 % (2274422)Termination reason: Refutation
% 0.10/0.45 % (2274422)Time elapsed: 0.004 s
% 0.10/0.45 % (2274422)Peak memory usage: 12 MB
% 0.10/0.45 % (2274422)Instructions burned: 9 (million)
% 0.10/0.45 % (2274413)Success in time 0.029 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------