%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV131+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 : n020.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:30 PM UTC 2026
% Result : Theorem 0.42s 1.29s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 26 ( 10 avg)
% Number of connectives : 137 ( 35 ~; 26 |; 50 &)
% ( 0 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
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(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0001) ).
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(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
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(tptp_float_0_001,pv1341)
& ~ leq(n0,s_best7) ),
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(tptp_float_0_001,pv1341)
& ~ leq(n0,s_best7) ),
inference(flattening,[],[f136]) ).
fof(f311,plain,
( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) ),
inference(cnf_transformation,[],[f137]) ).
fof(f312,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[],[f137]) ).
fof(f313,plain,
~ leq(n0,s_best7),
inference(cnf_transformation,[],[f137]) ).
tcf(c_157,negated_conjecture,
~ leq(n0,s_best7),
inference(cnf_transformation,[],[f313]) ).
tcf(c_158,negated_conjecture,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[],[f312]) ).
tcf(c_159,negated_conjecture,
( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) ),
inference(cnf_transformation,[],[f311]) ).
tcf(c_206,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_159,c_157,c_158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV131+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.10/0.38 % Computer : n020.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Thu Sep 24 18:35:49 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 0.42/1.29 % SZS status Started for theBenchmark.p
% 0.42/1.29 % SZS status Theorem for theBenchmark.p
% 0.42/1.29
% 0.42/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.42/1.29
% 0.42/1.29 % ------ iProver source info
% 0.42/1.29
% 0.42/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.42/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.42/1.29 % git: non_committed_changes: false
% 0.42/1.29
% 0.42/1.29 % ------ Parsing...
% 0.42/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.42/1.29
% 0.42/1.29 % ------ Preprocessing...%
% 0.42/1.29
% 0.42/1.29 % SZS status Theorem for theBenchmark.p
% 0.42/1.29
% 0.42/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.42/1.29
% 0.42/1.29
%------------------------------------------------------------------------------