%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT082+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 : n015.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 0.40s 1.28s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 19 unt; 0 def)
% Number of atoms : 121 ( 40 equ)
% Maximal formula atoms : 21 ( 2 avg)
% Number of connectives : 130 ( 54 ~; 28 |; 44 &)
% ( 1 <=>; 3 =>; 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 : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 57 ( 0 sgn 48 !; 9 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
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(f10,axiom,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
<=> ( leq(X0,X2)
& leq(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_closed) ).
fof(f55,axiom,
less(v600,v601),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v601) ).
fof(f56,axiom,
( v600 != v601
& v500 != v601
& v500 != v600
& v300 != v601
& v300 != v600
& v300 != v500
& v32 != v601
& v32 != v600
& v32 != v500
& v32 != v300
& v16 != v601
& v16 != v600
& v16 != v500
& v16 != v300
& v16 != v32
& v0 != v601
& v0 != v600
& v0 != v500
& v0 != v300
& v0 != v32
& v0 != v16 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(f57,conjecture,
~ ? [X0,X1,X2] :
( in_lopen(X2,v0,v32)
& leq(v16,X2)
& in_open(X1,v0,v500)
& less(v300,X1)
& in_closed(X0,v601,v601)
& in_closed(X0,v600,v600) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl411) ).
fof(f58,negated_conjecture,
~ ~ ? [X0,X1,X2] :
( in_lopen(X2,v0,v32)
& leq(v16,X2)
& in_open(X1,v0,v500)
& less(v300,X1)
& in_closed(X0,v601,v601)
& in_closed(X0,v600,v600) ),
inference(negated_conjecture,[status(cth)],[f57]) ).
fof(f59,plain,
? [X0,X1,X2] :
( in_lopen(X2,v0,v32)
& leq(v16,X2)
& in_open(X1,v0,v500)
& less(v300,X1)
& in_closed(X0,v601,v601)
& in_closed(X0,v600,v600) ),
inference(flattening,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( in_closed(X0,X1,X2)
=> ( leq(X0,X2)
& leq(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f72,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f5]) ).
fof(f73,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f72]) ).
fof(f74,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f81,plain,
! [X0,X1,X2] :
( ~ in_closed(X0,X1,X2)
| ( leq(X0,X2)
& leq(X1,X0) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f96,plain,
( in_lopen(sK2,v0,v32)
& leq(v16,sK2)
& in_open(sK1,v0,v500)
& less(v300,sK1)
& in_closed(sK0,v601,v601)
& in_closed(sK0,v600,v600) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f59]) ).
fof(f103,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f73]) ).
fof(f104,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
fof(f108,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f81]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ in_closed(X0,X1,X2)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f147,plain,
less(v600,v601),
inference(cnf_transformation,[],[f55]) ).
fof(f148,plain,
v600 != v601,
inference(cnf_transformation,[],[f56]) ).
fof(f173,plain,
in_closed(sK0,v601,v601),
inference(cnf_transformation,[],[f96]) ).
fof(f174,plain,
in_closed(sK0,v600,v600),
inference(cnf_transformation,[],[f96]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X1,X0)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ in_closed(X0,X1,X2) ),
inference(cnf_transformation,[],[f108]) ).
tcf(c_99,plain,
less(v600,v601),
inference(cnf_transformation,[],[f147]) ).
tcf(c_120,plain,
v600 != v601,
inference(cnf_transformation,[],[f148]) ).
tcf(c_121,negated_conjecture,
in_closed(sK0,v600,v600),
inference(cnf_transformation,[],[f174]) ).
tcf(c_122,negated_conjecture,
in_closed(sK0,v601,v601),
inference(cnf_transformation,[],[f173]) ).
tcf(c_511,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ( X2 != v600 )
| ( X1 != v600 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_121]) ).
tcf(c_512,plain,
leq(sK0,v600),
inference(unflattening,[status(thm)],[c_511]) ).
tcf(c_521,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ( X2 != v601 )
| ( X1 != v601 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_122]) ).
tcf(c_522,plain,
leq(sK0,v601),
inference(unflattening,[status(thm)],[c_521]) ).
tcf(c_526,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X1,X0)
| ( X2 != v601 )
| ( X1 != v601 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_60,c_122]) ).
tcf(c_527,plain,
leq(v601,sK0),
inference(unflattening,[status(thm)],[c_526]) ).
tcf(c_830,plain,
leq(v601,sK0),
inference(demodulation,[status(thm)],[c_527]) ).
tcf(c_831,plain,
leq(sK0,v601),
inference(demodulation,[status(thm)],[c_522]) ).
tcf(c_833,plain,
leq(sK0,v600),
inference(demodulation,[status(thm)],[c_512]) ).
tcf(c_1358,plain,
leq(v600,v601),
inference(superposition,[status(thm)],[c_99,c_56]) ).
tcf(c_1839,plain,
( ( v600 = v601 )
| ~ leq(v601,v600)
| ~ leq(v600,v601) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_2152,plain,
( ( v601 = sK0 )
| ~ leq(sK0,v601) ),
inference(superposition,[status(thm)],[c_830,c_55]) ).
tcf(c_2191,plain,
v601 = sK0,
inference(forward_subsumption_resolution,[status(thm)],[c_2152,c_831]) ).
tcf(c_2197,plain,
leq(v601,v600),
inference(demodulation,[status(thm)],[c_833,c_2191]) ).
tcf(c_2201,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2197,c_1839,c_1358,c_120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT082+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.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 01:24:26 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.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...
% 0.40/1.28 % SZS status Started for theBenchmark.p
% 0.40/1.28 % SZS status Theorem for theBenchmark.p
% 0.40/1.28
% 0.40/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.40/1.28
% 0.40/1.28 % ------ iProver source info
% 0.40/1.28
% 0.40/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.40/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.40/1.28 % git: non_committed_changes: false
% 0.40/1.28
% 0.40/1.28 % ------ Parsing...
% 0.40/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.40/1.28
% 0.40/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 0.40/1.28
% 0.40/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.40/1.28
% 0.40/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.40/1.28 % ------ Proving...
% 0.40/1.28 % ------ Problem Properties
% 0.40/1.28
% 0.40/1.28 %
% 0.40/1.28 % clauses 75
% 0.40/1.28 % conjectures 2
% 0.40/1.28 % EPR 69
% 0.40/1.28 % Horn 69
% 0.40/1.28 % unary 61
% 0.40/1.28 % binary 3
% 0.40/1.28 % lits 103
% 0.40/1.28 % lits eq 40
% 0.40/1.28 % fd_pure 0
% 0.40/1.28 % fd_pseudo 0
% 0.40/1.28 % fd_cond 3
% 0.40/1.28 % fd_pseudo_cond 3
% 0.40/1.28 % AC symbols 0
% 0.40/1.28
% 0.40/1.28 % ------ Schedule dynamic 5 is on
% 0.40/1.28
% 0.40/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.40/1.28
% 0.40/1.28
% 0.40/1.28 % ------
% 0.40/1.28 % Current options:
% 0.40/1.28 % ------
% 0.40/1.28
% 0.40/1.28
% 0.40/1.28 %
% 0.40/1.28
% 0.40/1.28 % ------ Proving...
% 0.40/1.28 %
% 0.40/1.28
% 0.40/1.28 % SZS status Theorem for theBenchmark.p
% 0.40/1.28
% 0.40/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.40/1.28
% 0.40/1.28
%------------------------------------------------------------------------------