%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV161+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n026.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:34 PM UTC 2026
% Result : Theorem 4.42s 1.27s
% Output : CNFRefutation 4.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 104 ( 34 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 105 ( 33 ~; 28 |; 36 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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; 8 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 29 !; 3 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1] :
( ( X0 != X1
& leq(X0,X1) )
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(f53,conjecture,
( ( ! [X0] :
( ( leq(X0,pred(pv10))
& leq(n0,X0) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 )
=> ! [X1] :
( ( leq(X1,pv10)
& leq(n0,X1) )
=> sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0011) ).
fof(f54,negated_conjecture,
~ ( ( ! [X0] :
( ( leq(X0,pred(pv10))
& leq(n0,X0) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1 )
=> ! [X1] :
( ( leq(X1,pv10)
& leq(n0,X1) )
=> sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( ! [X0] :
( ~ leq(X0,pred(pv10))
| ~ leq(n0,X0)
| sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& ? [X1] :
( leq(X1,pv10)
& leq(n0,X1)
& n1 != sum(n0,n4,a_select3(q,X1,tptp_sum_index)) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( ! [X0] :
( ~ leq(X0,pred(pv10))
| ~ leq(n0,X0)
| sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& ? [X1] :
( leq(X1,pv10)
& leq(n0,X1)
& n1 != sum(n0,n4,a_select3(q,X1,tptp_sum_index)) ) ),
inference(flattening,[],[f94]) ).
fof(f98,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| gt(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f99,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| gt(X1,X0) ),
inference(flattening,[],[f98]) ).
fof(f117,plain,
( ! [X1] :
( ~ leq(X1,pred(pv10))
| ~ leq(n0,X1)
| n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& ? [X0] :
( leq(X0,pv10)
& leq(n0,X0)
& n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index)) ) ),
inference(rectify,[],[f95]) ).
fof(f118,plain,
( ! [X1] :
( ~ leq(X1,pred(pv10))
| ~ leq(n0,X1)
| n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index)) )
& leq(pv10,n135299)
& leq(n0,pv10)
& sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
& leq(sK0,pv10)
& 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)],[f117]) ).
fof(f119,plain,
! [X0,X1] :
( ( ~ leq(X0,pred(X1))
| gt(X1,X0) )
& ( ~ gt(X1,X0)
| leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f122,plain,
! [X1] :
( ~ leq(X1,pred(pv10))
| ~ leq(n0,X1)
| n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index)) ),
inference(cnf_transformation,[],[f118]) ).
fof(f125,plain,
n1 = sum(n0,n4,a_select3(q,pv10,tptp_sum_index)),
inference(cnf_transformation,[],[f118]) ).
fof(f126,plain,
leq(sK0,pv10),
inference(cnf_transformation,[],[f118]) ).
fof(f127,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f118]) ).
fof(f128,plain,
n1 != sum(n0,n4,a_select3(q,sK0,tptp_sum_index)),
inference(cnf_transformation,[],[f118]) ).
fof(f130,plain,
! [X0,X1] :
( X0 = X1
| ~ leq(X0,X1)
| gt(X1,X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f135,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,pred(X1)) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_49,negated_conjecture,
sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) != n1,
inference(cnf_transformation,[],[f128]) ).
tcf(c_50,negated_conjecture,
leq(n0,sK0),
inference(cnf_transformation,[],[f127]) ).
tcf(c_51,negated_conjecture,
leq(sK0,pv10),
inference(cnf_transformation,[],[f126]) ).
tcf(c_52,negated_conjecture,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
inference(cnf_transformation,[],[f125]) ).
tcf(c_55,negated_conjecture,
! [X0: $i] :
( ( sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
| ~ leq(n0,X0)
| ~ leq(X0,pred(pv10)) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( gt(X1,X0)
| ( X0 = X1 )
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( leq(X1,pred(X0))
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_1648,plain,
! [X0: $i] :
( ( sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
| ~ gt(pv10,X0)
| ~ leq(n0,X0) ),
inference(superposition,[status(thm)],[c_61,c_55]) ).
tcf(c_1706,plain,
( ( sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) = n1 )
| ~ gt(pv10,sK0) ),
inference(superposition,[status(thm)],[c_50,c_1648]) ).
tcf(c_1718,plain,
~ gt(pv10,sK0),
inference(forward_subsumption_resolution,[status(thm)],[c_1706,c_49]) ).
tcf(c_2567,plain,
( gt(pv10,sK0)
| ( sK0 = pv10 ) ),
inference(superposition,[status(thm)],[c_51,c_57]) ).
tcf(c_2593,plain,
sK0 = pv10,
inference(forward_subsumption_resolution,[status(thm)],[c_2567,c_1718]) ).
tcf(c_2603,plain,
sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) != n1,
inference(demodulation,[status(thm)],[c_49,c_2593]) ).
tcf(c_2606,plain,
$false,
inference(ground_joinability,[status(thm)],[c_2603,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV161+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n026.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 18:41:54 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 4.42/1.27 % SZS status Started for theBenchmark.p
% 4.42/1.27 % SZS status Theorem for theBenchmark.p
% 4.42/1.27
% 4.42/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.42/1.27
% 4.42/1.27 % ------ iProver source info
% 4.42/1.27
% 4.42/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 4.42/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.42/1.27 % git: non_committed_changes: false
% 4.42/1.27
% 4.42/1.27 % ------ Parsing...
% 4.42/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.42/1.27
% 4.42/1.27 % ------ Preprocessing... sup_sim: 10 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.42/1.27
% 4.42/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.42/1.27
% 4.42/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.42/1.27 % ------ Proving...
% 4.42/1.27 % ------ Problem Properties
% 4.42/1.27
% 4.42/1.27 %
% 4.42/1.27 % clauses 75
% 4.42/1.27 % conjectures 7
% 4.42/1.27 % EPR 45
% 4.42/1.27 % Horn 68
% 4.42/1.27 % unary 55
% 4.42/1.27 % binary 9
% 4.42/1.27 % lits 121
% 4.42/1.27 % lits eq 44
% 4.42/1.27 % fd_pure 0
% 4.42/1.27 % fd_pseudo 0
% 4.42/1.27 % fd_cond 6
% 4.42/1.27 % fd_pseudo_cond 2
% 4.42/1.27 % AC symbols 0
% 4.42/1.27
% 4.42/1.27 % ------ Schedule dynamic 5 is on
% 4.42/1.27
% 4.42/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.42/1.27
% 4.42/1.27
% 4.42/1.27 % ------
% 4.42/1.27 % Current options:
% 4.42/1.27 % ------
% 4.42/1.27
% 4.42/1.27
% 4.42/1.27 %
% 4.42/1.27
% 4.42/1.27 % ------ Proving...
% 4.42/1.27 %
% 4.42/1.27
% 4.42/1.27 % SZS status Theorem for theBenchmark.p
% 4.42/1.27
% 4.42/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.42/1.27
% 4.42/1.27
%------------------------------------------------------------------------------