%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT090+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 : n014.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.22s 1.19s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 71 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 76 ( 36 ~; 28 |; 10 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1] :
( less(X0,X1)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_implies_leq) ).
fof(f31,axiom,
! [X0,X1,X2] :
( wf(lt,X0,X1,X2)
<=> ( X0 != X1
& leq(X0,X2)
& leq(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+8.ax',wf_lt) ).
fof(f57,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(f58,axiom,
less(v600,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v1200) ).
fof(f59,axiom,
( v600 != v1200
& v0 != v1200
& v0 != v600 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(f60,conjecture,
wf(lt,v600,v0,v1200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl613) ).
fof(f61,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(negated_conjecture,[status(cth)],[f60]) ).
fof(f62,plain,
~ wf(lt,v600,v0,v1200),
inference(flattening,[],[f61]) ).
fof(f75,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( ~ wf(lt,X0,X1,X2)
| ( X0 != X1
& leq(X0,X2)
& leq(X1,X0) ) )
& ( X0 = X1
| ~ leq(X0,X2)
| ~ leq(X1,X0)
| wf(lt,X0,X1,X2) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f103,plain,
! [X0,X1,X2] :
( ( ~ wf(lt,X0,X1,X2)
| ( X0 != X1
& leq(X0,X2)
& leq(X1,X0) ) )
& ( X0 = X1
| ~ leq(X0,X2)
| ~ leq(X1,X0)
| wf(lt,X0,X1,X2) ) ),
inference(flattening,[],[f102]) ).
fof(f113,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f142,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ leq(X0,X2)
| ~ leq(X1,X0)
| wf(lt,X0,X1,X2) ),
inference(cnf_transformation,[],[f103]) ).
fof(f163,plain,
less(v0,v600),
inference(cnf_transformation,[],[f57]) ).
fof(f164,plain,
less(v600,v1200),
inference(cnf_transformation,[],[f58]) ).
fof(f167,plain,
v0 != v600,
inference(cnf_transformation,[],[f59]) ).
fof(f168,plain,
~ wf(lt,v600,v0,v1200),
inference(cnf_transformation,[],[f62]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i] :
( wf(lt,X0,X2,X1)
| ( X0 = X2 )
| ~ leq(X2,X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
tcf(c_106,plain,
less(v0,v600),
inference(cnf_transformation,[],[f163]) ).
tcf(c_107,plain,
less(v600,v1200),
inference(cnf_transformation,[],[f164]) ).
tcf(c_108,plain,
v0 != v600,
inference(cnf_transformation,[],[f167]) ).
tcf(c_111,negated_conjecture,
~ wf(lt,v600,v0,v1200),
inference(cnf_transformation,[],[f168]) ).
tcf(c_674,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ~ leq(X2,X0)
| ~ leq(X0,X1)
| ( lt != lt )
| ( X2 != v0 )
| ( X1 != v1200 )
| ( X0 != v600 ) ),
inference(resolution_lifted,[status(thm)],[c_82,c_111]) ).
tcf(c_675,plain,
( ( v600 = v0 )
| ~ leq(v600,v1200)
| ~ leq(v0,v600) ),
inference(unflattening,[status(thm)],[c_674]) ).
tcf(c_935,plain,
( ( v600 = v0 )
| ~ leq(v600,v1200)
| ~ leq(v0,v600) ),
inference(demodulation,[status(thm)],[c_675]) ).
tcf(c_1317,plain,
leq(v0,v600),
inference(superposition,[status(thm)],[c_106,c_56]) ).
tcf(c_1318,plain,
leq(v600,v1200),
inference(superposition,[status(thm)],[c_107,c_56]) ).
tcf(c_1319,plain,
( ( v0 = v600 )
| ~ leq(v600,v1200) ),
inference(backward_subsumption_resolution,[status(thm)],[c_935,c_1317]) ).
tcf(c_1320,plain,
v0 = v600,
inference(forward_subsumption_resolution,[status(thm)],[c_1319,c_1318]) ).
tcf(c_1321,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1320,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT090+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.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 01:22:19 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.10/0.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 0.22/1.19 % SZS status Started for theBenchmark.p
% 0.22/1.19 % SZS status Theorem for theBenchmark.p
% 0.22/1.19
% 0.22/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.22/1.19
% 0.22/1.19 % ------ iProver source info
% 0.22/1.19
% 0.22/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 0.22/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.22/1.19 % git: non_committed_changes: false
% 0.22/1.19
% 0.22/1.19 % ------ Parsing...
% 0.22/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.22/1.19
% 0.22/1.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 0.22/1.19
% 0.22/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.22/1.19
% 0.22/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.22/1.19 % ------ Proving...
% 0.22/1.19 % ------ Problem Properties
% 0.22/1.19
% 0.22/1.19 %
% 0.22/1.19 % clauses 39
% 0.22/1.19 % conjectures 0
% 0.22/1.19 % EPR 33
% 0.22/1.19 % Horn 33
% 0.22/1.19 % unary 24
% 0.22/1.19 % binary 3
% 0.22/1.19 % lits 69
% 0.22/1.19 % lits eq 33
% 0.22/1.19 % fd_pure 0
% 0.22/1.19 % fd_pseudo 0
% 0.22/1.19 % fd_cond 3
% 0.22/1.19 % fd_pseudo_cond 3
% 0.22/1.19 % AC symbols 0
% 0.22/1.19
% 0.22/1.19 % ------ Schedule dynamic 5 is on
% 0.22/1.19
% 0.22/1.19 % ------ no conjectures: strip conj schedule
% 0.22/1.19
% 0.22/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.22/1.19
% 0.22/1.19
% 0.22/1.19 % ------
% 0.22/1.19 % Current options:
% 0.22/1.19 % ------
% 0.22/1.19
% 0.22/1.19
% 0.22/1.19 %
% 0.22/1.19
% 0.22/1.19 % ------ Proving...
% 0.22/1.19 %
% 0.22/1.19
% 0.22/1.19 % SZS status Theorem for theBenchmark.p
% 0.22/1.19
% 0.22/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.22/1.19
% 0.22/1.19
%------------------------------------------------------------------------------