%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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 : Fri Sep 25 02:13:01 PM UTC 2026
% Result : Theorem 85.18s 13.29s
% Output : CNFRefutation 85.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 26
% Syntax : Number of formulae : 171 ( 34 unt; 0 def)
% Number of atoms : 503 ( 39 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 592 ( 260 ~; 265 |; 49 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 355 ( 0 sgn 348 !; 7 ?; 116 :)
% 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(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
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] :
( ( less(X1,X2)
& leq(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f10,axiom,
! [X0,X1] :
( less(X0,X1)
=> ? [X2] :
( less(X2,X1)
& less(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+1.ax',dense) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X0,X2)
& leq(X1,X0) ) ),
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,X2,X3)
& in_closed(X4,X0,X1) ) ),
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] :
( ( ( X1 = conflict
| X0 = conflict )
& is_verdict(X1)
& is_verdict(X0) )
=> box_verdict(X0,X1) = conflict ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',box_conflict) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ( leq(X0,X2)
& leq(X1,X0) )
=> completion_compatible(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',completion_compat) ).
fof(f30,axiom,
! [X0,X1,X2,X3] :
( ( less(X0,X1)
& leq(X1,X3)
& leq(X2,X1)
& leq(X0,X3)
& leq(X2,X0) )
=> completion_conflict(X0,X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',completion_conflict) ).
fof(f32,axiom,
! [X0,X1,X2,X3] :
( ( leq(X1,X3)
& less(X0,X1)
& leq(X0,X3)
& leq(X2,X0) )
=> 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(X5,X0,X7,X2)
| prec(X1,X4,X3,X6) ) ),
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,
( box_verdict(conflict,unknown) = conflict
& completion_compatible(n5,ninf,nsup)
& completion_conflict(n5,n10,ninf,nsup)
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& ? [X0] :
( less(X0,n10)
& less(n5,X0) )
& axis_conflict(n0,n3,n10,n20) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hard_chain) ).
fof(f61,negated_conjecture,
~ ( box_verdict(conflict,unknown) = conflict
& completion_compatible(n5,ninf,nsup)
& completion_conflict(n5,n10,ninf,nsup)
& ~ disjoint(n5,nsup,o,c,ninf,n10,c,o)
& ? [X0] :
( less(X0,n10)
& less(n5,X0) )
& axis_conflict(n0,n3,n10,n20) ),
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(X5,X0,X7,X2)
| prec(X1,X4,X3,X6) ) ),
inference(unused_predicate_definition_removal,[],[f43]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(flattening,[],[f74]) ).
fof(f78,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(flattening,[],[f79]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(flattening,[],[f81]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ? [X2] :
( less(X2,X1)
& less(X0,X2) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f86,plain,
! [X0,X1,X2,X3] :
( axis_conflict(X0,X1,X2,X3)
<=> ! [X4] :
( ~ in_closed(X4,X2,X3)
| ~ in_closed(X4,X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f90,plain,
! [X0,X1] :
( ( conflict != X1
& conflict != X0 )
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| box_verdict(X0,X1) = conflict ),
inference(ennf_transformation,[],[f25]) ).
fof(f91,plain,
! [X0,X1] :
( ( conflict != X1
& conflict != X0 )
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| box_verdict(X0,X1) = conflict ),
inference(flattening,[],[f90]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| completion_compatible(X0,X1,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| completion_compatible(X0,X1,X2) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0,X1,X2,X3] :
( ~ less(X0,X1)
| ~ leq(X1,X3)
| ~ leq(X2,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f30]) ).
fof(f101,plain,
! [X0,X1,X2,X3] :
( ~ less(X0,X1)
| ~ leq(X1,X3)
| ~ leq(X2,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(flattening,[],[f100]) ).
fof(f104,plain,
! [X0,X1,X2,X3] :
( ~ leq(X1,X3)
| ~ less(X0,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f32]) ).
fof(f105,plain,
! [X0,X1,X2,X3] :
( ~ leq(X1,X3)
| ~ less(X0,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(flattening,[],[f104]) ).
fof(f111,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ disjoint(X0,X1,X2,X3,X4,X5,X6,X7)
| prec(X5,X0,X7,X2)
| prec(X1,X4,X3,X6) ),
inference(ennf_transformation,[],[f62]) ).
fof(f112,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ disjoint(X0,X1,X2,X3,X4,X5,X6,X7)
| prec(X5,X0,X7,X2)
| prec(X1,X4,X3,X6) ),
inference(flattening,[],[f111]) ).
fof(f113,plain,
( 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)
| ! [X0] :
( ~ less(X0,n10)
| ~ less(n5,X0) )
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(ennf_transformation,[],[f61]) ).
fof(f114,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f115,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f114]) ).
fof(f116,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ( less(sK0(X0,X1),X1)
& less(X0,sK0(X0,X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f85]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ( ~ in_closed(X0,X1,X2)
| ( leq(X0,X2)
& leq(X1,X0) ) )
& ( ~ leq(X0,X2)
| ~ leq(X1,X0)
| in_closed(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f118,plain,
! [X0,X1,X2] :
( ( ~ in_closed(X0,X1,X2)
| ( leq(X0,X2)
& leq(X1,X0) ) )
& ( ~ leq(X0,X2)
| ~ leq(X1,X0)
| in_closed(X0,X1,X2) ) ),
inference(flattening,[],[f117]) ).
fof(f119,plain,
! [X0,X1,X2,X3] :
( ( ~ axis_conflict(X0,X1,X2,X3)
| ! [X4] :
( ~ in_closed(X4,X2,X3)
| ~ in_closed(X4,X0,X1) ) )
& ( ? [X4] :
( in_closed(X4,X2,X3)
& in_closed(X4,X0,X1) )
| axis_conflict(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f120,plain,
! [X0,X1,X2,X3] :
( ( ~ axis_conflict(X0,X1,X2,X3)
| ! [X5] :
( ~ in_closed(X5,X2,X3)
| ~ in_closed(X5,X0,X1) ) )
& ( ? [X4] :
( in_closed(X4,X2,X3)
& in_closed(X4,X0,X1) )
| axis_conflict(X0,X1,X2,X3) ) ),
inference(rectify,[],[f119]) ).
fof(f121,plain,
! [X0,X1,X2,X3] :
( ( ~ axis_conflict(X0,X1,X2,X3)
| ! [X5] :
( ~ in_closed(X5,X2,X3)
| ~ in_closed(X5,X0,X1) ) )
& ( ( in_closed(sK1(X0,X1,X2,X3),X2,X3)
& in_closed(sK1(X0,X1,X2,X3),X0,X1) )
| axis_conflict(X0,X1,X2,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X4,sK1(X0,X1,X2,X3))],[f120]) ).
fof(f123,plain,
! [X0,X1] :
( ( ~ prec(X0,X1,c,c)
| less(X0,X1) )
& ( ~ less(X0,X1)
| prec(X0,X1,c,c) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f126,plain,
! [X0,X1] :
( ( ~ prec(X0,X1,o,o)
| leq(X0,X1) )
& ( ~ leq(X0,X1)
| prec(X0,X1,o,o) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f127,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f75]) ).
fof(f130,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f134,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f135,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f80]) ).
fof(f136,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f82]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f138,plain,
! [X0,X1] :
( ~ less(X0,X1)
| less(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f139,plain,
! [X0,X1] :
( ~ less(X0,X1)
| less(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f116]) ).
fof(f140,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f144,plain,
! [X2,X3,X0,X1] :
( in_closed(sK1(X0,X1,X2,X3),X2,X3)
| axis_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f121]) ).
fof(f145,plain,
! [X2,X3,X0,X1] :
( in_closed(sK1(X0,X1,X2,X3),X0,X1)
| axis_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f121]) ).
fof(f148,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f18]) ).
fof(f150,plain,
is_verdict(unknown),
inference(cnf_transformation,[],[f20]) ).
fof(f156,plain,
! [X0,X1] :
( conflict != X0
| ~ is_verdict(X1)
| ~ is_verdict(X0)
| conflict = box_verdict(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| completion_compatible(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f162,plain,
! [X2,X3,X0,X1] :
( ~ less(X0,X1)
| ~ leq(X1,X3)
| ~ leq(X2,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f101]) ).
fof(f164,plain,
! [X2,X3,X0,X1] :
( ~ leq(X1,X3)
| ~ less(X0,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f105]) ).
fof(f171,plain,
! [X0,X1] :
( ~ prec(X0,X1,c,c)
| less(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f177,plain,
! [X0,X1] :
( ~ prec(X0,X1,o,o)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
fof(f179,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(f181,plain,
less(n3,n5),
inference(cnf_transformation,[],[f55]) ).
fof(f182,plain,
less(n5,n10),
inference(cnf_transformation,[],[f56]) ).
fof(f184,plain,
! [X0] : leq(ninf,X0),
inference(cnf_transformation,[],[f58]) ).
fof(f185,plain,
! [X0] : leq(X0,nsup),
inference(cnf_transformation,[],[f59]) ).
fof(f186,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(f188,plain,
! [X1] :
( ~ is_verdict(X1)
| ~ is_verdict(conflict)
| conflict = box_verdict(conflict,X1) ),
inference(equality_resolution,[],[f156]) ).
tcf(c_49,plain,
! [X0: $i] : ~ less(X0,X0),
inference(cnf_transformation,[],[f127]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| ( X0 = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X2,X1)
| ~ leq(X2,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X0,X2)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f137]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( less(X0,sK0(X0,X1))
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( less(sK0(X0,X1),X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X1,X0)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( axis_conflict(X0,X1,X2,X3)
| in_closed(sK1(X0,X1,X2,X3),X0,X1) ),
inference(cnf_transformation,[],[f145]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( axis_conflict(X0,X1,X2,X3)
| in_closed(sK1(X0,X1,X2,X3),X2,X3) ),
inference(cnf_transformation,[],[f144]) ).
tcf(c_70,plain,
is_verdict(conflict),
inference(cnf_transformation,[],[f148]) ).
tcf(c_72,plain,
is_verdict(unknown),
inference(cnf_transformation,[],[f150]) ).
tcf(c_77,plain,
! [X0: $i] :
( ( box_verdict(conflict,X0) = conflict )
| ~ is_verdict(conflict)
| ~ is_verdict(X0) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i] :
( completion_compatible(X0,X2,X1)
| ~ leq(X2,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f161]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X1)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ leq(X0,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f162]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ leq(X0,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| ~ prec(X0,X1,c,c) ),
inference(cnf_transformation,[],[f171]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ prec(X0,X1,o,o) ),
inference(cnf_transformation,[],[f177]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( prec(X5,X0,X7,X2)
| prec(X1,X4,X3,X6)
| ~ disjoint(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(cnf_transformation,[],[f179]) ).
tcf(c_103,plain,
less(n3,n5),
inference(cnf_transformation,[],[f181]) ).
tcf(c_104,plain,
less(n5,n10),
inference(cnf_transformation,[],[f182]) ).
tcf(c_106,plain,
! [X0: $i] : leq(ninf,X0),
inference(cnf_transformation,[],[f184]) ).
tcf(c_107,plain,
! [X0: $i] : leq(X0,nsup),
inference(cnf_transformation,[],[f185]) ).
tcf(c_108,negated_conjecture,
! [X0: $i] :
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(n5,X0)
| ~ less(X0,n10)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| ( box_verdict(conflict,unknown) != conflict ) ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_136,plain,
! [X0: $i] :
( ( box_verdict(conflict,X0) = conflict )
| ~ is_verdict(X0) ),
inference(global_subsumption_just,[status(thm)],[c_77,c_70,c_77]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_86,c_56,c_59,c_86]) ).
tcf(c_148,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2)
| ~ leq(X3,X0) ),
inference(global_subsumption_just,[status(thm)],[c_84,c_146]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(renaming,[status(thm)],[c_148]) ).
tcf(c_178,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_181,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( less(X0,X2)
| ~ less(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_221,plain,
( less(n5,sK0(n5,n10))
| ~ less(n5,n10) ),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_225,plain,
( less(sK0(n5,n10),n10)
| ~ less(n5,n10) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_310,plain,
( completion_compatible(n5,ninf,nsup)
| ~ leq(ninf,n5)
| ~ leq(n5,nsup) ),
inference(instantiation,[status(thm)],[c_83]) ).
tcf(c_313,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| ~ less(n3,n5)
| ( X1 != n5 )
| ( X0 != n3 ) ),
inference(instantiation,[status(thm)],[c_181]) ).
tcf(c_393,plain,
leq(ninf,n5),
inference(instantiation,[status(thm)],[c_106]) ).
tcf(c_490,plain,
! [X0: $i] :
( less(X0,sK0(n5,n10))
| ~ leq(X0,n5)
| ~ less(n5,sK0(n5,n10)) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_558,plain,
! [X0: $i] :
( less(sK0(n5,n10),X0)
| ~ leq(n10,X0)
| ~ less(sK0(n5,n10),n10) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_985,plain,
! [X0: $i] :
( leq(X0,n5)
| ~ prec(X0,n5,o,o) ),
inference(instantiation,[status(thm)],[c_100]) ).
tcf(c_988,plain,
! [X0: $i] :
( leq(X0,n5)
| ~ less(X0,n5) ),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_1033,plain,
! [X0: $i] :
( less(X0,n5)
| ~ less(X0,n3) ),
inference(resolution,[status(thm)],[c_50,c_103]) ).
tcf(c_1035,plain,
! [X0: $i] :
( less(X0,n10)
| ~ less(X0,n5) ),
inference(resolution,[status(thm)],[c_50,c_104]) ).
tcf(c_1086,plain,
leq(n5,nsup),
inference(instantiation,[status(thm)],[c_107]) ).
tcf(c_1109,plain,
leq(n10,nsup),
inference(instantiation,[status(thm)],[c_107]) ).
tcf(c_1243,plain,
~ less(n10,n5),
inference(resolution,[status(thm)],[c_1035,c_49]) ).
tcf(c_1269,plain,
~ less(n10,n3),
inference(resolution,[status(thm)],[c_1243,c_1033]) ).
tcf(c_1270,plain,
box_verdict(conflict,unknown) = conflict,
inference(superposition,[status(thm)],[c_72,c_136]) ).
tcf(c_1271,plain,
! [X0: $i] :
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(n5,X0)
| ~ less(X0,n10)
| ~ completion_compatible(n5,ninf,nsup)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(backward_subsumption_resolution,[status(thm)],[c_108,c_1270]) ).
tcf(c_1273,plain,
! [X0: $i] :
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(n5,X0)
| ~ less(X0,n10)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_conflict(n5,n10,ninf,nsup) ),
inference(global_subsumption_just,[status(thm)],[c_1271,c_108,c_310,c_393,c_1086,c_1270]) ).
tcf(c_1274,plain,
! [X0: $i] :
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(n5,X0)
| ~ less(X0,n10)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(renaming,[status(thm)],[c_1273]) ).
tcf(c_1290,plain,
! [X0: $i] :
( less(X0,n3)
| ( X0 = n3 )
| ~ leq(X0,n3) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_1318,plain,
! [X0: $i] :
( less(X0,n5)
| ~ less(n3,n5)
| ( n5 != n5 )
| ( X0 != n3 ) ),
inference(instantiation,[status(thm)],[c_313]) ).
tcf(c_1319,plain,
n5 = n5,
inference(instantiation,[status(thm)],[c_178]) ).
tcf(c_1343,plain,
! [X0: $i,X1: $i] :
( less(X1,X0)
| ~ less(nsup,X0) ),
inference(resolution,[status(thm)],[c_57,c_107]) ).
tcf(c_2298,plain,
! [X0: $i,X1: $i] :
( less(X1,sK0(nsup,X0))
| ~ less(nsup,X0) ),
inference(resolution,[status(thm)],[c_1343,c_60]) ).
tcf(c_2651,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( axis_conflict(X0,X1,X2,X3)
| leq(sK1(X0,X1,X2,X3),X1) ),
inference(resolution,[status(thm)],[c_65,c_64]) ).
tcf(c_2673,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( axis_conflict(X1,X2,X0,X3)
| leq(X0,sK1(X1,X2,X0,X3)) ),
inference(resolution,[status(thm)],[c_66,c_63]) ).
tcf(c_3470,plain,
( less(sK0(n5,n10),sK0(n5,n10))
| ~ leq(sK0(n5,n10),n5)
| ~ less(n5,sK0(n5,n10)) ),
inference(instantiation,[status(thm)],[c_490]) ).
tcf(c_3471,plain,
~ less(sK0(n5,n10),sK0(n5,n10)),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_3733,plain,
( less(sK0(n5,n10),n5)
| ~ leq(n10,n5)
| ~ less(sK0(n5,n10),n10) ),
inference(instantiation,[status(thm)],[c_558]) ).
tcf(c_3749,plain,
( leq(sK0(n5,n10),n5)
| ~ less(sK0(n5,n10),n5) ),
inference(instantiation,[status(thm)],[c_988]) ).
tcf(c_4452,plain,
! [X0: $i] : ~ less(nsup,X0),
inference(resolution,[status(thm)],[c_2298,c_49]) ).
tcf(c_5595,plain,
( leq(n10,n5)
| ~ prec(n10,n5,o,o) ),
inference(instantiation,[status(thm)],[c_985]) ).
tcf(c_6860,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( leq(X0,X2)
| axis_conflict(X1,X2,X3,X4)
| ~ leq(X0,sK1(X1,X2,X3,X4)) ),
inference(resolution,[status(thm)],[c_2651,c_59]) ).
tcf(c_7723,plain,
( less(n10,n5)
| ~ less(n3,n5)
| ( n10 != n3 )
| ( n5 != n5 ) ),
inference(instantiation,[status(thm)],[c_1318]) ).
tcf(c_9238,plain,
! [X0: $i] :
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(n5,X0)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ less(sK0(n5,X0),n10) ),
inference(superposition,[status(thm)],[c_60,c_1274]) ).
tcf(c_11162,plain,
( less(n10,n3)
| ( n10 = n3 )
| ~ leq(n10,n3) ),
inference(instantiation,[status(thm)],[c_1290]) ).
tcf(c_29809,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ less(n5,n10)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(superposition,[status(thm)],[c_61,c_9238]) ).
tcf(c_29822,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_conflict(n5,n10,ninf,nsup) ),
inference(global_subsumption_just,[status(thm)],[c_29809,c_104,c_29809]) ).
tcf(c_29823,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(renaming,[status(thm)],[c_29822]) ).
tcf(c_30084,plain,
( prec(nsup,ninf,c,c)
| prec(n10,n5,o,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(superposition,[status(thm)],[c_29823,c_101]) ).
tcf(c_108546,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leq(X2,X1)
| axis_conflict(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[c_6860,c_2673]) ).
tcf(c_109900,plain,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_conflict(n5,n10,ninf,nsup) ),
inference(global_subsumption_just,[status(thm)],[c_108,c_104,c_29809]) ).
tcf(c_109901,negated_conjecture,
( disjoint(n5,nsup,o,c,ninf,n10,c,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(renaming,[status(thm)],[c_109900]) ).
tcf(c_115561,plain,
( prec(nsup,ninf,c,c)
| prec(n10,n5,o,o)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(resolution,[status(thm)],[c_101,c_109901]) ).
tcf(c_115893,plain,
( prec(nsup,ninf,c,c)
| ~ axis_conflict(n0,n3,n10,n20)
| ~ completion_conflict(n5,n10,ninf,nsup) ),
inference(global_subsumption_just,[status(thm)],[c_115561,c_104,c_221,c_225,c_3470,c_3471,c_3733,c_3749,c_5595,c_30084]) ).
tcf(c_115894,plain,
( prec(nsup,ninf,c,c)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(renaming,[status(thm)],[c_115893]) ).
tcf(c_116117,plain,
( less(nsup,ninf)
| ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(resolution,[status(thm)],[c_115894,c_94]) ).
tcf(c_116609,plain,
( ~ completion_conflict(n5,n10,ninf,nsup)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(forward_subsumption_resolution,[status(thm)],[c_116117,c_4452]) ).
tcf(c_117045,plain,
( ~ leq(ninf,n5)
| ~ leq(n10,nsup)
| ~ less(n5,n10)
| ~ axis_conflict(n0,n3,n10,n20) ),
inference(resolution,[status(thm)],[c_116609,c_149]) ).
tcf(c_117234,plain,
~ axis_conflict(n0,n3,n10,n20),
inference(global_subsumption_just,[status(thm)],[c_117045,c_104,c_393,c_1109,c_117045]) ).
tcf(c_117249,plain,
leq(n10,n3),
inference(resolution,[status(thm)],[c_117234,c_108546]) ).
tcf(c_117250,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_117249,c_11162,c_7723,c_1319,c_1269,c_1243,c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT068+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 01:16:52 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.40
% 0.14/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.40
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 85.18/13.29 % SZS status Started for theBenchmark.p
% 85.18/13.29 % SZS status Theorem for theBenchmark.p
% 85.18/13.29
% 85.18/13.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 85.18/13.29
% 85.18/13.29 % ------ iProver source info
% 85.18/13.29
% 85.18/13.29 % git: date: 2026-07-19 20:42:38 +0200
% 85.18/13.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 85.18/13.29 % git: non_committed_changes: false
% 85.18/13.29
% 85.18/13.29 % ------ Parsing...
% 85.18/13.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 85.18/13.29
% 85.18/13.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 1 0s sf_e %
% 85.18/13.29
% 85.18/13.29 % ------ Preprocessing...%
% 85.18/13.29
% 85.18/13.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 85.18/13.29 % ------ Proving...
% 85.18/13.29 % ------ Problem Properties
% 85.18/13.29
% 85.18/13.29 %
% 85.18/13.29 % clauses 58
% 85.18/13.29 % conjectures 1
% 85.18/13.29 % EPR 45
% 85.18/13.29 % Horn 47
% 85.18/13.29 % unary 18
% 85.18/13.29 % binary 19
% 85.18/13.29 % lits 128
% 85.18/13.29 % lits eq 23
% 85.18/13.29 % fd_pure 0
% 85.18/13.29 % fd_pseudo 0
% 85.18/13.29 % fd_cond 4
% 85.18/13.29 % fd_pseudo_cond 3
% 85.18/13.29 % AC symbols 0
% 85.18/13.29
% 85.18/13.29 % ------ Input Options Time Limit: Unbounded
% 85.18/13.29
% 85.18/13.29
% 85.18/13.29 % ------
% 85.18/13.29 % Current options:
% 85.18/13.29 % ------
% 85.18/13.29
% 85.18/13.29
% 85.18/13.29 %
% 85.18/13.29
% 85.18/13.29 % ------ Proving...
% 85.18/13.29 %
% 85.18/13.29
% 85.18/13.29 % SZS status Theorem for theBenchmark.p
% 85.18/13.29
% 85.18/13.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 85.18/13.29
% 85.18/13.29
%------------------------------------------------------------------------------