%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:48 PM UTC 2026
% Result : Theorem 0.16s 0.49s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 36
% Syntax : Number of formulae : 177 ( 42 unt; 14 def)
% Number of atoms : 426 ( 27 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 434 ( 185 ~; 191 |; 28 &)
% ( 20 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 25 ( 23 usr; 15 prp; 0-8 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-4 aty)
% Number of variables : 194 ( 0 sgn 189 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
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(f5,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& leq(X1,X0) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f10,axiom,
! [X0,X1] :
( less(X0,X1)
=> ? [X2] :
( less(X0,X2)
& less(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+1.ax',dense) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',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/sandbox/benchmark/Axioms/MGT002+2.ax',axis_conflict_def) ).
fof(f18,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
fof(f20,axiom,
is_verdict(unknown),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',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/sandbox/benchmark/Axioms/MGT002+2.ax',box_conflict) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ( leq(X1,X0)
& leq(X0,X2) )
=> completion_compatible(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',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/sandbox/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
fof(f39,axiom,
! [X0,X1] :
( prec(X0,X1,c,c)
<=> less(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+5.ax',prec_cc) ).
fof(f42,axiom,
! [X0,X1] :
( prec(X0,X1,o,o)
<=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+5.ax',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/sandbox/benchmark/Axioms/MGT002+5.ax',disjoint_def) ).
fof(f55,axiom,
less(n3,n5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_3_5) ).
fof(f56,axiom,
less(n5,n10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_5_10) ).
fof(f58,axiom,
! [X0] : leq(ninf,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_inf_lb) ).
fof(f59,axiom,
! [X0] : leq(X0,nsup),
file('/export/starexec/sandbox/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/sandbox/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(f74,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f75,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f74]) ).
fof(f76,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f77,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f79,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f80,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f79]) ).
fof(f83,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f84,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
! [X0,X1] :
( ? [X2] :
( less(X0,X2)
& less(X2,X1) )
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f86,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] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f91,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(flattening,[],[f90]) ).
fof(f98,plain,
! [X0,X1,X2] :
( completion_compatible(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f99,plain,
! [X0,X1,X2] :
( completion_compatible(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(flattening,[],[f98]) ).
fof(f104,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(f105,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,[],[f104]) ).
fof(f111,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(f112,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,[],[f111]) ).
fof(f113,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(f114,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f75]) ).
fof(f120,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f77]) ).
fof(f121,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| less(X0,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f124,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f125,plain,
! [X0,X1] :
( less(sK0(X0,X1),X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f126,plain,
! [X0,X1] :
( less(X0,sK0(X0,X1))
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f127,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f131,plain,
! [X2,X3,X0,X1] :
( axis_conflict(X0,X1,X2,X3)
| in_closed(sK1(X0,X1,X2,X3),X2,X3) ),
inference(cnf_transformation,[],[f86]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( axis_conflict(X0,X1,X2,X3)
| in_closed(sK1(X0,X1,X2,X3),X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
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 != X0
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| conflict = box_verdict(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f148,plain,
! [X2,X0,X1] :
( completion_compatible(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f151,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,[],[f105]) ).
fof(f159,plain,
! [X0,X1] :
( ~ prec(X0,X1,c,c)
| less(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f165,plain,
! [X0,X1] :
( ~ prec(X0,X1,o,o)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f166,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,[],[f112]) ).
fof(f168,plain,
less(n3,n5),
inference(cnf_transformation,[],[f55]) ).
fof(f169,plain,
less(n5,n10),
inference(cnf_transformation,[],[f56]) ).
fof(f171,plain,
! [X0] : leq(ninf,X0),
inference(cnf_transformation,[],[f58]) ).
fof(f172,plain,
! [X0] : leq(X0,nsup),
inference(cnf_transformation,[],[f59]) ).
fof(f173,plain,
! [X0] :
( conflict != box_verdict(conflict,unknown)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(X0,n10)
| ~ less(n5,X0)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(cnf_transformation,[],[f113]) ).
fof(f175,plain,
! [X1] :
( ~ is_verdict(X1)
| ~ is_verdict(conflict)
| conflict = box_verdict(conflict,X1) ),
inference(equality_resolution,[],[f143]) ).
fof(f183,definition,
( spl3_1
<=> axis_conflict(n0,n3,n10,n20) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f185,plain,
( ~ axis_conflict(n0,n3,n10,n20)
| spl3_1 ),
inference(avatar_component_clause,[],[f183]) ).
fof(f187,definition,
( spl3_2
<=> ! [X0] :
( ~ less(X0,n10)
| ~ less(n5,X0) ) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f188,plain,
( ! [X0] :
( ~ less(X0,n10)
| ~ less(n5,X0) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f187]) ).
fof(f190,definition,
( spl3_3
<=> disjoint(n5,nsup,o,c,ninf,n10,c,o) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f192,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f190]) ).
fof(f194,definition,
( spl3_4
<=> completion_conflict(n5,n10,ninf,nsup) ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f196,plain,
( ~ completion_conflict(n5,n10,ninf,nsup)
| spl3_4 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f198,definition,
( spl3_5
<=> completion_compatible(n5,ninf,nsup) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f200,plain,
( ~ completion_compatible(n5,ninf,nsup)
| spl3_5 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f202,definition,
( spl3_6
<=> conflict = box_verdict(conflict,unknown) ),
introduced(definition,[new_symbols(definition,[spl3_6])],[avatar_definition]) ).
fof(f205,plain,
( ~ spl3_1
| spl3_2
| spl3_3
| ~ spl3_4
| ~ spl3_5
| ~ spl3_6 ),
inference(avatar_split_clause,[],[f173,f202,f198,f194,f190,f187,f183]) ).
fof(f207,definition,
( spl3_7
<=> is_verdict(unknown) ),
introduced(definition,[new_symbols(definition,[spl3_7])],[avatar_definition]) ).
fof(f208,plain,
( is_verdict(unknown)
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f235,definition,
( spl3_14
<=> is_verdict(conflict) ),
introduced(definition,[new_symbols(definition,[spl3_14])],[avatar_definition]) ).
fof(f240,definition,
( spl3_15
<=> ! [X1] :
( ~ is_verdict(X1)
| conflict = box_verdict(conflict,X1) ) ),
introduced(definition,[new_symbols(definition,[spl3_15])],[avatar_definition]) ).
fof(f241,plain,
( ! [X1] :
( ~ is_verdict(X1)
| conflict = box_verdict(conflict,X1) )
| ~ spl3_15 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f242,plain,
( ~ spl3_14
| spl3_15 ),
inference(avatar_split_clause,[],[f175,f240,f235]) ).
fof(f244,plain,
spl3_7,
inference(avatar_split_clause,[],[f137,f207]) ).
fof(f246,plain,
spl3_14,
inference(avatar_split_clause,[],[f135,f235]) ).
fof(f248,plain,
leq(n3,n5),
inference(resolution,[],[f121,f168]) ).
fof(f249,plain,
leq(n5,n10),
inference(resolution,[],[f121,f169]) ).
fof(f254,plain,
( conflict = box_verdict(conflict,unknown)
| ~ spl3_7
| ~ spl3_15 ),
inference(resolution,[],[f241,f208]) ).
fof(f257,plain,
( spl3_6
| ~ spl3_7
| ~ spl3_15 ),
inference(avatar_split_clause,[],[f254,f240,f207,f202]) ).
fof(f268,plain,
! [X0] :
( less(X0,n10)
| ~ less(X0,n5) ),
inference(resolution,[],[f115,f169]) ).
fof(f343,plain,
! [X0] :
( less(X0,n5)
| ~ leq(X0,n3) ),
inference(resolution,[],[f122,f168]) ).
fof(f344,plain,
! [X0] :
( less(X0,n10)
| ~ leq(X0,n5) ),
inference(resolution,[],[f122,f169]) ).
fof(f412,plain,
~ less(n10,n5),
inference(resolution,[],[f268,f114]) ).
fof(f425,definition,
( spl3_22
<=> leq(n10,n5) ),
introduced(definition,[new_symbols(definition,[spl3_22])],[avatar_definition]) ).
fof(f426,plain,
( leq(n10,n5)
| ~ spl3_22 ),
inference(avatar_component_clause,[],[f425]) ).
fof(f427,plain,
( ~ leq(n10,n5)
| spl3_22 ),
inference(avatar_component_clause,[],[f425]) ).
fof(f443,plain,
( in_closed(sK1(n0,n3,n10,n20),n10,n20)
| spl3_1 ),
inference(resolution,[],[f131,f185]) ).
fof(f445,plain,
( leq(n10,sK1(n0,n3,n10,n20))
| spl3_1 ),
inference(resolution,[],[f443,f128]) ).
fof(f447,plain,
( in_closed(sK1(n0,n3,n10,n20),n0,n3)
| spl3_1 ),
inference(resolution,[],[f132,f185]) ).
fof(f449,plain,
( ! [X0] :
( leq(X0,sK1(n0,n3,n10,n20))
| ~ leq(X0,n10) )
| spl3_1 ),
inference(resolution,[],[f445,f124]) ).
fof(f468,plain,
( leq(sK1(n0,n3,n10,n20),n3)
| spl3_1 ),
inference(resolution,[],[f447,f127]) ).
fof(f474,plain,
( ~ leq(n3,sK1(n0,n3,n10,n20))
| n3 = sK1(n0,n3,n10,n20)
| spl3_1 ),
inference(resolution,[],[f468,f120]) ).
fof(f477,definition,
( spl3_26
<=> n3 = sK1(n0,n3,n10,n20) ),
introduced(definition,[new_symbols(definition,[spl3_26])],[avatar_definition]) ).
fof(f479,plain,
( n3 = sK1(n0,n3,n10,n20)
| ~ spl3_26 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f481,definition,
( spl3_27
<=> leq(n3,sK1(n0,n3,n10,n20)) ),
introduced(definition,[new_symbols(definition,[spl3_27])],[avatar_definition]) ).
fof(f483,plain,
( ~ leq(n3,sK1(n0,n3,n10,n20))
| spl3_27 ),
inference(avatar_component_clause,[],[f481]) ).
fof(f485,plain,
( spl3_26
| ~ spl3_27
| spl3_1 ),
inference(avatar_split_clause,[],[f474,f183,f481,f477]) ).
fof(f497,plain,
( ~ leq(n3,n10)
| spl3_1
| spl3_27 ),
inference(resolution,[],[f449,f483]) ).
fof(f499,plain,
( ! [X0] :
( ~ leq(X0,n10)
| ~ leq(n3,X0) )
| spl3_1
| spl3_27 ),
inference(resolution,[],[f497,f124]) ).
fof(f508,plain,
( ~ leq(n5,n10)
| spl3_1
| spl3_27 ),
inference(resolution,[],[f499,f248]) ).
fof(f512,plain,
( $false
| spl3_1
| spl3_27 ),
inference(forward_subsumption_resolution,[],[f508,f249]) ).
fof(f513,plain,
( spl3_1
| spl3_27 ),
inference(avatar_contradiction_clause,[],[f512]) ).
fof(f551,plain,
( leq(n10,n3)
| spl3_1
| ~ spl3_26 ),
inference(superposition,[],[f445,f479]) ).
fof(f572,plain,
~ leq(n10,n3),
inference(resolution,[],[f343,f412]) ).
fof(f573,plain,
( $false
| spl3_1
| ~ spl3_26 ),
inference(forward_subsumption_resolution,[],[f572,f551]) ).
fof(f574,plain,
( spl3_1
| ~ spl3_26 ),
inference(avatar_contradiction_clause,[],[f573]) ).
fof(f576,plain,
( ~ less(n5,n10)
| ~ leq(n5,nsup)
| ~ leq(ninf,n5)
| ~ leq(n10,nsup)
| spl3_4 ),
inference(resolution,[],[f196,f151]) ).
fof(f577,plain,
( ~ leq(n5,nsup)
| ~ leq(ninf,n5)
| ~ leq(n10,nsup)
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f576,f169]) ).
fof(f578,plain,
( ~ leq(n5,nsup)
| ~ leq(ninf,n5)
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f577,f172]) ).
fof(f579,plain,
( ~ leq(ninf,n5)
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f578,f172]) ).
fof(f580,plain,
( $false
| spl3_4 ),
inference(forward_subsumption_resolution,[],[f579,f171]) ).
fof(f581,plain,
spl3_4,
inference(avatar_contradiction_clause,[],[f580]) ).
fof(f583,plain,
( ~ leq(ninf,n5)
| ~ leq(n5,nsup)
| spl3_5 ),
inference(resolution,[],[f200,f148]) ).
fof(f584,plain,
( ~ leq(n5,nsup)
| spl3_5 ),
inference(forward_subsumption_resolution,[],[f583,f171]) ).
fof(f586,plain,
( $false
| spl3_5 ),
inference(forward_subsumption_resolution,[],[f584,f172]) ).
fof(f587,plain,
spl3_5,
inference(avatar_contradiction_clause,[],[f586]) ).
fof(f590,plain,
( prec(n10,n5,o,o)
| prec(nsup,ninf,c,c)
| ~ spl3_3 ),
inference(resolution,[],[f192,f166]) ).
fof(f592,definition,
( spl3_28
<=> prec(nsup,ninf,c,c) ),
introduced(definition,[new_symbols(definition,[spl3_28])],[avatar_definition]) ).
fof(f594,plain,
( prec(nsup,ninf,c,c)
| ~ spl3_28 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f596,definition,
( spl3_29
<=> prec(n10,n5,o,o) ),
introduced(definition,[new_symbols(definition,[spl3_29])],[avatar_definition]) ).
fof(f598,plain,
( prec(n10,n5,o,o)
| ~ spl3_29 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f599,plain,
( spl3_28
| spl3_29
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f590,f190,f596,f592]) ).
fof(f600,plain,
( leq(n10,n5)
| ~ spl3_29 ),
inference(resolution,[],[f598,f165]) ).
fof(f601,plain,
( $false
| spl3_22
| ~ spl3_29 ),
inference(forward_subsumption_resolution,[],[f600,f427]) ).
fof(f602,plain,
( spl3_22
| ~ spl3_29 ),
inference(avatar_contradiction_clause,[],[f601]) ).
fof(f607,plain,
~ leq(n10,n5),
inference(resolution,[],[f344,f114]) ).
fof(f617,plain,
( $false
| ~ spl3_22 ),
inference(forward_subsumption_resolution,[],[f607,f426]) ).
fof(f618,plain,
~ spl3_22,
inference(avatar_contradiction_clause,[],[f617]) ).
fof(f626,plain,
( less(nsup,ninf)
| ~ spl3_28 ),
inference(resolution,[],[f594,f159]) ).
fof(f629,plain,
( ! [X0] :
( less(X0,ninf)
| ~ leq(X0,nsup) )
| ~ spl3_28 ),
inference(resolution,[],[f626,f122]) ).
fof(f633,plain,
( ! [X0] : less(X0,ninf)
| ~ spl3_28 ),
inference(forward_subsumption_resolution,[],[f629,f172]) ).
fof(f660,plain,
( $false
| ~ spl3_28 ),
inference(resolution,[],[f633,f114]) ).
fof(f666,plain,
~ spl3_28,
inference(avatar_contradiction_clause,[],[f660]) ).
fof(f680,plain,
( ! [X0] :
( ~ less(n5,sK0(X0,n10))
| ~ less(X0,n10) )
| ~ spl3_2 ),
inference(resolution,[],[f188,f125]) ).
fof(f704,plain,
( ~ less(n5,n10)
| ~ less(n5,n10)
| ~ spl3_2 ),
inference(resolution,[],[f680,f126]) ).
fof(f709,plain,
( ~ less(n5,n10)
| ~ spl3_2 ),
inference(duplicate_literal_removal,[],[f704]) ).
fof(f710,plain,
( $false
| ~ spl3_2 ),
inference(forward_subsumption_resolution,[],[f709,f169]) ).
fof(f711,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f710]) ).
cnf(s1,plain,
( ~ spl3_1
| spl3_2
| spl3_3
| ~ spl3_4
| ~ spl3_5
| ~ spl3_6 ),
inference(sat_conversion,[],[f205]) ).
cnf(s6,plain,
( ~ spl3_14
| spl3_15 ),
inference(sat_conversion,[],[f242]) ).
cnf(s8,plain,
spl3_7,
inference(sat_conversion,[],[f244]) ).
cnf(s10,plain,
spl3_14,
inference(sat_conversion,[],[f246]) ).
cnf(s11,plain,
( spl3_6
| ~ spl3_7
| ~ spl3_15 ),
inference(sat_conversion,[],[f257]) ).
cnf(s22,plain,
( spl3_1
| spl3_26
| ~ spl3_27 ),
inference(sat_conversion,[],[f485]) ).
cnf(s23,plain,
( spl3_1
| spl3_27 ),
inference(sat_conversion,[],[f513]) ).
cnf(s24,plain,
( spl3_1
| ~ spl3_26 ),
inference(sat_conversion,[],[f574]) ).
cnf(s25,plain,
spl3_4,
inference(sat_conversion,[],[f581]) ).
cnf(s26,plain,
spl3_5,
inference(sat_conversion,[],[f587]) ).
cnf(s27,plain,
( ~ spl3_3
| spl3_28
| spl3_29 ),
inference(sat_conversion,[],[f599]) ).
cnf(s28,plain,
( spl3_22
| ~ spl3_29 ),
inference(sat_conversion,[],[f602]) ).
cnf(s29,plain,
~ spl3_22,
inference(sat_conversion,[],[f618]) ).
cnf(s32,plain,
~ spl3_28,
inference(sat_conversion,[],[f666]) ).
cnf(s35,plain,
~ spl3_2,
inference(sat_conversion,[],[f711]) ).
cnf(s36,plain,
~ spl3_29,
inference(rat,[],[s28,s29]) ).
cnf(s37,plain,
~ spl3_3,
inference(rat,[],[s27,s36,s32]) ).
cnf(s38,plain,
spl3_15,
inference(rat,[],[s6,s10]) ).
cnf(s39,plain,
spl3_6,
inference(rat,[],[s11,s8,s38]) ).
cnf(s44,plain,
~ spl3_1,
inference(rat,[],[s1,s39,s26,s25,s37,s35]) ).
cnf(s45,plain,
~ spl3_26,
inference(rat,[],[s24,s44]) ).
cnf(s46,plain,
spl3_27,
inference(rat,[],[s23,s44]) ).
cnf(s47,plain,
$false,
inference(rat,[],[s22,s46,s45,s44]) ).
fof(f712,plain,
$false,
inference(avatar_sat_refutation,[],[s47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n020.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 17:34:04 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.16/0.49 % (3634023)Will run a generic schedule for satisfiability detection.
% 0.16/0.49 % (3634034)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=917980370:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.49 % (3634029)% WARNING: option uhcvi not known.
% 0.16/0.49 % (3634032)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2686176252:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.49 % (3634028)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1229775123_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.49 % (3634029)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2485077834:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.49 % (3634030)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2654748524:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.49 % (3634031)dis+10_1_sil=32000:sp=arity:random_seed=1881571238:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.49 % (3634033)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=947699911:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.49 % Detected minimum model sizes of [3]
% 0.16/0.49 % Detected maximum model sizes of [max]
% 0.16/0.49 % TRYING [3]
% 0.16/0.49 % (3634032) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3634023-3634032"...
% 0.16/0.49 % TRYING [4]
% 0.16/0.49 % (3634032)...printing done.
% 0.16/0.49 % (3634032)Refutation found. Thanks to Tanya!
% 0.16/0.49 % SZS status Theorem for theBenchmark
% 0.16/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49 % (3634032)------------------------------
% 0.16/0.49 % (3634032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49 % (3634032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49 % (3634032)CaDiCaL version: 2.1.3
% 0.16/0.49 % (3634032)Termination reason: Refutation
% 0.16/0.49 % (3634032)Time elapsed: 0.018 s
% 0.16/0.49 % (3634032)Peak memory usage: 13 MB
% 0.16/0.49 % (3634032)Instructions burned: 24 (million)
% 0.16/0.49 % (3634023)Success in time 0.055 s
% 0.16/0.49 % Vampire exiting
%------------------------------------------------------------------------------