%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT092+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 : n004.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:04 PM UTC 2026
% Result : Theorem 0.92s 6.30s
% Output : CNFRefutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 18 unt; 0 def)
% Number of atoms : 122 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 153 ( 75 ~; 66 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 79 ( 0 sgn 79 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(f11,axiom,
! [X0,X1,X2,X3] :
( ( less(X0,X1)
& leq(X1,X3)
& leq(X2,X1)
& leq(X0,X3)
& leq(X2,X0) )
=> completion_conflict(X0,X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+4.ax',completion_conflict) ).
fof(f13,axiom,
! [X0,X1,X2,X3] :
( ( leq(X1,X3)
& less(X0,X1)
& leq(X0,X3)
& leq(X2,X0) )
=> completion_conflict(X0,X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+4.ax',sharpness_conflict) ).
fof(f38,axiom,
less(v0,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v400) ).
fof(f39,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(f40,axiom,
less(v800,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v800_v1200) ).
fof(f42,conjecture,
completion_conflict(v400,v800,v0,v1200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl633) ).
fof(f43,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f44,plain,
~ completion_conflict(v400,v800,v0,v1200),
inference(flattening,[],[f43]) ).
fof(f56,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f61]) ).
fof(f63,plain,
! [X0,X1,X2,X3] :
( ~ less(X0,X1)
| ~ leq(X1,X3)
| ~ leq(X2,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f11]) ).
fof(f64,plain,
! [X0,X1,X2,X3] :
( ~ less(X0,X1)
| ~ leq(X1,X3)
| ~ leq(X2,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(flattening,[],[f63]) ).
fof(f65,plain,
! [X0,X1,X2,X3] :
( ~ leq(X1,X3)
| ~ less(X0,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f13]) ).
fof(f66,plain,
! [X0,X1,X2,X3] :
( ~ leq(X1,X3)
| ~ less(X0,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(flattening,[],[f65]) ).
fof(f97,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f100,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f62]) ).
fof(f101,plain,
! [X2,X3,X0,X1] :
( ~ less(X0,X1)
| ~ leq(X1,X3)
| ~ leq(X2,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f64]) ).
fof(f102,plain,
! [X2,X3,X0,X1] :
( ~ leq(X1,X3)
| ~ less(X0,X1)
| ~ leq(X0,X3)
| ~ leq(X2,X0)
| completion_conflict(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f66]) ).
fof(f126,plain,
less(v0,v400),
inference(cnf_transformation,[],[f38]) ).
fof(f127,plain,
less(v400,v800),
inference(cnf_transformation,[],[f39]) ).
fof(f128,plain,
less(v800,v1200),
inference(cnf_transformation,[],[f40]) ).
fof(f135,plain,
~ completion_conflict(v400,v800,v0,v1200),
inference(cnf_transformation,[],[f44]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X1)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ leq(X0,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ leq(X0,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_85,plain,
less(v0,v400),
inference(cnf_transformation,[],[f126]) ).
tcf(c_86,plain,
less(v400,v800),
inference(cnf_transformation,[],[f127]) ).
tcf(c_87,plain,
less(v800,v1200),
inference(cnf_transformation,[],[f128]) ).
tcf(c_94,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
inference(cnf_transformation,[],[f135]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_56,c_59,c_61]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ less(X0,X1)
| ~ leq(X1,X2)
| ~ leq(X3,X0) ),
inference(global_subsumption_just,[status(thm)],[c_60,c_120]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( completion_conflict(X0,X1,X3,X2)
| ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ less(X0,X1) ),
inference(renaming,[status(thm)],[c_122]) ).
tcf(c_448,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ leq(X3,X0)
| ~ leq(X1,X2)
| ~ less(X0,X1)
| ( X3 != v0 )
| ( X2 != v1200 )
| ( X1 != v800 )
| ( X0 != v400 ) ),
inference(resolution_lifted,[status(thm)],[c_123,c_94]) ).
tcf(c_449,plain,
( ~ leq(v800,v1200)
| ~ leq(v0,v400)
| ~ less(v400,v800) ),
inference(unflattening,[status(thm)],[c_448]) ).
tcf(c_450,plain,
( ~ leq(v800,v1200)
| ~ leq(v0,v400) ),
inference(global_subsumption_just,[status(thm)],[c_449,c_86,c_449]) ).
tcf(c_886,plain,
( ~ leq(v800,v1200)
| ~ leq(v0,v400) ),
inference(demodulation,[status(thm)],[c_450]) ).
tcf(c_1334,plain,
leq(v0,v400),
inference(superposition,[status(thm)],[c_85,c_56]) ).
tcf(c_1336,plain,
leq(v800,v1200),
inference(superposition,[status(thm)],[c_87,c_56]) ).
tcf(c_1337,plain,
~ leq(v800,v1200),
inference(backward_subsumption_resolution,[status(thm)],[c_886,c_1334]) ).
tcf(c_1338,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1337,c_1336]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT092+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.10/5.38 % Computer : n004.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 01:22:56 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 0.92/6.30 % SZS status Started for theBenchmark.p
% 0.92/6.30 % SZS status Theorem for theBenchmark.p
% 0.92/6.30
% 0.92/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.92/6.30
% 0.92/6.30 % ------ iProver source info
% 0.92/6.30
% 0.92/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.92/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.92/6.30 % git: non_committed_changes: false
% 0.92/6.30
% 0.92/6.30 % ------ Parsing...
% 0.92/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.92/6.30
% 0.92/6.30 % ------ 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 %
% 0.92/6.30
% 0.92/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.92/6.30
% 0.92/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.92/6.30 % ------ Proving...
% 0.92/6.30 % ------ Problem Properties
% 0.92/6.30
% 0.92/6.30 %
% 0.92/6.30 % clauses 43
% 0.92/6.30 % conjectures 0
% 0.92/6.30 % EPR 33
% 0.92/6.30 % Horn 34
% 0.92/6.30 % unary 18
% 0.92/6.30 % binary 10
% 0.92/6.30 % lits 86
% 0.92/6.30 % lits eq 25
% 0.92/6.30 % fd_pure 0
% 0.92/6.30 % fd_pseudo 0
% 0.92/6.30 % fd_cond 3
% 0.92/6.30 % fd_pseudo_cond 3
% 0.92/6.30 % AC symbols 0
% 0.92/6.30
% 0.92/6.30 % ------ Schedule dynamic 5 is on
% 0.92/6.30
% 0.92/6.30 % ------ no conjectures: strip conj schedule
% 0.92/6.30
% 0.92/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.92/6.30
% 0.92/6.30
% 0.92/6.30 % ------
% 0.92/6.30 % Current options:
% 0.92/6.30 % ------
% 0.92/6.30
% 0.92/6.30
% 0.92/6.30 %
% 0.92/6.30
% 0.92/6.30 % ------ Proving...
% 0.92/6.30 %
% 0.92/6.30
% 0.92/6.30 % SZS status Theorem for theBenchmark.p
% 0.92/6.30
% 0.92/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.92/6.30
% 0.92/6.30
%------------------------------------------------------------------------------