%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT086+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 : 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:03 PM UTC 2026
% Result : Theorem 2.69s 1.28s
% Output : CNFRefutation 2.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 68 ( 21 unt; 0 def)
% Number of atoms : 175 ( 21 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 202 ( 95 ~; 75 |; 28 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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; 3 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 87 ( 0 sgn 83 !; 4 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
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(f7,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& leq(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( leq(X0,X2)
& less(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(f33,axiom,
less(v0,v200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v200) ).
fof(f37,axiom,
less(v200,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(f42,axiom,
less(v600,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(f43,axiom,
( v600 != v800
& v400 != v800
& v400 != v600
& v200 != v800
& v200 != v600
& v200 != v400
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v200 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(f44,conjecture,
? [X0,X1] :
( ( ( in_lopen(X1,v0,v400)
& ~ in_lopen(X0,v0,v600) )
| ( ~ in_lopen(X1,v0,v400)
& in_lopen(X0,v0,v600) ) )
& in_lopen(X1,v0,v200)
& leq(v800,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl462) ).
fof(f45,negated_conjecture,
~ ? [X0,X1] :
( ( ( in_lopen(X1,v0,v400)
& ~ in_lopen(X0,v0,v600) )
| ( ~ in_lopen(X1,v0,v400)
& in_lopen(X0,v0,v600) ) )
& in_lopen(X1,v0,v200)
& leq(v800,X0) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f55,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(flattening,[],[f56]) ).
fof(f72,plain,
! [X0,X1] :
( ( ( ~ in_lopen(X1,v0,v400)
| in_lopen(X0,v0,v600) )
& ( in_lopen(X1,v0,v400)
| ~ in_lopen(X0,v0,v600) ) )
| ~ in_lopen(X1,v0,v200)
| ~ leq(v800,X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f73,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f74,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ( ~ in_lopen(X0,X1,X2)
| ( leq(X0,X2)
& less(X1,X0) ) )
& ( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( ~ in_lopen(X0,X1,X2)
| ( leq(X0,X2)
& less(X1,X0) ) )
& ( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f80,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f81,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f84,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f85,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f57]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| less(X1,X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f90,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f76]) ).
fof(f104,plain,
less(v0,v200),
inference(cnf_transformation,[],[f33]) ).
fof(f108,plain,
less(v200,v400),
inference(cnf_transformation,[],[f37]) ).
fof(f113,plain,
less(v600,v800),
inference(cnf_transformation,[],[f42]) ).
fof(f114,plain,
v600 != v800,
inference(cnf_transformation,[],[f43]) ).
fof(f124,plain,
! [X0,X1] :
( ~ in_lopen(X1,v0,v400)
| in_lopen(X0,v0,v600)
| ~ in_lopen(X1,v0,v200)
| ~ leq(v800,X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f126,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f81]) ).
tcf(c_49,plain,
! [X0: $i] : ~ less(X0,X0),
inference(cnf_transformation,[],[f77]) ).
tcf(c_53,plain,
! [X0: $i] : leq(X0,X0),
inference(cnf_transformation,[],[f126]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| ( X0 = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X2,X1)
| ~ leq(X2,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( in_lopen(X1,X0,X2)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X1,X0)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_76,plain,
less(v0,v200),
inference(cnf_transformation,[],[f104]) ).
tcf(c_80,plain,
less(v200,v400),
inference(cnf_transformation,[],[f108]) ).
tcf(c_85,plain,
less(v600,v800),
inference(cnf_transformation,[],[f113]) ).
tcf(c_95,plain,
v600 != v800,
inference(cnf_transformation,[],[f114]) ).
tcf(c_97,negated_conjecture,
! [X0: $i,X1: $i] :
( in_lopen(X1,v0,v600)
| ~ leq(v800,X1)
| ~ in_lopen(X0,v0,v400)
| ~ in_lopen(X0,v0,v200) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_705,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| ~ leq(v800,X0)
| in_lopen(X0,v0,v600) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_97]) ).
tcf(c_706,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| ~ in_lopen(X0,v0,v200)
| ~ in_lopen(X0,v0,v400) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_97]) ).
tcf(c_707,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_97]) ).
tcf(c_711,negated_conjecture,
( iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_707]) ).
tcf(c_712,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| ~ in_lopen(X0,v0,v400)
| ~ in_lopen(X0,v0,v200) ),
inference(demodulation,[status(thm)],[c_706]) ).
tcf(c_713,negated_conjecture,
! [X0: $i] :
( in_lopen(X0,v0,v600)
| ~ iPr_def_10
| ~ leq(v800,X0) ),
inference(demodulation,[status(thm)],[c_705]) ).
tcf(c_1250,plain,
leq(v200,v400),
inference(superposition,[status(thm)],[c_80,c_56]) ).
tcf(c_1255,plain,
leq(v600,v800),
inference(superposition,[status(thm)],[c_85,c_56]) ).
tcf(c_1269,plain,
! [X0: $i] :
( leq(X0,v600)
| ~ iPr_def_10
| ~ leq(v800,X0) ),
inference(superposition,[status(thm)],[c_713,c_62]) ).
tcf(c_1301,plain,
( leq(v800,v600)
| ~ iPr_def_10 ),
inference(superposition,[status(thm)],[c_53,c_1269]) ).
tcf(c_1397,plain,
( less(v800,v600)
| ( v600 = v800 )
| ~ iPr_def_10 ),
inference(superposition,[status(thm)],[c_1301,c_54]) ).
tcf(c_1398,plain,
( less(v800,v600)
| ~ iPr_def_10 ),
inference(forward_subsumption_resolution,[status(thm)],[c_1397,c_95]) ).
tcf(c_1457,plain,
! [X0: $i] :
( less(X0,v600)
| ~ iPr_def_10
| ~ leq(X0,v800) ),
inference(superposition,[status(thm)],[c_1398,c_57]) ).
tcf(c_1514,plain,
( less(v600,v600)
| ~ iPr_def_10 ),
inference(superposition,[status(thm)],[c_1255,c_1457]) ).
tcf(c_1515,plain,
~ iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_1514,c_49]) ).
tcf(c_1516,plain,
iPr_def_11,
inference(backward_subsumption_resolution,[status(thm)],[c_711,c_1515]) ).
tcf(c_1517,plain,
! [X0: $i] :
( ~ in_lopen(X0,v0,v400)
| ~ in_lopen(X0,v0,v200) ),
inference(backward_subsumption_resolution,[status(thm)],[c_712,c_1516]) ).
tcf(c_1729,plain,
! [X0: $i] :
( ~ leq(X0,v200)
| ~ less(v0,X0)
| ~ in_lopen(X0,v0,v400) ),
inference(superposition,[status(thm)],[c_60,c_1517]) ).
tcf(c_1799,plain,
! [X0: $i] :
( ~ leq(X0,v200)
| ~ in_lopen(X0,v0,v400) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1729,c_61]) ).
tcf(c_1806,plain,
! [X0: $i] :
( ~ leq(X0,v400)
| ~ leq(X0,v200)
| ~ less(v0,X0) ),
inference(superposition,[status(thm)],[c_60,c_1799]) ).
tcf(c_1819,plain,
( ~ leq(v200,v400)
| ~ leq(v200,v200) ),
inference(superposition,[status(thm)],[c_76,c_1806]) ).
tcf(c_1823,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1819,c_1250,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT086+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.08/0.36 % Computer : n007.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 01:19:37 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 2.69/1.28 % SZS status Started for theBenchmark.p
% 2.69/1.28 % SZS status Theorem for theBenchmark.p
% 2.69/1.28
% 2.69/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.69/1.28
% 2.69/1.28 % ------ iProver source info
% 2.69/1.28
% 2.69/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.69/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.69/1.28 % git: non_committed_changes: false
% 2.69/1.28
% 2.69/1.28 % ------ Parsing...
% 2.69/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.69/1.28
% 2.69/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.69/1.28
% 2.69/1.28 % ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.69/1.28
% 2.69/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.69/1.28 % ------ Proving...
% 2.69/1.28 % ------ Problem Properties
% 2.69/1.28
% 2.69/1.28 %
% 2.69/1.28 % clauses 52
% 2.69/1.28 % conjectures 6
% 2.69/1.28 % EPR 46
% 2.69/1.28 % Horn 44
% 2.69/1.28 % unary 29
% 2.69/1.28 % binary 7
% 2.69/1.28 % lits 94
% 2.69/1.28 % lits eq 29
% 2.69/1.28 % fd_pure 0
% 2.69/1.28 % fd_pseudo 0
% 2.69/1.28 % fd_cond 3
% 2.69/1.28 % fd_pseudo_cond 3
% 2.69/1.28 % AC symbols 0
% 2.69/1.28
% 2.69/1.28 % ------ Schedule dynamic 5 is on
% 2.69/1.28
% 2.69/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.69/1.28
% 2.69/1.28
% 2.69/1.28 % ------
% 2.69/1.28 % Current options:
% 2.69/1.28 % ------
% 2.69/1.28
% 2.69/1.28
% 2.69/1.28 %
% 2.69/1.28
% 2.69/1.28 % ------ Proving...
% 2.69/1.28 %
% 2.69/1.28
% 2.69/1.28 % SZS status Theorem for theBenchmark.p
% 2.69/1.28
% 2.69/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.69/1.28
% 2.69/1.28
%------------------------------------------------------------------------------