%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV143+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:31 PM UTC 2026
% Result : Theorem 3.94s 1.28s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 50 ( 21 unt; 0 def)
% Number of atoms : 189 ( 13 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 196 ( 57 ~; 54 |; 56 &)
% ( 1 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 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; 9 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( X0 = X1
| gt(X1,X0)
| gt(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',totality) ).
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(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
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(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_sworst7,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0013) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_sworst7,n3) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f98,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f99,plain,
! [X0,X1,X2] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f136,plain,
( ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341)
& ~ leq(s_sworst7,n3) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341)
& ~ leq(s_sworst7,n3) ),
inference(flattening,[],[f136]) ).
fof(f158,plain,
! [X0,X1] :
( ( ~ leq(X0,X1)
| gt(succ(X1),X0) )
& ( ~ gt(succ(X1),X0)
| leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f190,plain,
! [X0,X1] :
( X0 = X1
| gt(X1,X0)
| gt(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
fof(f192,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f194,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f195,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
fof(f201,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(succ(X1),X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f270,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f301,plain,
( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) ),
inference(cnf_transformation,[],[f137]) ).
fof(f305,plain,
( ~ gt(loopcounter,n0)
| leq(n0,s_best7) ),
inference(cnf_transformation,[],[f137]) ).
fof(f312,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f137]) ).
fof(f314,plain,
~ leq(s_sworst7,n3),
inference(cnf_transformation,[],[f137]) ).
fof(f344,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f352,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(definition_unfolding,[],[f201,f270]) ).
fof(f370,plain,
n1 = plus(n0,n1),
inference(definition_unfolding,[],[f344,f270]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( gt(X1,X0)
| gt(X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f190]) ).
tcf(c_51,plain,
! [X0: $i] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f192]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X0,X2)
| ~ leq(X1,X2)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( leq(X1,X0)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
tcf(c_157,negated_conjecture,
~ leq(s_sworst7,n3),
inference(cnf_transformation,[],[f314]) ).
tcf(c_159,negated_conjecture,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f312]) ).
tcf(c_166,negated_conjecture,
( leq(n0,s_best7)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f305]) ).
tcf(c_170,negated_conjecture,
( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f301]) ).
tcf(c_201,plain,
plus(n0,n1) = n1,
inference(cnf_transformation,[],[f370]) ).
tcf(c_316,negated_conjecture,
~ gt(loopcounter,n0),
inference(global_subsumption_just,[status(thm)],[c_166,c_157,c_170]) ).
tcf(c_11205,negated_conjecture,
~ gt(loopcounter,n0),
inference(demodulation,[status(thm)],[c_316]) ).
tcf(c_11206,negated_conjecture,
leq(n1,loopcounter),
inference(demodulation,[status(thm)],[c_159]) ).
tcf(c_14196,plain,
! [X0: $i] : ~ leq(plus(X0,n1),X0),
inference(superposition,[status(thm)],[c_61,c_51]) ).
tcf(c_14250,plain,
~ leq(n1,n0),
inference(superposition,[status(thm)],[c_201,c_14196]) ).
tcf(c_14999,plain,
( gt(n0,loopcounter)
| ( n0 = loopcounter ) ),
inference(superposition,[status(thm)],[c_49,c_11205]) ).
tcf(c_15141,plain,
( leq(loopcounter,n0)
| ( n0 = loopcounter ) ),
inference(superposition,[status(thm)],[c_14999,c_54]) ).
tcf(c_15465,plain,
! [X0: $i] :
( leq(n1,X0)
| ~ leq(loopcounter,X0) ),
inference(superposition,[status(thm)],[c_11206,c_53]) ).
tcf(c_16111,plain,
( leq(n1,n0)
| ( n0 = loopcounter ) ),
inference(superposition,[status(thm)],[c_15141,c_15465]) ).
tcf(c_16115,plain,
n0 = loopcounter,
inference(forward_subsumption_resolution,[status(thm)],[c_16111,c_14250]) ).
tcf(c_16122,plain,
leq(n1,n0),
inference(demodulation,[status(thm)],[c_11206,c_16115]) ).
tcf(c_16123,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_16122,c_14250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV143+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.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 18:39:24 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 3.94/1.28 % SZS status Started for theBenchmark.p
% 3.94/1.28 % SZS status Theorem for theBenchmark.p
% 3.94/1.28
% 3.94/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.94/1.28
% 3.94/1.28 % ------ iProver source info
% 3.94/1.28
% 3.94/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.94/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.94/1.28 % git: non_committed_changes: false
% 3.94/1.28
% 3.94/1.28 % ------ Parsing...
% 3.94/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.94/1.28
% 3.94/1.28 % ------ Preprocessing... sup_sim: 15 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.94/1.28
% 3.94/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.94/1.28
% 3.94/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.94/1.28 % ------ Proving...
% 3.94/1.28 % ------ Problem Properties
% 3.94/1.28
% 3.94/1.28 %
% 3.94/1.28 % clauses 144
% 3.94/1.28 % conjectures 4
% 3.94/1.28 % EPR 40
% 3.94/1.28 % Horn 94
% 3.94/1.28 % unary 50
% 3.94/1.28 % binary 34
% 3.94/1.28 % lits 483
% 3.94/1.28 % lits eq 113
% 3.94/1.28 % fd_pure 0
% 3.94/1.28 % fd_pseudo 0
% 3.94/1.28 % fd_cond 6
% 3.94/1.28 % fd_pseudo_cond 4
% 3.94/1.28 % AC symbols 0
% 3.94/1.28
% 3.94/1.28 % ------ Schedule dynamic 5 is on
% 3.94/1.28
% 3.94/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.94/1.28
% 3.94/1.28
% 3.94/1.28 % ------
% 3.94/1.28 % Current options:
% 3.94/1.28 % ------
% 3.94/1.28
% 3.94/1.28
% 3.94/1.28 %
% 3.94/1.28
% 3.94/1.28 % ------ Proving...
% 3.94/1.28 %
% 3.94/1.28
% 3.94/1.28 % SZS status Theorem for theBenchmark.p
% 3.94/1.28
% 3.94/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/1.28
% 3.94/1.28
%------------------------------------------------------------------------------