%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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 03:16:21 PM UTC 2026
% Result : Theorem 3.67s 1.27s
% Output : CNFRefutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 17 unt; 1 def)
% Number of atoms : 69 ( 3 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 61 ( 26 ~; 19 |; 13 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : leq(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(f53,conjecture,
( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).
fof(f54,negated_conjecture,
~ ( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f66,axiom,
gt(n5,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_5_0) ).
fof(f143,plain,
( leq(pv10,minus(n135300,n1))
& leq(n0,pv10)
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( leq(pv10,minus(n135300,n1))
& leq(n0,pv10)
& ( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ) ),
inference(flattening,[],[f143]) ).
fof(f164,plain,
! [X0,X1] :
( ( ~ leq(X0,pred(X1))
| gt(X1,X0) )
& ( ~ gt(X1,X0)
| leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f200,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f205,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,pred(X1)) ),
inference(cnf_transformation,[],[f164]) ).
fof(f287,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f307,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f144]) ).
fof(f308,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f144]) ).
fof(f309,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f321,plain,
gt(n5,n0),
inference(cnf_transformation,[],[f66]) ).
fof(f349,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,minus(X1,n1)) ),
inference(definition_unfolding,[],[f205,f287]) ).
tcf(c_52,plain,
! [X0: $i] : leq(X0,X0),
inference(cnf_transformation,[],[f200]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leq(X1,minus(X0,n1))
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f349]) ).
tcf(c_157,negated_conjecture,
( ~ leq(n0,pv10)
| ~ leq(n0,n0)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1)) ),
inference(cnf_transformation,[],[f309]) ).
tcf(c_158,negated_conjecture,
leq(n0,pv10),
inference(cnf_transformation,[],[f308]) ).
tcf(c_159,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f307]) ).
tcf(c_171,plain,
gt(n5,n0),
inference(cnf_transformation,[],[f321]) ).
tcf(c_199,plain,
leq(n0,n0),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_289,negated_conjecture,
~ leq(n0,minus(n5,n1)),
inference(global_subsumption_just,[status(thm)],[c_157,c_158,c_199,c_159,c_157]) ).
tcf(c_5816,definition,
iPr_def_10 = minus(n5,n1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_5818,negated_conjecture,
~ leq(n0,iPr_def_10),
inference(demodulation,[status(thm)],[c_289,c_5816]) ).
tcf(c_8775,plain,
! [X0: $i] :
( leq(X0,iPr_def_10)
| ~ gt(n5,X0) ),
inference(superposition,[status(thm)],[c_5816,c_56]) ).
tcf(c_8788,plain,
( leq(n0,iPr_def_10)
| ~ gt(n5,n0) ),
inference(instantiation,[status(thm)],[c_8775]) ).
tcf(c_8789,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8788,c_5818,c_171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n020.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 18:27:18 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 3.67/1.27 % SZS status Started for theBenchmark.p
% 3.67/1.27 % SZS status Theorem for theBenchmark.p
% 3.67/1.27
% 3.67/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.67/1.27
% 3.67/1.27 % ------ iProver source info
% 3.67/1.27
% 3.67/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.67/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.67/1.27 % git: non_committed_changes: false
% 3.67/1.27
% 3.67/1.27 % ------ Parsing...
% 3.67/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.67/1.27
% 3.67/1.27 % ------ Preprocessing... sup_sim: 15 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.67/1.27
% 3.67/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.67/1.27
% 3.67/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.67/1.27 % ------ Proving...
% 3.67/1.27 % ------ Problem Properties
% 3.67/1.27
% 3.67/1.27 %
% 3.67/1.27 % clauses 152
% 3.67/1.27 % conjectures 3
% 3.67/1.27 % EPR 46
% 3.67/1.27 % Horn 102
% 3.67/1.27 % unary 58
% 3.67/1.27 % binary 34
% 3.67/1.27 % lits 491
% 3.67/1.27 % lits eq 115
% 3.67/1.27 % fd_pure 0
% 3.67/1.27 % fd_pseudo 0
% 3.67/1.27 % fd_cond 6
% 3.67/1.27 % fd_pseudo_cond 4
% 3.67/1.27 % AC symbols 0
% 3.67/1.27
% 3.67/1.27 % ------ Schedule dynamic 5 is on
% 3.67/1.27
% 3.67/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.67/1.27
% 3.67/1.27
% 3.67/1.27 % ------
% 3.67/1.27 % Current options:
% 3.67/1.27 % ------
% 3.67/1.27
% 3.67/1.27
% 3.67/1.27 %
% 3.67/1.27
% 3.67/1.27 % ------ Proving...
% 3.67/1.27 %
% 3.67/1.27
% 3.67/1.27 % SZS status Theorem for theBenchmark.p
% 3.67/1.27
% 3.67/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.67/1.27
% 3.67/1.27
%------------------------------------------------------------------------------