%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT091+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.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:04 PM UTC 2026
% Result : Theorem 3.08s 6.30s
% Output : CNFRefutation 3.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 21 unt; 0 def)
% Number of atoms : 152 ( 18 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 175 ( 83 ~; 70 |; 14 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-8 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 141 ( 0 sgn 139 !; 2 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f15,axiom,
! [X0,X1,X2,X3] :
( axis_compatible(X0,X1,X2,X3)
<=> ? [X4] :
( in_closed(X4,X2,X3)
& in_closed(X4,X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',axis_compatible_def) ).
fof(f30,axiom,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7)
<=> ( axis_compatible(X2,X3,X6,X7)
& axis_compatible(X0,X1,X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+6.ax',box2_overlap) ).
fof(f33,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X0,X2)
& leq(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+6.ax',shape_closed) ).
fof(f41,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f43,axiom,
less(v400,v600),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v600) ).
fof(f44,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(f47,conjecture,
box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl624) ).
fof(f48,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(negated_conjecture,[status(cth)],[f47]) ).
fof(f49,plain,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ( axis_compatible(X2,X3,X6,X7)
& axis_compatible(X0,X1,X4,X5) )
=> box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(unused_predicate_definition_removal,[],[f30]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( in_closed(X4,X2,X3)
& in_closed(X4,X0,X1) )
=> axis_compatible(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f60,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0,X1,X2,X3] :
( ! [X4] :
( ~ in_closed(X4,X2,X3)
| ~ in_closed(X4,X0,X1) )
| axis_compatible(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f51]) ).
fof(f78,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ axis_compatible(X2,X3,X6,X7)
| ~ axis_compatible(X0,X1,X4,X5)
| box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(ennf_transformation,[],[f50]) ).
fof(f79,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ axis_compatible(X2,X3,X6,X7)
| ~ axis_compatible(X0,X1,X4,X5)
| box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f81,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f80]) ).
fof(f91,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,[],[f33]) ).
fof(f92,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,[],[f91]) ).
fof(f103,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f106,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f66]) ).
fof(f122,plain,
! [X2,X3,X0,X1,X4] :
( ~ in_closed(X4,X2,X3)
| ~ in_closed(X4,X0,X1)
| axis_compatible(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f67]) ).
fof(f136,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ axis_compatible(X2,X3,X6,X7)
| ~ axis_compatible(X0,X1,X4,X5)
| box2_compatible(X0,X1,X2,X3,X4,X5,X6,X7) ),
inference(cnf_transformation,[],[f79]) ).
fof(f141,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f92]) ).
fof(f151,plain,
less(v0,v400),
inference(cnf_transformation,[],[f41]) ).
fof(f153,plain,
less(v400,v600),
inference(cnf_transformation,[],[f43]) ).
fof(f154,plain,
less(v400,v800),
inference(cnf_transformation,[],[f44]) ).
fof(f162,plain,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(cnf_transformation,[],[f49]) ).
fof(f163,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f103]) ).
tcf(c_53,plain,
! [X0: $i] : leq(X0,X0),
inference(cnf_transformation,[],[f163]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( axis_compatible(X1,X2,X3,X4)
| ~ in_closed(X0,X3,X4)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( box2_compatible(X0,X1,X4,X5,X2,X3,X6,X7)
| ~ axis_compatible(X4,X5,X6,X7)
| ~ axis_compatible(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( in_closed(X0,X2,X1)
| ~ leq(X2,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_101,plain,
less(v0,v400),
inference(cnf_transformation,[],[f151]) ).
tcf(c_103,plain,
less(v400,v600),
inference(cnf_transformation,[],[f153]) ).
tcf(c_104,plain,
less(v400,v800),
inference(cnf_transformation,[],[f154]) ).
tcf(c_112,negated_conjecture,
~ box2_compatible(v0,v600,v0,v600,v400,v800,v400,v800),
inference(cnf_transformation,[],[f162]) ).
tcf(c_501,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( ~ axis_compatible(X4,X5,X6,X7)
| ~ axis_compatible(X0,X1,X2,X3)
| ( X7 != v800 )
| ( X6 != v400 )
| ( X5 != v600 )
| ( X4 != v0 )
| ( X3 != v800 )
| ( X2 != v400 )
| ( X1 != v600 )
| ( X0 != v0 ) ),
inference(resolution_lifted,[status(thm)],[c_86,c_112]) ).
tcf(c_502,plain,
~ axis_compatible(v0,v600,v400,v800),
inference(unflattening,[status(thm)],[c_501]) ).
tcf(c_507,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ in_closed(X4,X2,X3)
| ~ in_closed(X4,X0,X1)
| ( X3 != v800 )
| ( X2 != v400 )
| ( X1 != v600 )
| ( X0 != v0 ) ),
inference(resolution_lifted,[status(thm)],[c_72,c_502]) ).
tcf(c_508,plain,
! [X0: $i] :
( ~ in_closed(X0,v400,v800)
| ~ in_closed(X0,v0,v600) ),
inference(unflattening,[status(thm)],[c_507]) ).
tcf(c_789,plain,
! [X0: $i] :
( ~ in_closed(X0,v400,v800)
| ~ in_closed(X0,v0,v600) ),
inference(demodulation,[status(thm)],[c_508]) ).
tcf(c_1176,plain,
leq(v0,v400),
inference(superposition,[status(thm)],[c_101,c_56]) ).
tcf(c_1178,plain,
leq(v400,v600),
inference(superposition,[status(thm)],[c_103,c_56]) ).
tcf(c_1179,plain,
leq(v400,v800),
inference(superposition,[status(thm)],[c_104,c_56]) ).
tcf(c_1641,plain,
! [X0: $i] :
( leq(v0,X0)
| ~ leq(v400,X0) ),
inference(superposition,[status(thm)],[c_1176,c_59]) ).
tcf(c_1717,plain,
! [X0: $i] :
( ~ leq(v0,X0)
| ~ leq(X0,v600)
| ~ in_closed(X0,v400,v800) ),
inference(superposition,[status(thm)],[c_89,c_789]) ).
tcf(c_1736,plain,
! [X0: $i] :
( ~ leq(v400,X0)
| ~ leq(v0,X0)
| ~ leq(X0,v800)
| ~ leq(X0,v600) ),
inference(superposition,[status(thm)],[c_89,c_1717]) ).
tcf(c_1742,plain,
! [X0: $i] :
( ~ leq(v400,X0)
| ~ leq(X0,v600)
| ~ leq(X0,v800) ),
inference(global_subsumption_just,[status(thm)],[c_1736,c_1641,c_1736]) ).
tcf(c_1743,plain,
! [X0: $i] :
( ~ leq(v400,X0)
| ~ leq(X0,v800)
| ~ leq(X0,v600) ),
inference(renaming,[status(thm)],[c_1742]) ).
tcf(c_1755,plain,
( ~ leq(v400,v800)
| ~ leq(v400,v400) ),
inference(superposition,[status(thm)],[c_1178,c_1743]) ).
tcf(c_1756,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1755,c_1179,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT091+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n018.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 01:24:54 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 3.08/6.30 % SZS status Started for theBenchmark.p
% 3.08/6.30 % SZS status Theorem for theBenchmark.p
% 3.08/6.30
% 3.08/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.08/6.30
% 3.08/6.30 % ------ iProver source info
% 3.08/6.30
% 3.08/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.08/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.08/6.30 % git: non_committed_changes: false
% 3.08/6.30
% 3.08/6.30 % ------ Parsing...
% 3.08/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.08/6.30
% 3.08/6.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 3.08/6.30
% 3.08/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.08/6.30
% 3.08/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.08/6.30 % ------ Proving...
% 3.08/6.30 % ------ Problem Properties
% 3.08/6.30
% 3.08/6.30 %
% 3.08/6.30 % clauses 40
% 3.08/6.30 % conjectures 0
% 3.08/6.30 % EPR 34
% 3.08/6.30 % Horn 34
% 3.08/6.30 % unary 21
% 3.08/6.30 % binary 7
% 3.08/6.30 % lits 74
% 3.08/6.30 % lits eq 26
% 3.08/6.30 % fd_pure 0
% 3.08/6.30 % fd_pseudo 0
% 3.08/6.30 % fd_cond 3
% 3.08/6.30 % fd_pseudo_cond 4
% 3.08/6.30 % AC symbols 0
% 3.08/6.30
% 3.08/6.30 % ------ Schedule dynamic 5 is on
% 3.08/6.30
% 3.08/6.30 % ------ no conjectures: strip conj schedule
% 3.08/6.30
% 3.08/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.08/6.30
% 3.08/6.30
% 3.08/6.30 % ------
% 3.08/6.30 % Current options:
% 3.08/6.30 % ------
% 3.08/6.30
% 3.08/6.30
% 3.08/6.30 %
% 3.08/6.30
% 3.08/6.30 % ------ Proving...
% 3.08/6.30 %
% 3.08/6.30
% 3.08/6.30 % SZS status Theorem for theBenchmark.p
% 3.08/6.30
% 3.08/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.08/6.30
% 3.08/6.30
%------------------------------------------------------------------------------