%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:02:19 PM UTC 2026
% Result : Theorem 2.80s 1.30s
% Output : Refutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 23
% Syntax : Number of formulae : 118 ( 21 unt; 0 def)
% Number of atoms : 391 ( 36 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 491 ( 218 ~; 216 |; 41 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-8 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-4 aty)
% Number of variables : 264 ( 257 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexive) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitive) ).
fof(f3,axiom,
! [X0,X1] :
( less(X0,X1)
| X0 = X1
| less(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',trichotomy) ).
fof(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_antisym) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_implies_leq) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& leq(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_leq_trans) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_trans) ).
fof(f10,axiom,
! [X0,X1] :
( less(X0,X1)
=> ? [X2] :
( less(X0,X2)
& less(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dense) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_closed) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( axis_conflict(X0,X1,X2,X3)
<=> ~ ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axis_conflict_def) ).
fof(f18,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conflict_is_verdict) ).
fof(f20,axiom,
is_verdict(unknown),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown_is_verdict) ).
fof(f25,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& ( X0 = conflict
| X1 = conflict ) )
=> box_verdict(X0,X1) = conflict ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',box_conflict) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ( leq(X1,X0)
& leq(X0,X2) )
=> completion_compatible(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',completion_compat) ).
fof(f32,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/sandbox2/benchmark/theBenchmark.p',sharpness_conflict) ).
fof(f39,axiom,
! [X0,X1] :
( prec(X0,X1,c,c)
<=> less(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prec_cc) ).
fof(f42,axiom,
! [X0,X1] :
( prec(X0,X1,o,o)
<=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prec_oo) ).
fof(f43,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( disjoint(X0,X1,X2,X3,X4,X5,X6,X7)
<=> ( prec(X1,X4,X3,X6)
| prec(X5,X0,X7,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_def) ).
fof(f55,axiom,
less(n3,n5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_3_5) ).
fof(f56,axiom,
less(n5,n10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_5_10) ).
fof(f58,axiom,
! [X0] : leq(ninf,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb) ).
fof(f59,axiom,
! [X0] : leq(X0,nsup),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_sup_ub) ).
fof(f60,conjecture,
( axis_conflict(n0,n3,n10,n20)
& ? [X0] :
( less(n5,X0)
& less(X0,n10) )
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& completion_conflict(n5,n10,ninf,nsup)
& completion_compatible(n5,ninf,nsup)
& box_verdict(conflict,unknown) = conflict ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hard_chain) ).
fof(f61,negated_conjecture,
~ ( axis_conflict(n0,n3,n10,n20)
& ? [X0] :
( less(n5,X0)
& less(X0,n10) )
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& completion_conflict(n5,n10,ninf,nsup)
& completion_compatible(n5,ninf,nsup)
& box_verdict(conflict,unknown) = conflict ),
inference(negated_conjecture,[status(cth)],[f60]) ).
fof(f62,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( disjoint(X0,X1,X2,X3,X4,X5,X6,X7)
=> ( prec(X1,X4,X3,X6)
| prec(X5,X0,X7,X2) ) ),
inference(unused_predicate_definition_removal,[],[f43]) ).
fof(f64,plain,
( ~ axis_conflict(n0,n3,n10,n20)
| ! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10) )
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| conflict != box_verdict(conflict,unknown) ),
inference(ennf_transformation,[],[f61]) ).
fof(f65,plain,
! [X0,X1] :
( ? [X2] :
( less(X0,X2)
& less(X2,X1) )
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f66,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f67,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f66]) ).
fof(f68,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f69,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f71,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f70]) ).
fof(f74,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f75,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f76,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f75]) ).
fof(f83,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f84,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(flattening,[],[f83]) ).
fof(f87,plain,
! [X0,X1,X2,X3] :
( axis_conflict(X0,X1,X2,X3)
<=> ! [X4] :
( ~ in_closed(X4,X0,X1)
| ~ in_closed(X4,X2,X3) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f90,plain,
! [X0,X1,X2] :
( completion_compatible(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f91,plain,
! [X0,X1,X2] :
( completion_compatible(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(flattening,[],[f90]) ).
fof(f92,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,[],[f32]) ).
fof(f93,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,[],[f92]) ).
fof(f96,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( prec(X1,X4,X3,X6)
| prec(X5,X0,X7,X2)
| ~ disjoint(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(ennf_transformation,[],[f62]) ).
fof(f97,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( prec(X1,X4,X3,X6)
| prec(X5,X0,X7,X2)
| ~ disjoint(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(flattening,[],[f96]) ).
fof(f102,plain,
! [X0,X1] :
( ( less(X0,sK0(X0,X1))
& less(sK0(X0,X1),X1) )
| ~ less(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f65]) ).
fof(f105,plain,
! [X0,X1,X2,X3] :
( ( axis_conflict(X0,X1,X2,X3)
| ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) ) )
& ( ! [X4] :
( ~ in_closed(X4,X0,X1)
| ~ in_closed(X4,X2,X3) )
| ~ axis_conflict(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f87]) ).
fof(f106,plain,
! [X0,X1,X2,X3] :
( ( axis_conflict(X0,X1,X2,X3)
| ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) ) )
& ( ! [X5] :
( ~ in_closed(X5,X0,X1)
| ~ in_closed(X5,X2,X3) )
| ~ axis_conflict(X0,X1,X2,X3) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0,X1,X2,X3] :
( ( axis_conflict(X0,X1,X2,X3)
| ( in_closed(sK1(X0,X1,X2,X3),X0,X1)
& in_closed(sK1(X0,X1,X2,X3),X2,X3) ) )
& ( ! [X5] :
( ~ in_closed(X5,X0,X1)
| ~ in_closed(X5,X2,X3) )
| ~ axis_conflict(X0,X1,X2,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X4,sK1(X0,X1,X2,X3))],[f106]) ).
fof(f109,plain,
! [X0,X1,X2] :
( ( in_closed(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) )
& ( ( leq(X1,X0)
& leq(X0,X2) )
| ~ in_closed(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f110,plain,
! [X0,X1,X2] :
( ( in_closed(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) )
& ( ( leq(X1,X0)
& leq(X0,X2) )
| ~ in_closed(X0,X1,X2) ) ),
inference(flattening,[],[f109]) ).
fof(f111,plain,
! [X0,X1] :
( ( prec(X0,X1,o,o)
| ~ leq(X0,X1) )
& ( leq(X0,X1)
| ~ prec(X0,X1,o,o) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f114,plain,
! [X0,X1] :
( ( prec(X0,X1,c,c)
| ~ less(X0,X1) )
& ( less(X0,X1)
| ~ prec(X0,X1,c,c) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f116,plain,
less(n3,n5),
inference(cnf_transformation,[],[f55]) ).
fof(f117,plain,
less(n5,n10),
inference(cnf_transformation,[],[f56]) ).
fof(f119,plain,
! [X0] : leq(ninf,X0),
inference(cnf_transformation,[],[f58]) ).
fof(f120,plain,
! [X0] : leq(X0,nsup),
inference(cnf_transformation,[],[f59]) ).
fof(f121,plain,
! [X0] :
( conflict != box_verdict(conflict,unknown)
| ~ less(n5,X0)
| ~ less(X0,n10)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(cnf_transformation,[],[f64]) ).
fof(f122,plain,
! [X0,X1] :
( less(sK0(X0,X1),X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f123,plain,
! [X0,X1] :
( less(X0,sK0(X0,X1))
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f124,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f67]) ).
fof(f125,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f126,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f69]) ).
fof(f127,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f71]) ).
fof(f129,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f130,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f76]) ).
fof(f134,plain,
! [X0,X1] :
( less(X1,X0)
| X0 = X1
| less(X0,X1) ),
inference(cnf_transformation,[],[f3]) ).
fof(f135,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f18]) ).
fof(f137,plain,
is_verdict(unknown),
inference(cnf_transformation,[],[f20]) ).
fof(f143,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| conflict != X0 ),
inference(cnf_transformation,[],[f84]) ).
fof(f147,plain,
! [X2,X3,X0,X1] :
( in_closed(sK1(X0,X1,X2,X3),X2,X3)
| axis_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f107]) ).
fof(f148,plain,
! [X2,X3,X0,X1] :
( in_closed(sK1(X0,X1,X2,X3),X0,X1)
| axis_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f107]) ).
fof(f150,plain,
! [X2,X0,X1] :
( completion_compatible(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(cnf_transformation,[],[f91]) ).
fof(f151,plain,
! [X2,X3,X0,X1] :
( completion_conflict(X0,X1,X2,X3)
| ~ leq(X2,X0)
| ~ leq(X0,X3)
| ~ less(X0,X1)
| ~ leq(X1,X3) ),
inference(cnf_transformation,[],[f93]) ).
fof(f153,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ disjoint(X0,X1,X2,X3,X4,X5,X6,X7)
| prec(X5,X0,X7,X2)
| prec(X1,X4,X3,X6) ),
inference(cnf_transformation,[],[f97]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f110]) ).
fof(f162,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f164,plain,
! [X0,X1] :
( ~ prec(X0,X1,o,o)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f170,plain,
! [X0,X1] :
( ~ prec(X0,X1,c,c)
| less(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f177,plain,
! [X1] :
( conflict = box_verdict(conflict,X1)
| ~ is_verdict(conflict)
| ~ is_verdict(X1) ),
inference(equality_resolution,[],[f143]) ).
fof(f185,plain,
! [X0,X1] :
( ~ less(X1,X0)
| ~ less(X0,X1) ),
inference(resolution,[],[f124,f125]) ).
fof(f189,plain,
~ less(n5,n3),
inference(resolution,[],[f185,f116]) ).
fof(f190,plain,
~ less(n10,n5),
inference(resolution,[],[f185,f117]) ).
fof(f195,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ less(X0,X1) ),
inference(resolution,[],[f127,f125]) ).
fof(f199,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n3) ),
inference(resolution,[],[f189,f124]) ).
fof(f213,plain,
! [X2,X0,X1] :
( ~ leq(X2,X0)
| X0 = X1
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(resolution,[],[f130,f126]) ).
fof(f230,plain,
! [X0] : ~ less(X0,ninf),
inference(resolution,[],[f195,f119]) ).
fof(f247,plain,
! [X1] :
( conflict = box_verdict(conflict,X1)
| ~ is_verdict(X1) ),
inference(forward_subsumption_resolution,[],[f177,f135]) ).
fof(f254,plain,
! [X0] :
( conflict != conflict
| ~ less(n5,X0)
| ~ less(X0,n10)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ is_verdict(unknown) ),
inference(superposition,[],[f121,f247]) ).
fof(f255,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ is_verdict(unknown) ),
inference(trivial_inequality_removal,[],[f254]) ).
fof(f256,plain,
! [X0] :
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(X0,n10)
| ~ less(n5,X0)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(forward_subsumption_resolution,[],[f255,f137]) ).
fof(f286,plain,
~ less(n10,n3),
inference(resolution,[],[f199,f117]) ).
fof(f293,plain,
( less(n3,n10)
| n3 = n10 ),
inference(resolution,[],[f286,f134]) ).
fof(f302,plain,
! [X2,X3,X0,X1] :
( leq(X2,sK1(X0,X1,X2,X3))
| axis_conflict(X0,X1,X2,X3) ),
inference(resolution,[],[f147,f162]) ).
fof(f313,plain,
! [X2,X3,X0,X1] :
( leq(sK1(X0,X1,X2,X3),X1)
| axis_conflict(X0,X1,X2,X3) ),
inference(resolution,[],[f148,f161]) ).
fof(f392,plain,
! [X0] :
( prec(nsup,ninf,c,c)
| prec(n10,n5,o,o)
| ~ less(X0,n10)
| ~ less(n5,X0)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(resolution,[],[f153,f256]) ).
fof(f393,plain,
! [X0] :
( prec(n10,n5,o,o)
| ~ less(X0,n10)
| ~ less(n5,X0)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| less(nsup,ninf) ),
inference(resolution,[],[f392,f170]) ).
fof(f394,plain,
! [X0] :
( prec(n10,n5,o,o)
| ~ less(X0,n10)
| ~ less(n5,X0)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(forward_subsumption_resolution,[],[f393,f230]) ).
fof(f395,plain,
! [X0] :
( ~ completion_conflict(n5,n10,ninf,nsup)
| ~ less(n5,X0)
| ~ less(X0,n10)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| leq(n10,n5) ),
inference(resolution,[],[f394,f164]) ).
fof(f396,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| leq(n10,n5)
| ~ leq(ninf,n5)
| ~ leq(n5,nsup)
| ~ less(n5,n10)
| ~ leq(n10,nsup) ),
inference(resolution,[],[f395,f151]) ).
fof(f397,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| ~ completion_compatible(n5,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ leq(ninf,n5)
| ~ leq(n5,nsup)
| ~ less(n5,n10)
| ~ leq(n10,nsup) ),
inference(forward_subsumption_resolution,[],[f396,f195]) ).
fof(f398,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ leq(ninf,n5)
| ~ leq(n5,nsup)
| ~ less(n5,n10)
| ~ leq(n10,nsup) ),
inference(forward_subsumption_resolution,[],[f397,f150]) ).
fof(f399,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ leq(n5,nsup)
| ~ less(n5,n10)
| ~ leq(n10,nsup) ),
inference(forward_subsumption_resolution,[],[f398,f119]) ).
fof(f400,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ leq(n5,nsup)
| ~ less(n5,n10) ),
inference(forward_subsumption_resolution,[],[f399,f120]) ).
fof(f401,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ less(n5,n10) ),
inference(forward_subsumption_resolution,[],[f400,f120]) ).
fof(f402,plain,
! [X0] :
( ~ axis_conflict(n0,n3,n10,n20)
| ~ less(X0,n10)
| ~ less(n5,X0) ),
inference(forward_subsumption_resolution,[],[f401,f117]) ).
fof(f450,plain,
! [X2,X3,X0,X1,X4] :
( ~ leq(X4,sK1(X0,X1,X2,X3))
| X1 = X4
| axis_conflict(X0,X1,X2,X3)
| ~ leq(X1,X4) ),
inference(resolution,[],[f313,f213]) ).
fof(f1014,plain,
! [X2,X3,X0,X1] :
( X0 = X1
| axis_conflict(X2,X0,X1,X3)
| ~ leq(X0,X1)
| axis_conflict(X2,X0,X1,X3) ),
inference(resolution,[],[f450,f302]) ).
fof(f1032,plain,
! [X2,X3,X0,X1] :
( axis_conflict(X2,X0,X1,X3)
| X0 = X1
| ~ leq(X0,X1) ),
inference(duplicate_literal_removal,[],[f1014]) ).
fof(f1829,plain,
! [X0] :
( ~ leq(n3,n10)
| n3 = n10
| ~ less(X0,n10)
| ~ less(n5,X0) ),
inference(resolution,[],[f1032,f402]) ).
fof(f1834,plain,
! [X0] :
( n3 = n10
| ~ less(X0,n10)
| ~ less(n5,X0)
| ~ less(n3,n10) ),
inference(resolution,[],[f1829,f129]) ).
fof(f1835,plain,
! [X0] :
( ~ less(n5,X0)
| ~ less(X0,n10)
| n3 = n10 ),
inference(forward_subsumption_resolution,[],[f1834,f293]) ).
fof(f1854,plain,
! [X0] :
( ~ less(sK0(n5,X0),n10)
| n3 = n10
| ~ less(n5,X0) ),
inference(resolution,[],[f1835,f123]) ).
fof(f1856,plain,
( n3 = n10
| ~ less(n5,n10)
| ~ less(n5,n10) ),
inference(resolution,[],[f1854,f122]) ).
fof(f1863,plain,
( n3 = n10
| ~ less(n5,n10) ),
inference(duplicate_literal_removal,[],[f1856]) ).
fof(f1864,plain,
n3 = n10,
inference(forward_subsumption_resolution,[],[f1863,f117]) ).
fof(f1876,plain,
~ less(n3,n5),
inference(superposition,[],[f190,f1864]) ).
fof(f1910,plain,
$false,
inference(forward_subsumption_resolution,[],[f1876,f116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 17:33:02 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.30 % (1047894)Detected formulas, will run a generic FOF schedule.
% 2.80/1.30 % (1047925)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3837200939:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.80/1.30 % (1047929)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2638831595:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.80/1.30 % (1047927)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1019200893:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.80/1.30 % (1047930)dis-21_1_sil=8000:lcm=predicate:random_seed=4027334614:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.80/1.30 % (1047928)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1158381526:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.80/1.30 % (1047924)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3993956629:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.80/1.30 % (1047926)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1974524959:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.80/1.30 % (1047928)First to succeed.
% 2.80/1.30 % (1047930)Also succeeded, but the first one will report.
% 2.80/1.30 % (1047928)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1047894"
% 2.80/1.30 % (1047927)Instruction limit reached!
% 2.80/1.30 % (1047927)------------------------------
% 2.80/1.30 % (1047927)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.30 % (1047927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.30 % (1047927)CaDiCaL version: 2.1.3
% 2.80/1.30 % (1047927)Termination reason: Instruction limit
% 2.80/1.30 % (1047927)Termination phase: Saturation
% 2.80/1.30 % (1047927)Time elapsed: 0.060 s
% 2.80/1.30 % (1047927)Peak memory usage: 88 MB
% 2.80/1.30 % (1047927)Instructions burned: 109 (million)
% 2.80/1.30 % (1047929)Also succeeded, but the first one will report.
% 2.80/1.30 % (1047938)lrs+10_1_sil=8000:sp=occurrence:random_seed=1916549991:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.80/1.30 % (1047938)Also succeeded, but the first one will report.
% 2.80/1.30 % (1047928)Refutation found. Thanks to Tanya!
% 2.80/1.30 % SZS status Theorem for theBenchmark
% 2.80/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 3.75/1.49 % (1047928)------------------------------
% 3.75/1.49 % (1047928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.49 % (1047928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.49 % (1047928)CaDiCaL version: 2.1.3
% 3.75/1.49 % (1047928)Termination reason: Refutation
% 3.75/1.49 % (1047928)Time elapsed: 0.044 s
% 3.75/1.49 % (1047928)Peak memory usage: 89 MB
% 3.75/1.49 % (1047928)Instructions burned: 68 (million)
% 3.75/1.49 % (1047928)------------------------------
% 3.75/1.49 % (1047928)------------------------------
% 3.75/1.49 % (1047894)Success in time 0.451 s
% 3.75/1.49 % Vampire exiting
%------------------------------------------------------------------------------