%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% 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.16s 1.19s
% Output : CNFRefutation 1.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 42 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 44 ( 21 ~; 16 |; 5 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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-4 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?; 7 :)
% 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(f35,axiom,
! [X0,X1] :
( prec(X0,X1,o,o)
<=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+5.ax',prec_oo) ).
fof(f48,conjecture,
prec(v5,v5,o,o),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl604) ).
fof(f49,negated_conjecture,
~ prec(v5,v5,o,o),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
~ prec(v5,v5,o,o),
inference(flattening,[],[f49]) ).
fof(f85,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f86,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f85]) ).
fof(f90,plain,
! [X0,X1] :
( ( ~ prec(X0,X1,o,o)
| leq(X0,X1) )
& ( ~ leq(X0,X1)
| prec(X0,X1,o,o) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f95,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
fof(f126,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| prec(X0,X1,o,o) ),
inference(cnf_transformation,[],[f90]) ).
fof(f127,plain,
~ prec(v5,v5,o,o),
inference(cnf_transformation,[],[f50]) ).
fof(f128,plain,
! [X1] : leq(X1,X1),
inference(equality_resolution,[],[f95]) ).
tcf(c_53,plain,
! [X0: $i] : leq(X0,X0),
inference(cnf_transformation,[],[f128]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( prec(X0,X1,o,o)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_85,negated_conjecture,
~ prec(v5,v5,o,o),
inference(cnf_transformation,[],[f127]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] :
( prec(X0,X1,o,o)
| ~ leq(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_83]) ).
tcf(c_513,plain,
! [X0: $i,X1: $i] :
( ~ leq(X0,X1)
| ( o != o )
| ( X1 != v5 )
| ( X0 != v5 ) ),
inference(resolution_lifted,[status(thm)],[c_125,c_85]) ).
tcf(c_514,plain,
~ leq(v5,v5),
inference(unflattening,[status(thm)],[c_513]) ).
tcf(c_517,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_514,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT089+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 % Computer : n018.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Thu Sep 24 01:24:18 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 1.16/1.19 % SZS status Started for theBenchmark.p
% 1.16/1.19 % SZS status Theorem for theBenchmark.p
% 1.16/1.19
% 1.16/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.16/1.19
% 1.16/1.19 % ------ iProver source info
% 1.16/1.19
% 1.16/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 1.16/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.16/1.19 % git: non_committed_changes: false
% 1.16/1.19
% 1.16/1.19 % ------ Parsing...
% 1.16/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.16/1.19
% 1.16/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s%
% 1.16/1.19
% 1.16/1.19 % SZS status Theorem for theBenchmark.p
% 1.16/1.19
% 1.16/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.16/1.19
% 1.16/1.19
%------------------------------------------------------------------------------