%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT081+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 : n014.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:02 PM UTC 2026
% Result : Theorem 0.89s 1.29s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 101 ( 21 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 102 ( 43 ~; 28 |; 26 &)
% ( 1 <=>; 4 =>; 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 58 ( 0 sgn 52 !; 6 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( leq(X1,X0)
& leq(X0,X1) )
=> 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(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(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(f41,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_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] :
( leq(v200,X1)
& in_lopen(X1,v0,v600)
& leq(v800,X0)
& in_lopen(X0,v0,v400) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl402) ).
fof(f45,negated_conjecture,
~ ~ ? [X0,X1] :
( leq(v200,X1)
& in_lopen(X1,v0,v600)
& leq(v800,X0)
& in_lopen(X0,v0,v400) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,plain,
? [X0,X1] :
( leq(v200,X1)
& in_lopen(X1,v0,v600)
& leq(v800,X0)
& in_lopen(X0,v0,v400) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( leq(X0,X2)
& less(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f55,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f5]) ).
fof(f56,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ~ in_lopen(X0,X1,X2)
| ( leq(X0,X2)
& less(X1,X0) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f77,plain,
( leq(v200,sK1)
& in_lopen(sK1,v0,v600)
& leq(v800,sK0)
& in_lopen(sK0,v0,v400) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f46]) ).
fof(f84,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f56]) ).
fof(f85,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f63]) ).
fof(f89,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f112,plain,
less(v400,v800),
inference(cnf_transformation,[],[f41]) ).
fof(f115,plain,
v400 != v800,
inference(cnf_transformation,[],[f43]) ).
fof(f126,plain,
leq(v800,sK0),
inference(cnf_transformation,[],[f77]) ).
fof(f127,plain,
in_lopen(sK0,v0,v400),
inference(cnf_transformation,[],[f77]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f89]) ).
tcf(c_83,plain,
less(v400,v800),
inference(cnf_transformation,[],[f112]) ).
tcf(c_93,plain,
v400 != v800,
inference(cnf_transformation,[],[f115]) ).
tcf(c_95,negated_conjecture,
in_lopen(sK0,v0,v400),
inference(cnf_transformation,[],[f127]) ).
tcf(c_96,negated_conjecture,
leq(v800,sK0),
inference(cnf_transformation,[],[f126]) ).
tcf(c_376,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ( X2 != v400 )
| ( X1 != v0 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_95]) ).
tcf(c_377,plain,
leq(sK0,v400),
inference(unflattening,[status(thm)],[c_376]) ).
tcf(c_646,plain,
leq(sK0,v400),
inference(demodulation,[status(thm)],[c_377]) ).
tcf(c_648,negated_conjecture,
leq(v800,sK0),
inference(demodulation,[status(thm)],[c_96]) ).
tcf(c_1051,plain,
leq(v400,v800),
inference(superposition,[status(thm)],[c_83,c_56]) ).
tcf(c_1384,plain,
( ( v400 = v800 )
| ~ leq(v800,v400)
| ~ leq(v400,v800) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1499,plain,
! [X0: $i] :
( leq(v800,X0)
| ~ leq(sK0,X0) ),
inference(superposition,[status(thm)],[c_648,c_59]) ).
tcf(c_1634,plain,
leq(v800,v400),
inference(superposition,[status(thm)],[c_646,c_1499]) ).
tcf(c_1637,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1634,c_1384,c_1051,c_93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT081+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.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 01:20:34 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/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...
% 0.89/1.29 % SZS status Started for theBenchmark.p
% 0.89/1.29 % SZS status Theorem for theBenchmark.p
% 0.89/1.29
% 0.89/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.89/1.29
% 0.89/1.29 % ------ iProver source info
% 0.89/1.29
% 0.89/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.89/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.89/1.29 % git: non_committed_changes: false
% 0.89/1.29
% 0.89/1.29 % ------ Parsing...
% 0.89/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.89/1.29
% 0.89/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 0.89/1.29
% 0.89/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.89/1.29
% 0.89/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.89/1.29 % ------ Proving...
% 0.89/1.29 % ------ Problem Properties
% 0.89/1.29
% 0.89/1.29 %
% 0.89/1.29 % clauses 49
% 0.89/1.29 % conjectures 2
% 0.89/1.29 % EPR 43
% 0.89/1.29 % Horn 43
% 0.89/1.29 % unary 35
% 0.89/1.29 % binary 3
% 0.89/1.29 % lits 77
% 0.89/1.29 % lits eq 29
% 0.89/1.29 % fd_pure 0
% 0.89/1.29 % fd_pseudo 0
% 0.89/1.29 % fd_cond 3
% 0.89/1.29 % fd_pseudo_cond 3
% 0.89/1.29 % AC symbols 0
% 0.89/1.29
% 0.89/1.29 % ------ Schedule dynamic 5 is on
% 0.89/1.29
% 0.89/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.89/1.29
% 0.89/1.29
% 0.89/1.29 % ------
% 0.89/1.29 % Current options:
% 0.89/1.29 % ------
% 0.89/1.29
% 0.89/1.29
% 0.89/1.29 %
% 0.89/1.29
% 0.89/1.29 % ------ Proving...
% 0.89/1.29 %
% 0.89/1.29
% 0.89/1.29 % SZS status Theorem for theBenchmark.p
% 0.89/1.29
% 0.89/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.89/1.29
% 0.89/1.29
%------------------------------------------------------------------------------