%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT087+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 : n009.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 1.86s 1.27s
% Output : CNFRefutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 56 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 29 ~; 22 |; 6 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 2 ( 2 usr; 2 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/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
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(f32,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(f35,conjecture,
? [X0] : in_lopen(X0,v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl500) ).
fof(f36,negated_conjecture,
~ ? [X0] : in_lopen(X0,v0,v600),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( leq(X0,X2)
& less(X1,X0) )
=> in_lopen(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(flattening,[],[f52]) ).
fof(f64,plain,
! [X0] : ~ in_lopen(X0,v0,v600),
inference(ennf_transformation,[],[f36]) ).
fof(f65,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f66,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f65]) ).
fof(f71,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f66]) ).
fof(f78,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ less(X1,X0)
| in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f93,plain,
less(v0,v600),
inference(cnf_transformation,[],[f32]) ).
fof(f98,plain,
! [X0] : ~ in_lopen(X0,v0,v600),
inference(cnf_transformation,[],[f64]) ).
fof(f99,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f71]) ).
tcf(c_53,plain,
! [X0: $i] : leq(X0,X0),
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,[],[f78]) ).
tcf(c_75,plain,
less(v0,v600),
inference(cnf_transformation,[],[f93]) ).
tcf(c_80,negated_conjecture,
! [X0: $i] : ~ in_lopen(X0,v0,v600),
inference(cnf_transformation,[],[f98]) ).
tcf(c_319,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ leq(X1,X3)
| ~ less(X0,X1)
| ( X3 != v600 )
| ( X1 != X2 )
| ( X0 != v0 ) ),
inference(resolution_lifted,[status(thm)],[c_60,c_80]) ).
tcf(c_320,plain,
! [X0: $i] :
( ~ leq(X0,v600)
| ~ less(v0,X0) ),
inference(unflattening,[status(thm)],[c_319]) ).
tcf(c_541,plain,
! [X0: $i] :
( ~ leq(X0,v600)
| ~ less(v0,X0) ),
inference(demodulation,[status(thm)],[c_320]) ).
tcf(c_861,plain,
~ leq(v600,v600),
inference(superposition,[status(thm)],[c_75,c_541]) ).
tcf(c_862,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_861,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT087+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.09/0.36 % Computer : n009.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:21:58 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.40 Running first-order theorem proving
% 0.02/0.40 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.02/0.41
% 0.02/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.41
% 0.02/0.41 % Detected problem language: tptp
% 0.02/0.42 % Proving...
% 1.86/1.27 % SZS status Started for theBenchmark.p
% 1.86/1.27 % SZS status Theorem for theBenchmark.p
% 1.86/1.27
% 1.86/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.86/1.27
% 1.86/1.27 % ------ iProver source info
% 1.86/1.27
% 1.86/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.86/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.86/1.27 % git: non_committed_changes: false
% 1.86/1.27
% 1.86/1.27 % ------ Parsing...
% 1.86/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.86/1.27
% 1.86/1.27 % ------ 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 %
% 1.86/1.27
% 1.86/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.86/1.27
% 1.86/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.86/1.27 % ------ Proving...
% 1.86/1.27 % ------ Problem Properties
% 1.86/1.27
% 1.86/1.27 %
% 1.86/1.27 % clauses 30
% 1.86/1.27 % conjectures 0
% 1.86/1.27 % EPR 24
% 1.86/1.27 % Horn 24
% 1.86/1.27 % unary 15
% 1.86/1.27 % binary 4
% 1.86/1.27 % lits 59
% 1.86/1.27 % lits eq 22
% 1.86/1.27 % fd_pure 0
% 1.86/1.27 % fd_pseudo 0
% 1.86/1.27 % fd_cond 3
% 1.86/1.27 % fd_pseudo_cond 3
% 1.86/1.27 % AC symbols 0
% 1.86/1.27
% 1.86/1.27 % ------ Schedule dynamic 5 is on
% 1.86/1.27
% 1.86/1.27 % ------ no conjectures: strip conj schedule
% 1.86/1.27
% 1.86/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.86/1.27
% 1.86/1.27
% 1.86/1.27 % ------
% 1.86/1.27 % Current options:
% 1.86/1.27 % ------
% 1.86/1.27
% 1.86/1.27
% 1.86/1.27 %
% 1.86/1.27
% 1.86/1.27 % ------ Proving...
% 1.86/1.27 %
% 1.86/1.27
% 1.86/1.27 % SZS status Theorem for theBenchmark.p
% 1.86/1.27
% 1.86/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.86/1.27
% 1.86/1.27
%------------------------------------------------------------------------------