%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:01 PM UTC 2026
% Result : Theorem 1.25s 1.26s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 45 ( 3 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 51 ( 26 ~; 19 |; 5 &)
% ( 0 <=>; 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 : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 30 !; 2 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f29,axiom,
! [X0,X1,X2] :
( ( leq(X0,X2)
& leq(X1,X0) )
=> completion_compatible(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+4.ax',completion_compat) ).
fof(f37,axiom,
! [X0] : leq(ninf,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_inf_lb) ).
fof(f38,axiom,
! [X0] : leq(X0,nsup),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_sup_ub) ).
fof(f40,conjecture,
? [X0] :
( completion_compatible(X0,ninf,nsup)
& leq(X0,nsup)
& leq(ninf,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown_sound_compatible) ).
fof(f41,negated_conjecture,
~ ? [X0] :
( completion_compatible(X0,ninf,nsup)
& leq(X0,nsup)
& leq(ninf,X0) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| completion_compatible(X0,X1,X2) ),
inference(ennf_transformation,[],[f29]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| completion_compatible(X0,X1,X2) ),
inference(flattening,[],[f69]) ).
fof(f76,plain,
! [X0] :
( ~ completion_compatible(X0,ninf,nsup)
| ~ leq(X0,nsup)
| ~ leq(ninf,X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ leq(X0,X2)
| ~ leq(X1,X0)
| completion_compatible(X0,X1,X2) ),
inference(cnf_transformation,[],[f70]) ).
fof(f126,plain,
! [X0] : leq(ninf,X0),
inference(cnf_transformation,[],[f37]) ).
fof(f127,plain,
! [X0] : leq(X0,nsup),
inference(cnf_transformation,[],[f38]) ).
fof(f129,plain,
! [X0] :
( ~ completion_compatible(X0,ninf,nsup)
| ~ leq(X0,nsup)
| ~ leq(ninf,X0) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i] :
( completion_compatible(X0,X2,X1)
| ~ leq(X2,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f120]) ).
tcf(c_89,plain,
! [X0: $i] : leq(ninf,X0),
inference(cnf_transformation,[],[f126]) ).
tcf(c_90,plain,
! [X0: $i] : leq(X0,nsup),
inference(cnf_transformation,[],[f127]) ).
tcf(c_92,negated_conjecture,
! [X0: $i] :
( ~ leq(ninf,X0)
| ~ leq(X0,nsup)
| ~ completion_compatible(X0,ninf,nsup) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_117,negated_conjecture,
! [X0: $i] : ~ completion_compatible(X0,ninf,nsup),
inference(global_subsumption_just,[status(thm)],[c_92,c_90,c_89,c_92]) ).
tcf(c_471,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ leq(X3,X0)
| ~ leq(X0,X2)
| ( X3 != ninf )
| ( X2 != nsup )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_83,c_117]) ).
tcf(c_472,plain,
! [X0: $i] :
( ~ leq(ninf,X0)
| ~ leq(X0,nsup) ),
inference(unflattening,[status(thm)],[c_471]) ).
tcf(c_473,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_472,c_89,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 01:17:23 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 1.25/1.26 % SZS status Started for theBenchmark.p
% 1.25/1.26 % SZS status Theorem for theBenchmark.p
% 1.25/1.26
% 1.25/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.25/1.26
% 1.25/1.26 % ------ iProver source info
% 1.25/1.26
% 1.25/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.25/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.25/1.26 % git: non_committed_changes: false
% 1.25/1.26
% 1.25/1.26 % ------ Parsing...
% 1.25/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.25/1.26
% 1.25/1.26 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s %
% 1.25/1.26
% 1.25/1.26 % SZS status Theorem for theBenchmark.p
% 1.25/1.26
% 1.25/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.25/1.26
% 1.25/1.26
%------------------------------------------------------------------------------