%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV041+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 : 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:17 PM UTC 2026
% Result : Theorem 2.70s 6.43s
% Output : CNFRefutation 2.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 29 unt; 1 def)
% Number of atoms : 99 ( 21 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 71 ( 23 ~; 14 |; 26 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 47 !; 4 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(f41,axiom,
! [X0] : succ(pred(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_pred) ).
fof(f53,conjecture,
( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X0] :
( ( leq(X0,n2)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,minus(n0,n1))
& leq(n0,X1) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0077) ).
fof(f54,negated_conjecture,
~ ( ( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0) )
=> ! [X0] :
( ( leq(X0,n2)
& leq(n0,X0) )
=> ! [X1] :
( ( leq(X1,minus(n0,n1))
& leq(n0,X1) )
=> a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f114,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f115,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f114]) ).
fof(f153,plain,
( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0)
& ? [X0] :
( leq(X0,n2)
& leq(n0,X0)
& ? [X1] :
( leq(X1,minus(n0,n1))
& leq(n0,X1)
& a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) != init ) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f154,plain,
( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0)
& ? [X0] :
( leq(X0,n2)
& leq(n0,X0)
& ? [X1] :
( leq(X1,minus(n0,n1))
& leq(n0,X1)
& a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X1,X0) != init ) ) ),
inference(flattening,[],[f153]) ).
fof(f175,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| gt(succ(X1),X0) )
& ( ~ gt(succ(X1),X0)
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f207,plain,
( geq(minus(n410,n1),n0)
& geq(minus(n330,n1),n0)
& leq(sK31,n2)
& leq(n0,sK31)
& leq(sK32,minus(n0,n1))
& leq(n0,sK32)
& init != a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),sK32,sK31) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f154]) ).
fof(f210,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f212,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f115]) ).
fof(f220,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(succ(X1),X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f289,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f290,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f299,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f301,plain,
! [X0] : succ(pred(X0)) = X0,
inference(cnf_transformation,[],[f41]) ).
fof(f323,plain,
leq(sK32,minus(n0,n1)),
inference(cnf_transformation,[],[f207]) ).
fof(f324,plain,
leq(n0,sK32),
inference(cnf_transformation,[],[f207]) ).
fof(f378,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(definition_unfolding,[],[f220,f289]) ).
fof(f380,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f290,f289]) ).
fof(f390,plain,
! [X0] : plus(minus(X0,n1),n1) = X0,
inference(definition_unfolding,[],[f301,f289,f299]) ).
tcf(c_51,plain,
! [X0: $i] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f210]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f212]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f378]) ).
tcf(c_130,plain,
! [X0: $i] : plus(X0,n1) = plus(n1,X0),
inference(cnf_transformation,[],[f380]) ).
tcf(c_140,plain,
! [X0: $i] : plus(minus(X0,n1),n1) = X0,
inference(cnf_transformation,[],[f390]) ).
tcf(c_159,negated_conjecture,
leq(n0,sK32),
inference(cnf_transformation,[],[f324]) ).
tcf(c_160,negated_conjecture,
leq(sK32,minus(n0,n1)),
inference(cnf_transformation,[],[f323]) ).
tcf(c_1675,plain,
! [X0: $i] : plus(n1,minus(X0,n1)) = X0,
inference(demodulation,[status(thm)],[c_140,c_130]) ).
tcf(c_11327,definition,
iPr_def_12 = minus(n0,n1),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_11336,negated_conjecture,
leq(sK32,iPr_def_12),
inference(demodulation,[status(thm)],[c_160,c_11327]) ).
tcf(c_11337,negated_conjecture,
leq(n0,sK32),
inference(demodulation,[status(thm)],[c_159]) ).
tcf(c_14343,plain,
plus(n1,iPr_def_12) = n0,
inference(superposition,[status(thm)],[c_11327,c_1675]) ).
tcf(c_14546,plain,
! [X0: $i] : ~ leq(plus(X0,n1),X0),
inference(superposition,[status(thm)],[c_62,c_51]) ).
tcf(c_14677,plain,
plus(iPr_def_12,n1) = n0,
inference(demodulation,[status(thm)],[c_14343,c_130]) ).
tcf(c_14781,plain,
~ leq(n0,iPr_def_12),
inference(superposition,[status(thm)],[c_14677,c_14546]) ).
tcf(c_15390,plain,
! [X0: $i] :
( leq(n0,X0)
| ~ leq(sK32,X0) ),
inference(superposition,[status(thm)],[c_11337,c_53]) ).
tcf(c_15978,plain,
leq(n0,iPr_def_12),
inference(superposition,[status(thm)],[c_11336,c_15390]) ).
tcf(c_15985,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_15978,c_14781]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV041+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.02/5.60 % Computer : n002.cluster.edu
% 0.02/5.60 % Model : x86_64 x86_64
% 0.02/5.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/5.60 % Memory : 8046.5625MB
% 0.02/5.60 % OS : Linux 6.8.0-71-generic
% 0.02/5.60 % CPULimit : 300
% 0.02/5.60 % WCLimit : 300
% 0.02/5.60 % DateTime : Thu Sep 24 18:25:42 UTC 2026
% 0.02/5.60 % CPUTime :
% 0.02/5.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/5.64 Running first-order theorem proving
% 0.02/5.64 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.02/5.65
% 0.02/5.65 % ======== iProver multi-core TPTP/SMT =========
% 0.02/5.65
% 0.02/5.65 % Detected problem language: tptp
% 0.02/5.66 % Proving...
% 2.70/6.43 % SZS status Started for theBenchmark.p
% 2.70/6.43 % SZS status Theorem for theBenchmark.p
% 2.70/6.43
% 2.70/6.43 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.70/6.43
% 2.70/6.43 % ------ iProver source info
% 2.70/6.43
% 2.70/6.43 % git: date: 2026-07-19 20:42:38 +0200
% 2.70/6.43 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.70/6.43 % git: non_committed_changes: false
% 2.70/6.43
% 2.70/6.43 % ------ Parsing...
% 2.70/6.43 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.70/6.43
% 2.70/6.43 % ------ Preprocessing... sup_sim: 15 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 2.70/6.43
% 2.70/6.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.70/6.43
% 2.70/6.43 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.70/6.43 % ------ Proving...
% 2.70/6.43 % ------ Problem Properties
% 2.70/6.43
% 2.70/6.43 %
% 2.70/6.43 % clauses 169
% 2.70/6.43 % conjectures 5
% 2.70/6.43 % EPR 58
% 2.70/6.43 % Horn 119
% 2.70/6.43 % unary 75
% 2.70/6.43 % binary 34
% 2.70/6.43 % lits 508
% 2.70/6.43 % lits eq 121
% 2.70/6.43 % fd_pure 0
% 2.70/6.43 % fd_pseudo 0
% 2.70/6.43 % fd_cond 6
% 2.70/6.43 % fd_pseudo_cond 4
% 2.70/6.43 % AC symbols 0
% 2.70/6.43
% 2.70/6.43 % ------ Schedule dynamic 5 is on
% 2.70/6.43
% 2.70/6.43 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.70/6.43
% 2.70/6.43
% 2.70/6.43 % ------
% 2.70/6.43 % Current options:
% 2.70/6.43 % ------
% 2.70/6.43
% 2.70/6.43
% 2.70/6.43 %
% 2.70/6.43
% 2.70/6.43 % ------ Proving...
% 2.70/6.43 %
% 2.70/6.43
% 2.70/6.43 % SZS status Theorem for theBenchmark.p
% 2.70/6.43
% 2.70/6.43 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.70/6.43
% 2.70/6.43
%------------------------------------------------------------------------------