%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT083+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 1.69s 1.16s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 54 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 21 ~; 15 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 37 !; 3 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& less(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(f13,axiom,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
<=> ( less(X0,X2)
& less(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_open) ).
fof(f32,conjecture,
~ ? [X0] :
( less(v600,X0)
& in_open(X0,v0,v600) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl423) ).
fof(f33,negated_conjecture,
~ ~ ? [X0] :
( less(v600,X0)
& in_open(X0,v0,v600) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f34,plain,
? [X0] :
( less(v600,X0)
& in_open(X0,v0,v600) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1,X2] :
( in_open(X0,X1,X2)
=> ( less(X0,X2)
& less(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(flattening,[],[f38]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ~ in_open(X0,X1,X2)
| ( less(X0,X2)
& less(X1,X0) ) ),
inference(ennf_transformation,[],[f35]) ).
fof(f62,plain,
( less(v600,sK0)
& in_open(sK0,v0,v600) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f34]) ).
fof(f63,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ less(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f39]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ in_open(X0,X1,X2)
| less(X0,X2) ),
inference(cnf_transformation,[],[f49]) ).
fof(f91,plain,
less(v600,sK0),
inference(cnf_transformation,[],[f62]) ).
fof(f92,plain,
in_open(sK0,v0,v600),
inference(cnf_transformation,[],[f62]) ).
tcf(c_49,plain,
! [X0: $i] : ~ less(X0,X0),
inference(cnf_transformation,[],[f63]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X0,X2)
| ~ in_open(X0,X1,X2) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_77,negated_conjecture,
in_open(sK0,v0,v600),
inference(cnf_transformation,[],[f92]) ).
tcf(c_78,negated_conjecture,
less(v600,sK0),
inference(cnf_transformation,[],[f91]) ).
tcf(c_315,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X0,X2)
| ( X2 != v600 )
| ( X1 != v0 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_77]) ).
tcf(c_316,plain,
less(sK0,v600),
inference(unflattening,[status(thm)],[c_315]) ).
tcf(c_528,plain,
less(sK0,v600),
inference(demodulation,[status(thm)],[c_316]) ).
tcf(c_529,negated_conjecture,
less(v600,sK0),
inference(demodulation,[status(thm)],[c_78]) ).
tcf(c_868,plain,
! [X0: $i] :
( less(v600,X0)
| ~ less(sK0,X0) ),
inference(superposition,[status(thm)],[c_529,c_50]) ).
tcf(c_943,plain,
less(v600,v600),
inference(superposition,[status(thm)],[c_528,c_868]) ).
tcf(c_944,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_943,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT083+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:23:33 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.40 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 1.69/1.16 % SZS status Started for theBenchmark.p
% 1.69/1.16 % SZS status Theorem for theBenchmark.p
% 1.69/1.16
% 1.69/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.69/1.16
% 1.69/1.16 % ------ iProver source info
% 1.69/1.16
% 1.69/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.69/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.69/1.16 % git: non_committed_changes: false
% 1.69/1.16
% 1.69/1.16 % ------ Parsing...
% 1.69/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.69/1.16
% 1.69/1.16 % ------ 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.69/1.16
% 1.69/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.69/1.16
% 1.69/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.69/1.16 % ------ Proving...
% 1.69/1.16 % ------ Problem Properties
% 1.69/1.16
% 1.69/1.16 %
% 1.69/1.16 % clauses 28
% 1.69/1.16 % conjectures 1
% 1.69/1.16 % EPR 22
% 1.69/1.16 % Horn 22
% 1.69/1.16 % unary 14
% 1.69/1.16 % binary 3
% 1.69/1.16 % lits 56
% 1.69/1.16 % lits eq 20
% 1.69/1.16 % fd_pure 0
% 1.69/1.16 % fd_pseudo 0
% 1.69/1.16 % fd_cond 3
% 1.69/1.16 % fd_pseudo_cond 3
% 1.69/1.16 % AC symbols 0
% 1.69/1.16
% 1.69/1.16 % ------ Schedule dynamic 5 is on
% 1.69/1.16
% 1.69/1.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.69/1.16
% 1.69/1.16
% 1.69/1.16 % ------
% 1.69/1.16 % Current options:
% 1.69/1.16 % ------
% 1.69/1.16
% 1.69/1.16
% 1.69/1.16 %
% 1.69/1.16
% 1.69/1.16 % ------ Proving...
% 1.69/1.16 %
% 1.69/1.16
% 1.69/1.16 % SZS status Theorem for theBenchmark.p
% 1.69/1.16
% 1.69/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/1.16
% 1.69/1.16
%------------------------------------------------------------------------------