%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV156+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 : n017.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:33 PM UTC 2026
% Result : Theorem 3.98s 16.45s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 113 ( 33 equ)
% Maximal formula atoms : 15 ( 5 avg)
% Number of connectives : 120 ( 29 ~; 21 |; 59 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 8 ( 2 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 : 22 ( 22 usr; 12 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 29 !; 3 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
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,
( ( ! [X1] :
( ( leq(X1,pred(pv10))
& leq(n0,X1) )
=> sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 )
& ! [X0] :
( ( leq(X0,pred(pv12))
& leq(n0,X0) )
=> a_select3(q,pv10,X0) = divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
=> ! [X2] :
( ( leq(X2,pred(pv10))
& leq(n0,X2) )
=> ( pv10 = X2
=> sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index))) = n1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0006) ).
fof(f54,negated_conjecture,
~ ( ( ! [X1] :
( ( leq(X1,pred(pv10))
& leq(n0,X1) )
=> sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 )
& ! [X0] :
( ( leq(X0,pred(pv12))
& leq(n0,X0) )
=> a_select3(q,pv10,X0) = divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
=> ! [X2] :
( ( leq(X2,pred(pv10))
& leq(n0,X2) )
=> ( pv10 = X2
=> sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index))) = n1 ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( ! [X1] :
( ~ leq(X1,pred(pv10))
| ~ leq(n0,X1)
| sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 )
& ! [X0] :
( ~ leq(X0,pred(pv12))
| ~ leq(n0,X0)
| a_select3(q,pv10,X0) = divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
& ? [X2] :
( leq(X2,pred(pv10))
& leq(n0,X2)
& pv10 = X2
& n1 != sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index))) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( ! [X1] :
( ~ leq(X1,pred(pv10))
| ~ leq(n0,X1)
| sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 )
& ! [X0] :
( ~ leq(X0,pred(pv12))
| ~ leq(n0,X0)
| a_select3(q,pv10,X0) = divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
& ? [X2] :
( leq(X2,pred(pv10))
& leq(n0,X2)
& pv10 = X2
& n1 != sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index))) ) ),
inference(flattening,[],[f94]) ).
fof(f118,plain,
( ! [X2] :
( ~ leq(X2,pred(pv10))
| ~ leq(n0,X2)
| n1 = sum(n0,n4,a_select3(q,X2,tptp_sum_index)) )
& ! [X1] :
( ~ leq(X1,pred(pv12))
| ~ leq(n0,X1)
| a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
& ? [X0] :
( leq(X0,pred(pv10))
& leq(n0,X0)
& pv10 = X0
& n1 != sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X0,tptp_sum_index))) ) ),
inference(rectify,[],[f95]) ).
fof(f119,plain,
( ! [X2] :
( ~ leq(X2,pred(pv10))
| ~ leq(n0,X2)
| n1 = sum(n0,n4,a_select3(q,X2,tptp_sum_index)) )
& ! [X1] :
( ~ leq(X1,pred(pv12))
| ~ leq(n0,X1)
| a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))
& leq(sK0,pred(pv10))
& leq(n0,sK0)
& pv10 = sK0
& n1 != sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,sK0,tptp_sum_index))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f118]) ).
fof(f120,plain,
! [X0,X1] :
( ( ~ leq(X0,pred(X1))
| gt(X1,X0) )
& ( ~ gt(X1,X0)
| leq(X0,pred(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f130,plain,
leq(sK0,pred(pv10)),
inference(cnf_transformation,[],[f119]) ).
fof(f132,plain,
pv10 = sK0,
inference(cnf_transformation,[],[f119]) ).
fof(f139,plain,
! [X0,X1] :
( ~ leq(X0,pred(X1))
| gt(X1,X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f170,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f178,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f206,plain,
leq(sK0,minus(sK0,n1)),
inference(definition_unfolding,[],[f130,f170,f132]) ).
fof(f215,plain,
! [X0,X1] :
( ~ leq(X0,minus(X1,n1))
| gt(X1,X0) ),
inference(definition_unfolding,[],[f139,f170]) ).
tcf(c_51,negated_conjecture,
leq(sK0,minus(sK0,n1)),
inference(cnf_transformation,[],[f206]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( gt(X1,X0)
| ~ leq(X0,minus(X1,n1)) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_102,plain,
! [X0: $i] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f178]) ).
tcf(c_2401,plain,
gt(sK0,sK0),
inference(superposition,[status(thm)],[c_51,c_65]) ).
tcf(c_2405,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2401,c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWV156+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/15.47 % Computer : n017.cluster.edu
% 0.19/15.47 % Model : x86_64 x86_64
% 0.19/15.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/15.47 % Memory : 8046.5625MB
% 0.19/15.47 % OS : Linux 6.8.0-71-generic
% 0.19/15.47 % CPULimit : 300
% 0.19/15.47 % WCLimit : 300
% 0.19/15.47 % DateTime : Thu Sep 24 18:33:47 UTC 2026
% 0.19/15.47 % CPUTime :
% 0.19/15.47 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.23/15.53 Running first-order theorem proving
% 0.23/15.53 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.23/15.55
% 0.23/15.55 % ======== iProver multi-core TPTP/SMT =========
% 0.23/15.55
% 0.23/15.55 % Detected problem language: tptp
% 0.23/15.57 % Proving...
% 3.98/16.45 % SZS status Started for theBenchmark.p
% 3.98/16.45 % SZS status Theorem for theBenchmark.p
% 3.98/16.45
% 3.98/16.45 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.98/16.45
% 3.98/16.45 % ------ iProver source info
% 3.98/16.45
% 3.98/16.45 % git: date: 2026-07-19 20:42:38 +0200
% 3.98/16.45 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.98/16.45 % git: non_committed_changes: false
% 3.98/16.45
% 3.98/16.45 % ------ Parsing...
% 3.98/16.45 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.98/16.45
% 3.98/16.45 % ------ Preprocessing... sup_sim: 11 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 %
% 3.98/16.45
% 3.98/16.45 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.98/16.45
% 3.98/16.45 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.98/16.45 % ------ Proving...
% 3.98/16.45 % ------ Problem Properties
% 3.98/16.45
% 3.98/16.45 %
% 3.98/16.45 % clauses 78
% 3.98/16.45 % conjectures 8
% 3.98/16.45 % EPR 45
% 3.98/16.45 % Horn 71
% 3.98/16.45 % unary 56
% 3.98/16.45 % binary 10
% 3.98/16.45 % lits 127
% 3.98/16.45 % lits eq 45
% 3.98/16.45 % fd_pure 0
% 3.98/16.45 % fd_pseudo 0
% 3.98/16.45 % fd_cond 6
% 3.98/16.45 % fd_pseudo_cond 2
% 3.98/16.45 % AC symbols 0
% 3.98/16.45
% 3.98/16.45 % ------ Schedule dynamic 5 is on
% 3.98/16.45
% 3.98/16.45 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.98/16.45
% 3.98/16.45
% 3.98/16.45 % ------
% 3.98/16.45 % Current options:
% 3.98/16.45 % ------
% 3.98/16.45
% 3.98/16.45
% 3.98/16.45 %
% 3.98/16.45
% 3.98/16.45 % ------ Proving...
% 3.98/16.45 %
% 3.98/16.45
% 3.98/16.45 % SZS status Theorem for theBenchmark.p
% 3.98/16.45
% 3.98/16.45 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.98/16.45
% 3.98/16.45
%------------------------------------------------------------------------------