%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : MGT073+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:28 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 27
% Syntax : Number of formulae : 132 ( 30 unt; 0 def)
% Number of atoms : 384 ( 110 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 418 ( 166 ~; 196 |; 40 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-4 aty)
% Number of variables : 246 ( 241 !; 5 ?)
% 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(f3,axiom,
! [X0,X1] :
( less(X0,X1)
| X0 = X1
| less(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',trichotomy) ).
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
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(f7,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& less(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( less(X0,X1)
& leq(X1,X2) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f10,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_closed) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( axis_compatible(X0,X1,X2,X3)
<=> ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).
fof(f17,axiom,
is_verdict(conflict),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).
fof(f18,axiom,
is_verdict(compatible),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',compatible_is_verdict) ).
fof(f19,axiom,
is_verdict(unknown),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',unknown_is_verdict) ).
fof(f20,axiom,
conflict != compatible,
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',verdicts_distinct_cf_cp) ).
fof(f21,axiom,
conflict != unknown,
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',verdicts_distinct_cf_un) ).
fof(f22,axiom,
compatible != unknown,
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',verdicts_distinct_cp_un) ).
fof(f24,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& ( X0 = conflict
| X1 = conflict ) )
=> box_verdict(X0,X1) = conflict ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',box_conflict) ).
fof(f25,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& X0 = compatible
& X1 = compatible )
=> box_verdict(X0,X1) = compatible ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',box_compatible) ).
fof(f26,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1)
& ( X0 = unknown
| X1 = unknown )
& X0 != conflict
& X1 != conflict )
=> box_verdict(X0,X1) = unknown ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',box_unknown) ).
fof(f27,axiom,
! [X0,X1] :
( ( is_verdict(X0)
& is_verdict(X1) )
=> ( box_verdict(X0,X1) = conflict
| box_verdict(X0,X1) = compatible
| box_verdict(X0,X1) = unknown ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',box_verdict_total) ).
fof(f32,axiom,
! [X0,X1] :
( in_closed(X0,X1,X1)
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+6.ax',shape_point) ).
fof(f33,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X1,X0)
& leq(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+6.ax',shape_closed) ).
fof(f37,axiom,
less(n0,n5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order_0_5) ).
fof(f38,axiom,
less(n5,n10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order_5_10) ).
fof(f39,axiom,
axis_compatible(n0,n10,n5,n10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compatible_hyp) ).
fof(f40,conjecture,
? [X0] :
( in_closed(X0,n0,n10)
& in_closed(X0,n5,n10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_false_compatible) ).
fof(f41,negated_conjecture,
~ ? [X0] :
( in_closed(X0,n0,n10)
& in_closed(X0,n5,n10) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f42,plain,
! [X0,X1,X2,X3] :
( axis_compatible(X0,X1,X2,X3)
=> ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) ) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f43,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f44,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f46,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f48,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f49,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f51,plain,
! [X0,X1,X2] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f53,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( in_closed(X4,X0,X1)
& in_closed(X4,X2,X3) )
| ~ axis_compatible(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f42]) ).
fof(f57,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f58,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( conflict != X0
& conflict != X1 ) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( box_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| compatible != X1 ),
inference(ennf_transformation,[],[f25]) ).
fof(f60,plain,
! [X0,X1] :
( box_verdict(X0,X1) = compatible
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| compatible != X1 ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0,X1] :
( box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( unknown != X0
& unknown != X1 )
| conflict = X0
| conflict = X1 ),
inference(ennf_transformation,[],[f26]) ).
fof(f62,plain,
! [X0,X1] :
( box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| ( unknown != X0
& unknown != X1 )
| conflict = X0
| conflict = X1 ),
inference(flattening,[],[f61]) ).
fof(f63,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| box_verdict(X0,X1) = compatible
| box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f64,plain,
! [X0,X1] :
( box_verdict(X0,X1) = conflict
| box_verdict(X0,X1) = compatible
| box_verdict(X0,X1) = unknown
| ~ is_verdict(X0)
| ~ is_verdict(X1) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
! [X0] :
( ~ in_closed(X0,n0,n10)
| ~ in_closed(X0,n5,n10) ),
inference(ennf_transformation,[],[f41]) ).
fof(f66,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f67,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ) ),
inference(flattening,[],[f66]) ).
fof(f68,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,[],[f10]) ).
fof(f69,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,[],[f68]) ).
fof(f76,plain,
! [X0,X1,X2,X3] :
( ( in_closed(sK0(X0,X1,X2,X3),X0,X1)
& in_closed(sK0(X0,X1,X2,X3),X2,X3) )
| ~ axis_compatible(X0,X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X4,sK0(X0,X1,X2,X3))],[f54]) ).
fof(f77,plain,
! [X0,X1] :
( ( in_closed(X0,X1,X1)
| X0 != X1 )
& ( X0 = X1
| ~ in_closed(X0,X1,X1) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f78,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,[],[f33]) ).
fof(f79,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,[],[f78]) ).
fof(f86,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f87,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f88,plain,
! [X0,X1] :
( less(X0,X1)
| X0 = X1
| less(X1,X0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f89,plain,
! [X0,X1] :
( less(X0,X1)
| X0 = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f90,plain,
! [X0,X1] :
( leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f67]) ).
fof(f91,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f92,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| ~ leq(X1,X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f93,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f94,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ leq(X0,X1)
| ~ less(X1,X2) ),
inference(cnf_transformation,[],[f49]) ).
fof(f95,plain,
! [X2,X0,X1] :
( less(X0,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f96,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f97,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f69]) ).
fof(f98,plain,
! [X2,X0,X1] :
( leq(X1,X0)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f69]) ).
fof(f99,plain,
! [X2,X0,X1] :
( in_closed(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(cnf_transformation,[],[f69]) ).
fof(f109,plain,
! [X2,X3,X0,X1] :
( in_closed(sK0(X0,X1,X2,X3),X2,X3)
| ~ axis_compatible(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f76]) ).
fof(f110,plain,
! [X2,X3,X0,X1] :
( in_closed(sK0(X0,X1,X2,X3),X0,X1)
| ~ axis_compatible(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f76]) ).
fof(f111,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f17]) ).
fof(f112,plain,
is_verdict(compatible),
inference(cnf_transformation,[],[f18]) ).
fof(f113,plain,
is_verdict(unknown),
inference(cnf_transformation,[],[f19]) ).
fof(f114,plain,
conflict != compatible,
inference(cnf_transformation,[],[f20]) ).
fof(f115,plain,
conflict != unknown,
inference(cnf_transformation,[],[f21]) ).
fof(f116,plain,
compatible != unknown,
inference(cnf_transformation,[],[f22]) ).
fof(f118,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| conflict != X1 ),
inference(cnf_transformation,[],[f58]) ).
fof(f119,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| conflict != X0 ),
inference(cnf_transformation,[],[f58]) ).
fof(f120,plain,
! [X0,X1] :
( compatible = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| compatible != X0
| compatible != X1 ),
inference(cnf_transformation,[],[f60]) ).
fof(f121,plain,
! [X0,X1] :
( unknown = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| unknown != X1
| conflict = X0
| conflict = X1 ),
inference(cnf_transformation,[],[f62]) ).
fof(f122,plain,
! [X0,X1] :
( unknown = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1)
| unknown != X0
| conflict = X0
| conflict = X1 ),
inference(cnf_transformation,[],[f62]) ).
fof(f123,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| compatible = box_verdict(X0,X1)
| unknown = box_verdict(X0,X1)
| ~ is_verdict(X0)
| ~ is_verdict(X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f124,plain,
! [X0,X1] :
( X0 = X1
| ~ in_closed(X0,X1,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f125,plain,
! [X0,X1] :
( in_closed(X0,X1,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f77]) ).
fof(f126,plain,
! [X2,X0,X1] :
( leq(X0,X2)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f127,plain,
! [X2,X0,X1] :
( leq(X1,X0)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f128,plain,
! [X2,X0,X1] :
( in_closed(X0,X1,X2)
| ~ leq(X1,X0)
| ~ leq(X0,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f138,plain,
less(n0,n5),
inference(cnf_transformation,[],[f37]) ).
fof(f139,plain,
less(n5,n10),
inference(cnf_transformation,[],[f38]) ).
fof(f140,plain,
axis_compatible(n0,n10,n5,n10),
inference(cnf_transformation,[],[f39]) ).
fof(f141,plain,
! [X0] :
( ~ in_closed(X0,n0,n10)
| ~ in_closed(X0,n5,n10) ),
inference(cnf_transformation,[],[f65]) ).
fof(f142,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f90]) ).
fof(f143,plain,
! [X1] :
( conflict = box_verdict(conflict,X1)
| ~ is_verdict(conflict)
| ~ is_verdict(X1) ),
inference(equality_resolution,[],[f119]) ).
fof(f144,plain,
! [X0] :
( conflict = box_verdict(X0,conflict)
| ~ is_verdict(X0)
| ~ is_verdict(conflict) ),
inference(equality_resolution,[],[f118]) ).
fof(f145,plain,
! [X1] :
( compatible = box_verdict(compatible,X1)
| ~ is_verdict(compatible)
| ~ is_verdict(X1)
| compatible != X1 ),
inference(equality_resolution,[],[f120]) ).
fof(f146,plain,
( compatible = box_verdict(compatible,compatible)
| ~ is_verdict(compatible)
| ~ is_verdict(compatible) ),
inference(equality_resolution,[],[f145]) ).
fof(f147,plain,
! [X1] :
( unknown = box_verdict(unknown,X1)
| ~ is_verdict(unknown)
| ~ is_verdict(X1)
| conflict = unknown
| conflict = X1 ),
inference(equality_resolution,[],[f122]) ).
fof(f148,plain,
! [X0] :
( unknown = box_verdict(X0,unknown)
| ~ is_verdict(X0)
| ~ is_verdict(unknown)
| conflict = X0
| conflict = unknown ),
inference(equality_resolution,[],[f121]) ).
fof(f149,plain,
! [X0] : in_closed(X0,X0,X0),
inference(equality_resolution,[],[f125]) ).
fof(f150,plain,
! [X0] : less(X0,X0),
inference(consistent_polarity_flipping,[],[f86]) ).
fof(f151,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| less(X0,X2)
| less(X2,X1) ),
inference(consistent_polarity_flipping,[],[f87]) ).
fof(f152,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 = X1
| ~ less(X1,X0) ),
inference(consistent_polarity_flipping,[],[f88]) ).
fof(f153,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f91]) ).
fof(f154,plain,
! [X0] : ~ leq(X0,X0),
inference(consistent_polarity_flipping,[],[f142]) ).
fof(f155,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 = X1
| leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f89]) ).
fof(f156,plain,
! [X0,X1] :
( X0 = X1
| leq(X0,X1)
| leq(X1,X0) ),
inference(consistent_polarity_flipping,[],[f92]) ).
fof(f157,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| less(X0,X1) ),
inference(consistent_polarity_flipping,[],[f93]) ).
fof(f158,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| leq(X0,X2)
| less(X2,X1) ),
inference(consistent_polarity_flipping,[],[f94]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ less(X0,X1)
| less(X0,X2)
| leq(X2,X1) ),
inference(consistent_polarity_flipping,[],[f95]) ).
fof(f160,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| leq(X0,X2)
| leq(X2,X1) ),
inference(consistent_polarity_flipping,[],[f96]) ).
fof(f161,plain,
! [X2,X0,X1] :
( in_closed(X0,X1,X2)
| leq(X1,X0)
| leq(X0,X2) ),
inference(consistent_polarity_flipping,[],[f99]) ).
fof(f162,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| ~ in_closed(X1,X0,X2) ),
inference(consistent_polarity_flipping,[],[f98]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| ~ in_closed(X0,X2,X1) ),
inference(consistent_polarity_flipping,[],[f97]) ).
fof(f164,plain,
~ is_verdict(conflict),
inference(consistent_polarity_flipping,[],[f111]) ).
fof(f165,plain,
~ is_verdict(compatible),
inference(consistent_polarity_flipping,[],[f112]) ).
fof(f166,plain,
~ is_verdict(unknown),
inference(consistent_polarity_flipping,[],[f113]) ).
fof(f167,plain,
! [X1] :
( conflict = box_verdict(conflict,X1)
| is_verdict(conflict)
| is_verdict(X1) ),
inference(consistent_polarity_flipping,[],[f143]) ).
fof(f168,plain,
! [X0] :
( conflict = box_verdict(X0,conflict)
| is_verdict(X0)
| is_verdict(conflict) ),
inference(consistent_polarity_flipping,[],[f144]) ).
fof(f169,plain,
( compatible = box_verdict(compatible,compatible)
| is_verdict(compatible)
| is_verdict(compatible) ),
inference(consistent_polarity_flipping,[],[f146]) ).
fof(f170,plain,
! [X1] :
( unknown = box_verdict(unknown,X1)
| is_verdict(unknown)
| is_verdict(X1)
| conflict = unknown
| conflict = X1 ),
inference(consistent_polarity_flipping,[],[f147]) ).
fof(f171,plain,
! [X0] :
( unknown = box_verdict(X0,unknown)
| is_verdict(X0)
| is_verdict(unknown)
| conflict = X0
| conflict = unknown ),
inference(consistent_polarity_flipping,[],[f148]) ).
fof(f172,plain,
! [X0,X1] :
( conflict = box_verdict(X0,X1)
| compatible = box_verdict(X0,X1)
| unknown = box_verdict(X0,X1)
| is_verdict(X0)
| is_verdict(X1) ),
inference(consistent_polarity_flipping,[],[f123]) ).
fof(f173,plain,
! [X2,X0,X1] :
( in_closed(X0,X1,X2)
| leq(X1,X0)
| leq(X0,X2) ),
inference(consistent_polarity_flipping,[],[f128]) ).
fof(f174,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| ~ in_closed(X1,X0,X2) ),
inference(consistent_polarity_flipping,[],[f127]) ).
fof(f175,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| ~ in_closed(X0,X2,X1) ),
inference(consistent_polarity_flipping,[],[f126]) ).
fof(f176,plain,
~ less(n0,n5),
inference(consistent_polarity_flipping,[],[f138]) ).
fof(f177,plain,
~ less(n5,n10),
inference(consistent_polarity_flipping,[],[f139]) ).
fof(f243,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f150,f151,f152,f153,f154,f155,f156,f157,f158,f159,f160,f161,f162,f163,f110,f109,f164,f165,f166,f114,f115,f116,f167,f168,f169,f170,f171,f172,f149,f124,f173,f174,f175,f176,f177,f140,f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT073+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 17:34:25 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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.11/0.45 % (1483187)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (1483192)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1076857140_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % Detected minimum model sizes of [3]
% 0.11/0.45 % Detected maximum model sizes of [max]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % (1483192) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1483187-1483192"...
% 0.11/0.45 % (1483193)% WARNING: option uhcvi not known.
% 0.11/0.45 % (1483192)...printing done.
% 0.11/0.45 % (1483192)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (1483192)------------------------------
% 0.11/0.45 % (1483192)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (1483192)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (1483192)CaDiCaL version: 2.1.3
% 0.11/0.45 % (1483192)Termination reason: Refutation
% 0.11/0.45 % (1483192)Time elapsed: 0.004 s
% 0.11/0.45 % (1483192)Peak memory usage: 12 MB
% 0.11/0.45 % (1483192)Instructions burned: 12 (million)
% 0.11/0.45 % (1483187)Success in time 0.03 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------