%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV155+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 : n002.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 2.02s 6.10s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 18 unt; 3 def)
% Number of atoms : 137 ( 46 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 135 ( 41 ~; 26 |; 58 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-3 aty)
% Number of variables : 23 ( 0 sgn 20 !; 3 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
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,a_select3(q,X2,tptp_sum_index)) = n1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0005) ).
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,a_select3(q,X2,tptp_sum_index)) = n1 ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,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,a_select3(q,X2,tptp_sum_index)) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,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,a_select3(q,X2,tptp_sum_index)) ) ),
inference(flattening,[],[f143]) ).
fof(f197,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,a_select3(q,X0,tptp_sum_index)) ) ),
inference(rectify,[],[f144]) ).
fof(f198,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(sK31,pred(pv10))
& leq(n0,sK31)
& pv10 != sK31
& n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31]),skolemize(X0,sK31)],[f197]) ).
fof(f289,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f309,plain,
! [X2] :
( ~ leq(X2,pred(pv10))
| ~ leq(n0,X2)
| n1 = sum(n0,n4,a_select3(q,X2,tptp_sum_index)) ),
inference(cnf_transformation,[],[f198]) ).
fof(f316,plain,
leq(sK31,pred(pv10)),
inference(cnf_transformation,[],[f198]) ).
fof(f317,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f198]) ).
fof(f319,plain,
n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index)),
inference(cnf_transformation,[],[f198]) ).
fof(f380,plain,
leq(sK31,minus(pv10,n1)),
inference(definition_unfolding,[],[f316,f289]) ).
fof(f382,plain,
! [X2] :
( ~ leq(X2,minus(pv10,n1))
| ~ leq(n0,X2)
| n1 = sum(n0,n4,a_select3(q,X2,tptp_sum_index)) ),
inference(definition_unfolding,[],[f309,f289]) ).
tcf(c_157,negated_conjecture,
sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) != n1,
inference(cnf_transformation,[],[f319]) ).
tcf(c_159,negated_conjecture,
leq(n0,sK31),
inference(cnf_transformation,[],[f317]) ).
tcf(c_160,negated_conjecture,
leq(sK31,minus(pv10,n1)),
inference(cnf_transformation,[],[f380]) ).
tcf(c_167,negated_conjecture,
! [X0: $i] :
( ( sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
| ~ leq(n0,X0)
| ~ leq(X0,minus(pv10,n1)) ),
inference(cnf_transformation,[],[f382]) ).
tcf(c_5880,definition,
iPr_def_12 = minus(pv10,n1),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_5886,definition,
iPr_def_18 = a_select3(q,sK31,tptp_sum_index),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_5887,definition,
iPr_def_19 = sum(n0,n4,iPr_def_18),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_5889,negated_conjecture,
! [X0: $i] :
( ( sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 )
| ~ leq(n0,X0)
| ~ leq(X0,iPr_def_12) ),
inference(demodulation,[status(thm)],[c_167,c_5880]) ).
tcf(c_5895,negated_conjecture,
leq(sK31,iPr_def_12),
inference(demodulation,[status(thm)],[c_160]) ).
tcf(c_5896,negated_conjecture,
leq(n0,sK31),
inference(demodulation,[status(thm)],[c_159]) ).
tcf(c_5898,negated_conjecture,
iPr_def_19 != n1,
inference(demodulation,[status(thm)],[c_157,c_5886,c_5887]) ).
tcf(c_8955,plain,
( ( sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) = n1 )
| ~ leq(sK31,iPr_def_12) ),
inference(superposition,[status(thm)],[c_5896,c_5889]) ).
tcf(c_8962,plain,
( ( n1 = iPr_def_19 )
| ~ leq(sK31,iPr_def_12) ),
inference(light_normalisation,[status(thm)],[c_8955,c_5886,c_5887]) ).
tcf(c_8963,plain,
n1 = iPr_def_19,
inference(forward_subsumption_resolution,[status(thm)],[c_8962,c_5895]) ).
tcf(c_8967,plain,
iPr_def_19 != iPr_def_19,
inference(demodulation,[status(thm)],[c_5898,c_8963]) ).
tcf(c_8968,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_8967]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV155+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/5.39 % Computer : n002.cluster.edu
% 0.09/5.39 % Model : x86_64 x86_64
% 0.09/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.39 % Memory : 8046.5625MB
% 0.09/5.39 % OS : Linux 6.8.0-71-generic
% 0.09/5.39 % CPULimit : 300
% 0.09/5.39 % WCLimit : 300
% 0.09/5.39 % DateTime : Thu Sep 24 18:41:25 UTC 2026
% 0.09/5.39 % CPUTime :
% 0.09/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.46 % Proving...
% 2.02/6.10 % SZS status Started for theBenchmark.p
% 2.02/6.10 % SZS status Theorem for theBenchmark.p
% 2.02/6.10
% 2.02/6.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.02/6.10
% 2.02/6.10 % ------ iProver source info
% 2.02/6.10
% 2.02/6.10 % git: date: 2026-07-19 20:42:38 +0200
% 2.02/6.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.02/6.10 % git: non_committed_changes: false
% 2.02/6.10
% 2.02/6.10 % ------ Parsing...
% 2.02/6.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.02/6.10
% 2.02/6.10 % ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.02/6.10
% 2.02/6.10 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.02/6.10
% 2.02/6.10 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.02/6.10 % ------ Proving...
% 2.02/6.10 % ------ Problem Properties
% 2.02/6.10
% 2.02/6.10 %
% 2.02/6.10 % clauses 168
% 2.02/6.10 % conjectures 10
% 2.02/6.10 % EPR 52
% 2.02/6.10 % Horn 118
% 2.02/6.10 % unary 72
% 2.02/6.10 % binary 34
% 2.02/6.10 % lits 511
% 2.02/6.10 % lits eq 128
% 2.02/6.10 % fd_pure 0
% 2.02/6.10 % fd_pseudo 0
% 2.02/6.10 % fd_cond 6
% 2.02/6.10 % fd_pseudo_cond 4
% 2.02/6.10 % AC symbols 0
% 2.02/6.10
% 2.02/6.10 % ------ Schedule dynamic 5 is on
% 2.02/6.10
% 2.02/6.10 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.02/6.10
% 2.02/6.10
% 2.02/6.10 % ------
% 2.02/6.10 % Current options:
% 2.02/6.10 % ------
% 2.02/6.10
% 2.02/6.10
% 2.02/6.10 %
% 2.02/6.10
% 2.02/6.10 % ------ Proving...
% 2.02/6.10 %
% 2.02/6.10
% 2.02/6.10 % SZS status Theorem for theBenchmark.p
% 2.02/6.10
% 2.02/6.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.02/6.10
% 2.02/6.10
%------------------------------------------------------------------------------