%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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 1.26s 6.19s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 22 unt; 0 def)
% Number of atoms : 178 ( 35 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 209 ( 97 ~; 66 |; 42 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 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 : 8 ( 6 usr; 4 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 75 ( 0 sgn 69 !; 6 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
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(f5,axiom,
! [X0,X1] :
( ( leq(X1,X0)
& leq(X0,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( leq(X0,X2)
& less(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(f36,axiom,
less(v0,v32),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v32) ).
fof(f37,axiom,
less(v0,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f38,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(f41,axiom,
less(v16,v32),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v16_v32) ).
fof(f56,axiom,
( v800 != v1200
& v600 != v1200
& v600 != v800
& v400 != v1200
& v400 != v800
& v400 != v600
& v32 != v1200
& v32 != v800
& v32 != v600
& v32 != v400
& v16 != v1200
& v16 != v800
& v16 != v600
& v16 != v400
& v16 != v32
& v0 != v1200
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v32
& v0 != v16 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(f57,conjecture,
? [X0,X1,X2] :
( ~ ( in_lopen(X2,v0,v16)
& in_lopen(X1,v0,v800)
& in_lopen(X0,v0,v1200) )
& in_lopen(X2,v0,v32)
& in_lopen(X1,v0,v400)
& in_lopen(X0,v0,v600) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl350) ).
fof(f58,negated_conjecture,
~ ? [X0,X1,X2] :
( ~ ( in_lopen(X2,v0,v16)
& in_lopen(X1,v0,v800)
& in_lopen(X0,v0,v1200) )
& in_lopen(X2,v0,v32)
& in_lopen(X1,v0,v400)
& in_lopen(X0,v0,v600) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f68,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f5]) ).
fof(f69,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ( in_lopen(X2,v0,v16)
& in_lopen(X1,v0,v800)
& in_lopen(X0,v0,v1200) )
| ~ in_lopen(X2,v0,v32)
| ~ in_lopen(X1,v0,v400)
| ~ in_lopen(X0,v0,v600) ),
inference(ennf_transformation,[],[f58]) ).
fof(f88,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f89,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f88]) ).
fof(f90,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(f91,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,[],[f90]) ).
fof(f96,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f98,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f69]) ).
fof(f99,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f103,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f91]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f91]) ).
fof(f120,plain,
less(v0,v32),
inference(cnf_transformation,[],[f36]) ).
fof(f121,plain,
less(v0,v400),
inference(cnf_transformation,[],[f37]) ).
fof(f122,plain,
less(v0,v600),
inference(cnf_transformation,[],[f38]) ).
fof(f125,plain,
less(v16,v32),
inference(cnf_transformation,[],[f41]) ).
fof(f154,plain,
v16 != v32,
inference(cnf_transformation,[],[f56]) ).
fof(f161,plain,
! [X2,X0,X1] :
( in_lopen(X2,v0,v16)
| ~ in_lopen(X2,v0,v32)
| ~ in_lopen(X1,v0,v400)
| ~ in_lopen(X0,v0,v600) ),
inference(cnf_transformation,[],[f87]) ).
fof(f164,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f96]) ).
tcf(c_53,plain,
! [X0: $i] : leq(X0,X0),
inference(cnf_transformation,[],[f164]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( in_lopen(X1,X0,X2)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_77,plain,
less(v0,v32),
inference(cnf_transformation,[],[f120]) ).
tcf(c_78,plain,
less(v0,v400),
inference(cnf_transformation,[],[f121]) ).
tcf(c_79,plain,
less(v0,v600),
inference(cnf_transformation,[],[f122]) ).
tcf(c_82,plain,
less(v16,v32),
inference(cnf_transformation,[],[f125]) ).
tcf(c_103,plain,
v16 != v32,
inference(cnf_transformation,[],[f154]) ).
tcf(c_120,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( in_lopen(X1,v0,v16)
| ~ in_lopen(X2,v0,v400)
| ~ in_lopen(X1,v0,v32)
| ~ in_lopen(X0,v0,v600) ),
inference(cnf_transformation,[],[f161]) ).
tcf(c_851,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| ~ in_lopen(X0,v0,v400) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_120]) ).
tcf(c_852,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_11
| in_lopen(X0,v0,v16)
| ~ in_lopen(X0,v0,v32) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_120]) ).
tcf(c_853,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_12
| ~ in_lopen(X0,v0,v600) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_12])],[c_120]) ).
tcf(c_854,negated_conjecture,
( iPr_def_12
| iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_120]) ).
tcf(c_860,negated_conjecture,
( iPr_def_12
| iPr_def_11
| iPr_def_10 ),
inference(demodulation,[status(thm)],[c_854]) ).
tcf(c_862,negated_conjecture,
! [X0: $i] :
( in_lopen(X0,v0,v16)
| ~ iPr_def_11
| ~ in_lopen(X0,v0,v32) ),
inference(demodulation,[status(thm)],[c_852]) ).
tcf(c_865,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_12
| ~ in_lopen(X0,v0,v600) ),
inference(demodulation,[status(thm)],[c_853]) ).
tcf(c_870,negated_conjecture,
! [X0: $i] :
( ~ iPr_def_10
| ~ in_lopen(X0,v0,v400) ),
inference(demodulation,[status(thm)],[c_851]) ).
tcf(c_1513,plain,
leq(v16,v32),
inference(superposition,[status(thm)],[c_82,c_56]) ).
tcf(c_2018,plain,
( ( v16 = v32 )
| ~ leq(v32,v16) ),
inference(superposition,[status(thm)],[c_1513,c_55]) ).
tcf(c_2047,plain,
~ leq(v32,v16),
inference(forward_subsumption_resolution,[status(thm)],[c_2018,c_103]) ).
tcf(c_2090,plain,
! [X0: $i] :
( ~ iPr_def_12
| ~ leq(X0,v600)
| ~ less(v0,X0) ),
inference(superposition,[status(thm)],[c_60,c_865]) ).
tcf(c_2092,plain,
! [X0: $i] :
( ~ iPr_def_10
| ~ leq(X0,v400)
| ~ less(v0,X0) ),
inference(superposition,[status(thm)],[c_60,c_870]) ).
tcf(c_2161,plain,
( ~ iPr_def_12
| ~ leq(v600,v600) ),
inference(superposition,[status(thm)],[c_79,c_2090]) ).
tcf(c_2164,plain,
~ iPr_def_12,
inference(forward_subsumption_resolution,[status(thm)],[c_2161,c_53]) ).
tcf(c_2166,plain,
( iPr_def_11
| iPr_def_10 ),
inference(backward_subsumption_resolution,[status(thm)],[c_860,c_2164]) ).
tcf(c_2189,plain,
( ~ iPr_def_10
| ~ leq(v400,v400) ),
inference(superposition,[status(thm)],[c_78,c_2092]) ).
tcf(c_2193,plain,
~ iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_2189,c_53]) ).
tcf(c_2194,plain,
iPr_def_11,
inference(backward_subsumption_resolution,[status(thm)],[c_2166,c_2193]) ).
tcf(c_2196,plain,
! [X0: $i] :
( in_lopen(X0,v0,v16)
| ~ in_lopen(X0,v0,v32) ),
inference(backward_subsumption_resolution,[status(thm)],[c_862,c_2194]) ).
tcf(c_2210,plain,
! [X0: $i] :
( in_lopen(X0,v0,v16)
| ~ leq(X0,v32)
| ~ less(v0,X0) ),
inference(superposition,[status(thm)],[c_60,c_2196]) ).
tcf(c_2267,plain,
! [X0: $i] :
( leq(X0,v16)
| ~ leq(X0,v32)
| ~ less(v0,X0) ),
inference(superposition,[status(thm)],[c_2210,c_62]) ).
tcf(c_2303,plain,
( leq(v32,v16)
| ~ leq(v32,v32) ),
inference(superposition,[status(thm)],[c_77,c_2267]) ).
tcf(c_2308,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2303,c_2047,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n004.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Thu Sep 24 01:20:57 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 1.26/6.19 % SZS status Started for theBenchmark.p
% 1.26/6.19 % SZS status Theorem for theBenchmark.p
% 1.26/6.19
% 1.26/6.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.26/6.19
% 1.26/6.19 % ------ iProver source info
% 1.26/6.19
% 1.26/6.19 % git: date: 2026-07-19 20:42:38 +0200
% 1.26/6.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.26/6.19 % git: non_committed_changes: false
% 1.26/6.19
% 1.26/6.19 % ------ Parsing...
% 1.26/6.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.26/6.19
% 1.26/6.19 % ------ 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 %
% 1.26/6.19
% 1.26/6.19 % ------ Preprocessing... gs_s sp: 9 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.26/6.19
% 1.26/6.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.26/6.19 % ------ Proving...
% 1.26/6.19 % ------ Problem Properties
% 1.26/6.19
% 1.26/6.19 %
% 1.26/6.19 % clauses 77
% 1.26/6.19 % conjectures 9
% 1.26/6.19 % EPR 71
% 1.26/6.19 % Horn 68
% 1.26/6.19 % unary 51
% 1.26/6.19 % binary 8
% 1.26/6.19 % lits 124
% 1.26/6.19 % lits eq 40
% 1.26/6.19 % fd_pure 0
% 1.26/6.19 % fd_pseudo 0
% 1.26/6.19 % fd_cond 3
% 1.26/6.19 % fd_pseudo_cond 3
% 1.26/6.19 % AC symbols 0
% 1.26/6.19
% 1.26/6.19 % ------ Schedule dynamic 5 is on
% 1.26/6.19
% 1.26/6.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.26/6.19
% 1.26/6.19
% 1.26/6.19 % ------
% 1.26/6.19 % Current options:
% 1.26/6.19 % ------
% 1.26/6.19
% 1.26/6.19
% 1.26/6.19 %
% 1.26/6.19
% 1.26/6.19 % ------ Proving...
% 1.26/6.19 %
% 1.26/6.19
% 1.26/6.19 % SZS status Theorem for theBenchmark.p
% 1.26/6.19
% 1.26/6.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.26/6.19
%------------------------------------------------------------------------------