%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT078+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 3.74s 1.30s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 120 ( 32 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 132 ( 54 ~; 28 |; 45 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 61 ( 0 sgn 52 !; 9 ?; 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(f54,axiom,
less(v600,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v1200) ).
fof(f56,axiom,
( v800 != v1200
& v600 != v1200
& v600 != v800
& v200 != v1200
& v200 != v800
& v200 != v600
& v32 != v1200
& v32 != v800
& v32 != v600
& v32 != v200
& v8 != v1200
& v8 != v800
& v8 != v600
& v8 != v200
& v8 != v32
& v0 != v1200
& v0 != v800
& v0 != v600
& v0 != v200
& v0 != v32
& v0 != v8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(f57,conjecture,
~ ? [X0,X1,X2] :
( leq(v8,X2)
& in_lopen(X2,v0,v32)
& leq(v200,X1)
& in_lopen(X1,v0,v800)
& leq(v1200,X0)
& in_lopen(X0,v0,v600) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl341) ).
fof(f58,negated_conjecture,
~ ~ ? [X0,X1,X2] :
( leq(v8,X2)
& in_lopen(X2,v0,v32)
& leq(v200,X1)
& in_lopen(X1,v0,v800)
& leq(v1200,X0)
& in_lopen(X0,v0,v600) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f59,plain,
? [X0,X1,X2] :
( leq(v8,X2)
& in_lopen(X2,v0,v32)
& leq(v200,X1)
& in_lopen(X1,v0,v800)
& leq(v1200,X0)
& in_lopen(X0,v0,v600) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( leq(X0,X2)
& less(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f70,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f5]) ).
fof(f71,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f70]) ).
fof(f72,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ~ in_lopen(X0,X1,X2)
| ( leq(X0,X2)
& less(X1,X0) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f92,plain,
( leq(v8,sK2)
& in_lopen(sK2,v0,v32)
& leq(v200,sK1)
& in_lopen(sK1,v0,v800)
& leq(v1200,sK0)
& in_lopen(sK0,v0,v600) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f59]) ).
fof(f99,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f71]) ).
fof(f100,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f103,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f78]) ).
fof(f104,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f138,plain,
less(v600,v1200),
inference(cnf_transformation,[],[f54]) ).
fof(f141,plain,
v600 != v1200,
inference(cnf_transformation,[],[f56]) ).
fof(f165,plain,
leq(v1200,sK0),
inference(cnf_transformation,[],[f92]) ).
fof(f166,plain,
in_lopen(sK0,v0,v600),
inference(cnf_transformation,[],[f92]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f104]) ).
tcf(c_94,plain,
less(v600,v1200),
inference(cnf_transformation,[],[f138]) ).
tcf(c_115,plain,
v600 != v1200,
inference(cnf_transformation,[],[f141]) ).
tcf(c_117,negated_conjecture,
in_lopen(sK0,v0,v600),
inference(cnf_transformation,[],[f166]) ).
tcf(c_118,negated_conjecture,
leq(v1200,sK0),
inference(cnf_transformation,[],[f165]) ).
tcf(c_448,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ( X2 != v600 )
| ( X1 != v0 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_117]) ).
tcf(c_449,plain,
leq(sK0,v600),
inference(unflattening,[status(thm)],[c_448]) ).
tcf(c_489,plain,
leq(sK0,v600),
inference(demodulation,[status(thm)],[c_449]) ).
tcf(c_492,negated_conjecture,
leq(v1200,sK0),
inference(demodulation,[status(thm)],[c_118]) ).
tcf(c_1006,plain,
leq(v600,v1200),
inference(superposition,[status(thm)],[c_94,c_56]) ).
tcf(c_1337,plain,
( ( v600 = v1200 )
| ~ leq(v1200,v600)
| ~ leq(v600,v1200) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1602,plain,
! [X0: $i] :
( leq(v1200,X0)
| ~ leq(sK0,X0) ),
inference(superposition,[status(thm)],[c_492,c_59]) ).
tcf(c_1884,plain,
leq(v1200,v600),
inference(superposition,[status(thm)],[c_489,c_1602]) ).
tcf(c_1885,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1884,c_1337,c_1006,c_115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.43 % Computer : n014.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Thu Sep 24 01:20:18 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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.27/0.51
% 0.27/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.51
% 0.27/0.52 % Detected problem language: tptp
% 0.27/0.53 % Proving...
% 3.74/1.30 % SZS status Started for theBenchmark.p
% 3.74/1.30 % SZS status Theorem for theBenchmark.p
% 3.74/1.30
% 3.74/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.74/1.30
% 3.74/1.30 % ------ iProver source info
% 3.74/1.30
% 3.74/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.74/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.74/1.30 % git: non_committed_changes: false
% 3.74/1.30
% 3.74/1.30 % ------ Parsing...
% 3.74/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.74/1.30
% 3.74/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e %
% 3.74/1.30
% 3.74/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.74/1.30
% 3.74/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.74/1.30 % ------ Proving...
% 3.74/1.30 % ------ Problem Properties
% 3.74/1.30
% 3.74/1.30 %
% 3.74/1.30 % clauses 74
% 3.74/1.30 % conjectures 3
% 3.74/1.30 % EPR 68
% 3.74/1.30 % Horn 68
% 3.74/1.30 % unary 60
% 3.74/1.30 % binary 3
% 3.74/1.30 % lits 102
% 3.74/1.30 % lits eq 40
% 3.74/1.30 % fd_pure 0
% 3.74/1.30 % fd_pseudo 0
% 3.74/1.30 % fd_cond 3
% 3.74/1.30 % fd_pseudo_cond 3
% 3.74/1.30 % AC symbols 0
% 3.74/1.30
% 3.74/1.30 % ------ Schedule dynamic 5 is on
% 3.74/1.30
% 3.74/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.74/1.30
% 3.74/1.30
% 3.74/1.30 % ------
% 3.74/1.30 % Current options:
% 3.74/1.30 % ------
% 3.74/1.30
% 3.74/1.30
% 3.74/1.30 %
% 3.74/1.30
% 3.74/1.30 % ------ Proving...
% 3.74/1.30 %
% 3.74/1.30
% 3.74/1.30 % SZS status Theorem for theBenchmark.p
% 3.74/1.30
% 3.74/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.74/1.30
% 3.74/1.30
%------------------------------------------------------------------------------