%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV046+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 : 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:18 PM UTC 2026
% Result : Theorem 2.11s 6.30s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 32 unt; 0 def)
% Number of atoms : 96 ( 58 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 92 ( 36 ~; 24 |; 26 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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; 2 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 15 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] : sum(n0,tptp_minus_1,X0) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
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(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(f40,axiom,
! [X0] : pred(succ(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(f48,axiom,
! [X0,X1,X2] : a_select2(tptp_update2(X0,X1,X2),X1) = X2,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).
fof(f53,conjecture,
( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv44
=> true )
& ( n0 != pv44
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0010) ).
fof(f54,negated_conjecture,
~ ( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv44
=> true )
& ( n0 != pv44
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f94,plain,
( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& ( ( n0 = pv44
& ~ true )
| ( n0 != pv44
& ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ) ) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f95,plain,
( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& ( ( n0 = pv44
& ~ true )
| ( n0 != pv44
& ( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ) ) ) ),
inference(flattening,[],[f94]) ).
fof(f126,plain,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[],[f95]) ).
fof(f127,plain,
leq(n0,pv35),
inference(cnf_transformation,[],[f95]) ).
fof(f129,plain,
pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
inference(cnf_transformation,[],[f95]) ).
fof(f132,plain,
( n0 = pv44
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ),
inference(cnf_transformation,[],[f95]) ).
fof(f133,plain,
( ~ true
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
| n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) ),
inference(cnf_transformation,[],[f95]) ).
fof(f146,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f151,plain,
! [X2,X0,X1] : a_select2(tptp_update2(X0,X1,X2),X1) = X2,
inference(cnf_transformation,[],[f48]) ).
fof(f152,plain,
! [X0] : n0 = sum(n0,tptp_minus_1,X0),
inference(cnf_transformation,[],[f26]) ).
fof(f174,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f189,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f205,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f208,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[],[f40]) ).
fof(f222,plain,
n0 = plus(n1,tptp_minus_1),
inference(definition_unfolding,[],[f189,f205]) ).
fof(f234,plain,
! [X0] : minus(plus(n1,X0),n1) = X0,
inference(definition_unfolding,[],[f208,f174,f205]) ).
tcf(c_49,negated_conjecture,
( ~ true
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1))
| ( sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78 )
| ( sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0 ) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_50,negated_conjecture,
( ( n0 = pv44 )
| ~ leq(n0,pv35)
| ~ leq(pv35,minus(n5,n1))
| ( sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78 )
| ( sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0 ) ),
inference(cnf_transformation,[],[f132]) ).
tcf(c_52,negated_conjecture,
sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) = pv78,
inference(cnf_transformation,[],[f129]) ).
tcf(c_54,negated_conjecture,
leq(n0,pv35),
inference(cnf_transformation,[],[f127]) ).
tcf(c_55,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(cnf_transformation,[],[f126]) ).
tcf(c_68,plain,
true,
inference(cnf_transformation,[],[f146]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] : a_select2(tptp_update2(X0,X1,X2),X1) = X2,
inference(cnf_transformation,[],[f151]) ).
tcf(c_74,plain,
! [X0: $i] : sum(n0,tptp_minus_1,X0) = n0,
inference(cnf_transformation,[],[f152]) ).
tcf(c_110,plain,
plus(n1,tptp_minus_1) = n0,
inference(cnf_transformation,[],[f222]) ).
tcf(c_128,plain,
! [X0: $i] : minus(plus(n1,X0),n1) = X0,
inference(cnf_transformation,[],[f234]) ).
tcf(c_164,negated_conjecture,
sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0,
inference(global_subsumption_just,[status(thm)],[c_50,c_68,c_54,c_55,c_52,c_49]) ).
tcf(c_746,plain,
sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
inference(demodulation,[status(thm)],[c_164,c_73]) ).
tcf(c_2410,plain,
minus(n0,n1) = tptp_minus_1,
inference(superposition,[status(thm)],[c_110,c_128]) ).
tcf(c_2417,plain,
sum(n0,tptp_minus_1,times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
inference(demodulation,[status(thm)],[c_746,c_2410]) ).
tcf(c_2418,plain,
$false,
inference(ground_joinability,[status(thm)],[c_2417,c_74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV046+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.37 % Computer : n026.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Thu Sep 24 18:26:00 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 2.11/6.30 % SZS status Started for theBenchmark.p
% 2.11/6.30 % SZS status Theorem for theBenchmark.p
% 2.11/6.30
% 2.11/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.11/6.30
% 2.11/6.30 % ------ iProver source info
% 2.11/6.30
% 2.11/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.11/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.11/6.30 % git: non_committed_changes: false
% 2.11/6.30
% 2.11/6.30 % ------ Parsing...
% 2.11/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.11/6.30
% 2.11/6.30 % ------ Preprocessing... sup_sim: 11 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.11/6.30
% 2.11/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.11/6.30
% 2.11/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.11/6.30 % ------ Proving...
% 2.11/6.30 % ------ Problem Properties
% 2.11/6.30
% 2.11/6.30 %
% 2.11/6.30 % clauses 80
% 2.11/6.30 % conjectures 5
% 2.11/6.30 % EPR 43
% 2.11/6.30 % Horn 70
% 2.11/6.30 % unary 56
% 2.11/6.30 % binary 11
% 2.11/6.30 % lits 135
% 2.11/6.30 % lits eq 52
% 2.11/6.30 % fd_pure 0
% 2.11/6.30 % fd_pseudo 0
% 2.11/6.30 % fd_cond 6
% 2.11/6.30 % fd_pseudo_cond 3
% 2.11/6.30 % AC symbols 0
% 2.11/6.30
% 2.11/6.30 % ------ Schedule dynamic 5 is on
% 2.11/6.30
% 2.11/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.11/6.30
% 2.11/6.30
% 2.11/6.30 % ------
% 2.11/6.30 % Current options:
% 2.11/6.30 % ------
% 2.11/6.30
% 2.11/6.30
% 2.11/6.30 %
% 2.11/6.30
% 2.11/6.30 % ------ Proving...
% 2.11/6.30 %
% 2.11/6.30
% 2.11/6.30 % SZS status Theorem for theBenchmark.p
% 2.11/6.30
% 2.11/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.11/6.30
% 2.11/6.30
%------------------------------------------------------------------------------