%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV151+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 : n007.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:32 PM UTC 2026
% Result : Theorem 4.18s 1.31s
% Output : CNFRefutation 4.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 17 unt; 0 def)
% Number of atoms : 61 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 23 ~; 14 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 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 : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 36 ( 0 sgn 34 !; 2 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X1,X2)
& leq(X0,X1) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(f53,conjecture,
! [X0] :
( ( leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0001) ).
fof(f54,negated_conjecture,
~ ! [X0] :
( ( leq(X0,tptp_minus_1)
& leq(n0,X0) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f87,plain,
? [X0] :
( leq(X0,tptp_minus_1)
& leq(n0,X0)
& n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
? [X0] :
( leq(X0,tptp_minus_1)
& leq(n0,X0)
& n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index)) ),
inference(flattening,[],[f87]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f96]) ).
fof(f110,plain,
( leq(sK0,tptp_minus_1)
& leq(n0,sK0)
& n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f88]) ).
fof(f112,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| gt(succ(X1),X0) )
& ( ~ gt(succ(X1),X0)
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f113,plain,
leq(sK0,tptp_minus_1),
inference(cnf_transformation,[],[f110]) ).
fof(f114,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f110]) ).
fof(f120,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(succ(X1),X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f97]) ).
fof(f133,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f153,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f172,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f178,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(plus(n1,X1),X0) ),
inference(definition_unfolding,[],[f120,f172]) ).
fof(f180,plain,
n0 = plus(n1,tptp_minus_1),
inference(definition_unfolding,[],[f133,f172]) ).
tcf(c_50,negated_conjecture,
leq(n0,sK0),
inference(cnf_transformation,[],[f114]) ).
tcf(c_51,negated_conjecture,
leq(sK0,tptp_minus_1),
inference(cnf_transformation,[],[f113]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( gt(plus(n1,X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f178]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_69,plain,
plus(n1,tptp_minus_1) = n0,
inference(cnf_transformation,[],[f180]) ).
tcf(c_89,plain,
! [X0: $i] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f153]) ).
tcf(c_1441,plain,
! [X0: $i] : ~ leq(plus(n1,X0),X0),
inference(superposition,[status(thm)],[c_57,c_89]) ).
tcf(c_1514,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_69,c_1441]) ).
tcf(c_2198,plain,
! [X0: $i] :
( leq(n0,X0)
| ~ leq(sK0,X0) ),
inference(superposition,[status(thm)],[c_50,c_61]) ).
tcf(c_2341,plain,
leq(n0,tptp_minus_1),
inference(superposition,[status(thm)],[c_51,c_2198]) ).
tcf(c_2347,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2341,c_1514]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV151+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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 18:35:37 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 4.18/1.31 % SZS status Started for theBenchmark.p
% 4.18/1.31 % SZS status Theorem for theBenchmark.p
% 4.18/1.31
% 4.18/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.18/1.31
% 4.18/1.31 % ------ iProver source info
% 4.18/1.31
% 4.18/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.18/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.18/1.31 % git: non_committed_changes: false
% 4.18/1.31
% 4.18/1.31 % ------ Parsing...
% 4.18/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.18/1.31
% 4.18/1.31 % ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.18/1.31
% 4.18/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.18/1.31
% 4.18/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.18/1.31 % ------ Proving...
% 4.18/1.31 % ------ Problem Properties
% 4.18/1.31
% 4.18/1.31 %
% 4.18/1.31 % clauses 60
% 4.18/1.31 % conjectures 3
% 4.18/1.31 % EPR 36
% 4.18/1.31 % Horn 53
% 4.18/1.31 % unary 43
% 4.18/1.31 % binary 7
% 4.18/1.31 % lits 102
% 4.18/1.31 % lits eq 40
% 4.18/1.31 % fd_pure 0
% 4.18/1.31 % fd_pseudo 0
% 4.18/1.31 % fd_cond 6
% 4.18/1.31 % fd_pseudo_cond 2
% 4.18/1.31 % AC symbols 0
% 4.18/1.31
% 4.18/1.31 % ------ Schedule dynamic 5 is on
% 4.18/1.31
% 4.18/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.18/1.31
% 4.18/1.31
% 4.18/1.31 % ------
% 4.18/1.31 % Current options:
% 4.18/1.31 % ------
% 4.18/1.31
% 4.18/1.31
% 4.18/1.31 %
% 4.18/1.31
% 4.18/1.31 % ------ Proving...
% 4.18/1.31 %
% 4.18/1.31
% 4.18/1.31 % SZS status Theorem for theBenchmark.p
% 4.18/1.31
% 4.18/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.18/1.31
% 4.18/1.31
%------------------------------------------------------------------------------