%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT106+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 : n016.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:05 PM UTC 2026
% Result : Unsatisfiable 1.98s 1.28s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 18 unt; 0 def)
% Number of atoms : 77 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 67 ( 30 ~; 27 |; 5 &)
% ( 1 <=>; 4 =>; 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 : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 55 ( 0 sgn 55 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : ~ less(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
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(f7,axiom,
! [X0,X1,X2] :
( ( less(X1,X2)
& leq(X0,X1) )
=> less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_less_trans) ).
fof(f11,axiom,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
<=> ( leq(X0,X2)
& less(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(f32,axiom,
less(v600,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(f35,axiom,
in_lopen(w,v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wit_in_lopen) ).
fof(f36,axiom,
leq(v800,w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wit_leq) ).
fof(f37,plain,
! [X0,X1,X2] :
( in_lopen(X0,X1,X2)
=> ( leq(X0,X2)
& less(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f44,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f5]) ).
fof(f45,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(flattening,[],[f47]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ in_lopen(X0,X1,X2)
| ( leq(X0,X2)
& less(X1,X0) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f66,plain,
! [X0] : ~ less(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f72,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f45]) ).
fof(f73,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f74,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f77,plain,
! [X2,X0,X1] :
( ~ in_lopen(X0,X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f93,plain,
less(v600,v800),
inference(cnf_transformation,[],[f32]) ).
fof(f97,plain,
in_lopen(w,v0,v600),
inference(cnf_transformation,[],[f35]) ).
fof(f98,plain,
leq(v800,w),
inference(cnf_transformation,[],[f36]) ).
tcf(c_49,plain,
! [X0: $i] : ~ less(X0,X0),
inference(cnf_transformation,[],[f66]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ leq(X1,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X2,X1)
| ~ leq(X2,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ in_lopen(X0,X1,X2) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_76,plain,
less(v600,v800),
inference(cnf_transformation,[],[f93]) ).
tcf(c_80,plain,
in_lopen(w,v0,v600),
inference(cnf_transformation,[],[f97]) ).
tcf(c_81,plain,
leq(v800,w),
inference(cnf_transformation,[],[f98]) ).
tcf(c_325,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ( X2 != v600 )
| ( X1 != v0 )
| ( X0 != w ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_80]) ).
tcf(c_326,plain,
leq(w,v600),
inference(unflattening,[status(thm)],[c_325]) ).
tcf(c_950,plain,
! [X0: $i] :
( less(X0,v800)
| ~ leq(X0,v600) ),
inference(superposition,[status(thm)],[c_76,c_57]) ).
tcf(c_1050,plain,
less(w,v800),
inference(superposition,[status(thm)],[c_326,c_950]) ).
tcf(c_1060,plain,
leq(w,v800),
inference(superposition,[status(thm)],[c_1050,c_56]) ).
tcf(c_1213,plain,
( ( v800 = w )
| ~ leq(v800,w) ),
inference(superposition,[status(thm)],[c_1060,c_55]) ).
tcf(c_1218,plain,
v800 = w,
inference(forward_subsumption_resolution,[status(thm)],[c_1213,c_81]) ).
tcf(c_1220,plain,
less(v800,v800),
inference(demodulation,[status(thm)],[c_1050,c_1218]) ).
tcf(c_1228,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1220,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT106+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.36 % Computer : n016.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:29:11 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 1.98/1.28 % SZS status Started for theBenchmark.p
% 1.98/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.98/1.28
% 1.98/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.98/1.28
% 1.98/1.28 % ------ iProver source info
% 1.98/1.28
% 1.98/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.98/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.98/1.28 % git: non_committed_changes: false
% 1.98/1.28
% 1.98/1.28 % ------ Parsing...
% 1.98/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.98/1.28
% 1.98/1.28 % ------ 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.98/1.28
% 1.98/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.98/1.28
% 1.98/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.98/1.28 % ------ Proving...
% 1.98/1.28 % ------ Problem Properties
% 1.98/1.28
% 1.98/1.28 %
% 1.98/1.28 % clauses 31
% 1.98/1.28 % conjectures 0
% 1.98/1.28 % EPR 25
% 1.98/1.28 % Horn 25
% 1.98/1.28 % unary 17
% 1.98/1.28 % binary 3
% 1.98/1.28 % lits 59
% 1.98/1.28 % lits eq 22
% 1.98/1.28 % fd_pure 0
% 1.98/1.28 % fd_pseudo 0
% 1.98/1.28 % fd_cond 3
% 1.98/1.28 % fd_pseudo_cond 3
% 1.98/1.28 % AC symbols 0
% 1.98/1.28
% 1.98/1.28 % ------ Schedule dynamic 5 is on
% 1.98/1.28
% 1.98/1.28 % ------ no conjectures: strip conj schedule
% 1.98/1.28
% 1.98/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.98/1.28
% 1.98/1.28
% 1.98/1.28 % ------
% 1.98/1.28 % Current options:
% 1.98/1.28 % ------
% 1.98/1.28
% 1.98/1.28
% 1.98/1.28 %
% 1.98/1.28
% 1.98/1.28 % ------ Proving...
% 1.98/1.28 %
% 1.98/1.28
% 1.98/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 1.98/1.28
% 1.98/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.98/1.28
% 1.98/1.28
%------------------------------------------------------------------------------