%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT088+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:03 PM UTC 2026
% Result : Theorem 2.47s 1.28s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 68 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 76 ( 36 ~; 29 |; 8 &)
% ( 2 <=>; 1 =>; 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 37 !; 2 ?; 11 :)
% 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(f12,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(f34,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f36,axiom,
less(v200,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(f40,conjecture,
? [X0] :
( in_lopen(X0,v0,v400)
& less(v200,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl509) ).
fof(f41,negated_conjecture,
~ ? [X0] :
( in_lopen(X0,v0,v400)
& less(v200,X0) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( leq(X0,X2)
& less(X1,X0) )
=> in_lopen(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f42]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(flattening,[],[f59]) ).
fof(f71,plain,
! [X0] :
( ~ in_lopen(X0,v0,v400)
| ~ less(v200,X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f72,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f73,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f72]) ).
fof(f79,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f60]) ).
fof(f103,plain,
less(v0,v400),
inference(cnf_transformation,[],[f34]) ).
fof(f105,plain,
less(v200,v400),
inference(cnf_transformation,[],[f36]) ).
fof(f114,plain,
! [X0] :
( ~ in_lopen(X0,v0,v400)
| ~ less(v200,X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f115,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f79]) ).
tcf(c_53,plain,
! [X0: $i] : leq(X0,X0),
inference(cnf_transformation,[],[f115]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( in_lopen(X1,X0,X2)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_77,plain,
less(v0,v400),
inference(cnf_transformation,[],[f103]) ).
tcf(c_79,plain,
less(v200,v400),
inference(cnf_transformation,[],[f105]) ).
tcf(c_88,negated_conjecture,
! [X0: $i] :
( ~ less(v200,X0)
| ~ in_lopen(X0,v0,v400) ),
inference(cnf_transformation,[],[f114]) ).
tcf(c_361,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ less(v200,X2)
| ~ leq(X1,X3)
| ~ less(X0,X1)
| ( X3 != v400 )
| ( X1 != X2 )
| ( X0 != v0 ) ),
inference(resolution_lifted,[status(thm)],[c_62,c_88]) ).
tcf(c_362,plain,
! [X0: $i] :
( ~ leq(X0,v400)
| ~ less(v200,X0)
| ~ less(v0,X0) ),
inference(unflattening,[status(thm)],[c_361]) ).
tcf(c_619,plain,
! [X0: $i] :
( ~ leq(X0,v400)
| ~ less(v200,X0)
| ~ less(v0,X0) ),
inference(demodulation,[status(thm)],[c_362]) ).
tcf(c_983,plain,
( ~ leq(v400,v400)
| ~ less(v0,v400) ),
inference(superposition,[status(thm)],[c_79,c_619]) ).
tcf(c_984,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_983,c_53,c_77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT088+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 : n018.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:24:03 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 2.47/1.28 % SZS status Started for theBenchmark.p
% 2.47/1.28 % SZS status Theorem for theBenchmark.p
% 2.47/1.28
% 2.47/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.47/1.28
% 2.47/1.28 % ------ iProver source info
% 2.47/1.28
% 2.47/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.47/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.47/1.28 % git: non_committed_changes: false
% 2.47/1.28
% 2.47/1.28 % ------ Parsing...
% 2.47/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.47/1.28
% 2.47/1.28 % ------ 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 %
% 2.47/1.28
% 2.47/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.47/1.28
% 2.47/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.47/1.28 % ------ Proving...
% 2.47/1.28 % ------ Problem Properties
% 2.47/1.28
% 2.47/1.28 %
% 2.47/1.28 % clauses 38
% 2.47/1.28 % conjectures 0
% 2.47/1.28 % EPR 30
% 2.47/1.28 % Horn 32
% 2.47/1.28 % unary 21
% 2.47/1.28 % binary 5
% 2.47/1.28 % lits 70
% 2.47/1.28 % lits eq 25
% 2.47/1.28 % fd_pure 0
% 2.47/1.28 % fd_pseudo 0
% 2.47/1.28 % fd_cond 3
% 2.47/1.28 % fd_pseudo_cond 3
% 2.47/1.28 % AC symbols 0
% 2.47/1.28
% 2.47/1.28 % ------ Schedule dynamic 5 is on
% 2.47/1.28
% 2.47/1.28 % ------ no conjectures: strip conj schedule
% 2.47/1.28
% 2.47/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.47/1.28
% 2.47/1.28
% 2.47/1.28 % ------
% 2.47/1.28 % Current options:
% 2.47/1.28 % ------
% 2.47/1.28
% 2.47/1.28
% 2.47/1.28 %
% 2.47/1.28
% 2.47/1.28 % ------ Proving...
% 2.47/1.28 %
% 2.47/1.28
% 2.47/1.28 % SZS status Theorem for theBenchmark.p
% 2.47/1.28
% 2.47/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.47/1.28
% 2.47/1.28
%------------------------------------------------------------------------------