%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MGT076+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 : n015.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:02 PM UTC 2026
% Result : Theorem 2.64s 1.44s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 74 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 27 ~; 27 |; 7 &)
% ( 1 <=>; 4 =>; 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 37 ( 0 sgn 36 !; 1 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
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(f33,axiom,
less(v400,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(f35,conjecture,
! [X0] :
( leq(v800,X0)
=> leq(v400,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl311) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( leq(v800,X0)
=> leq(v400,X0) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f44,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(flattening,[],[f45]) ).
fof(f61,plain,
? [X0] :
( leq(v800,X0)
& ~ leq(v400,X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f62,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f63,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| leq(X0,X1) ) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
( leq(v800,sK0)
& ~ leq(v400,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f61]) ).
fof(f68,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| less(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f72,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f73,plain,
! [X2,X0,X1] :
( ~ less(X1,X2)
| ~ leq(X0,X1)
| less(X0,X2) ),
inference(cnf_transformation,[],[f46]) ).
fof(f91,plain,
less(v400,v800),
inference(cnf_transformation,[],[f33]) ).
fof(f95,plain,
leq(v800,sK0),
inference(cnf_transformation,[],[f64]) ).
fof(f96,plain,
~ leq(v400,sK0),
inference(cnf_transformation,[],[f64]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| ( X0 = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X2,X1)
| ~ leq(X2,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_75,plain,
less(v400,v800),
inference(cnf_transformation,[],[f91]) ).
tcf(c_79,negated_conjecture,
~ leq(v400,sK0),
inference(cnf_transformation,[],[f96]) ).
tcf(c_80,negated_conjecture,
leq(v800,sK0),
inference(cnf_transformation,[],[f95]) ).
tcf(c_515,negated_conjecture,
leq(v800,sK0),
inference(demodulation,[status(thm)],[c_80]) ).
tcf(c_516,negated_conjecture,
~ leq(v400,sK0),
inference(demodulation,[status(thm)],[c_79]) ).
tcf(c_841,plain,
leq(v400,v800),
inference(superposition,[status(thm)],[c_75,c_56]) ).
tcf(c_856,plain,
( less(v800,sK0)
| ( v800 = sK0 ) ),
inference(superposition,[status(thm)],[c_515,c_54]) ).
tcf(c_939,plain,
! [X0: $i] :
( less(X0,sK0)
| ( v800 = sK0 )
| ~ leq(X0,v800) ),
inference(superposition,[status(thm)],[c_856,c_57]) ).
tcf(c_969,plain,
( less(v400,sK0)
| ( v800 = sK0 ) ),
inference(superposition,[status(thm)],[c_841,c_939]) ).
tcf(c_1010,plain,
( leq(v400,sK0)
| ( v800 = sK0 ) ),
inference(superposition,[status(thm)],[c_969,c_56]) ).
tcf(c_1012,plain,
v800 = sK0,
inference(forward_subsumption_resolution,[status(thm)],[c_1010,c_516]) ).
tcf(c_1013,plain,
~ leq(v400,v800),
inference(demodulation,[status(thm)],[c_516,c_1012]) ).
tcf(c_1015,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1013,c_841]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT076+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 : n015.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:23:55 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/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.14/0.44
% 0.14/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.44
% 0.14/0.44 % Detected problem language: tptp
% 0.14/0.47 % Proving...
% 2.64/1.44 % SZS status Started for theBenchmark.p
% 2.64/1.44 % SZS status Theorem for theBenchmark.p
% 2.64/1.44
% 2.64/1.44 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.64/1.44
% 2.64/1.44 % ------ iProver source info
% 2.64/1.44
% 2.64/1.44 % git: date: 2026-07-19 20:42:38 +0200
% 2.64/1.44 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.64/1.44 % git: non_committed_changes: false
% 2.64/1.44
% 2.64/1.44 % ------ Parsing...
% 2.64/1.44 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.64/1.44
% 2.64/1.44 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.64/1.44
% 2.64/1.44 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.64/1.44
% 2.64/1.44 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.64/1.44 % ------ Proving...
% 2.64/1.44 % ------ Problem Properties
% 2.64/1.44
% 2.64/1.44 %
% 2.64/1.44 % clauses 31
% 2.64/1.44 % conjectures 2
% 2.64/1.44 % EPR 25
% 2.64/1.44 % Horn 25
% 2.64/1.44 % unary 17
% 2.64/1.44 % binary 3
% 2.64/1.44 % lits 59
% 2.64/1.44 % lits eq 22
% 2.64/1.44 % fd_pure 0
% 2.64/1.44 % fd_pseudo 0
% 2.64/1.44 % fd_cond 3
% 2.64/1.44 % fd_pseudo_cond 3
% 2.64/1.44 % AC symbols 0
% 2.64/1.44
% 2.64/1.44 % ------ Schedule dynamic 5 is on
% 2.64/1.44
% 2.64/1.44 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.64/1.44
% 2.64/1.44
% 2.64/1.44 % ------
% 2.64/1.44 % Current options:
% 2.64/1.44 % ------
% 2.64/1.44
% 2.64/1.44
% 2.64/1.44 %
% 2.64/1.44
% 2.64/1.44 % ------ Proving...
% 2.64/1.44 %
% 2.64/1.44
% 2.64/1.44 % SZS status Theorem for theBenchmark.p
% 2.64/1.44
% 2.64/1.44 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.64/1.44
% 2.64/1.44
%------------------------------------------------------------------------------