TSTP Solution File: SWV132+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWV132+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 22:31:16 EDT 2023
% Result : Theorem 1.06s 1.19s
% Output : CNFRefutation 1.06s
% 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 : 17 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% 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 ?)
% 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(s_best7,n3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0002) ).
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(s_best7,n3) ),
inference(negated_conjecture,[],[f53]) ).
fof(f148,plain,
( ~ leq(s_best7,n3)
& ( 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)
| ~ gt(loopcounter,n0) )
& ( 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(tptp_float_0_001,pv1341) ),
inference(ennf_transformation,[],[f54]) ).
fof(f149,plain,
( ~ leq(s_best7,n3)
& ( 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)
| ~ gt(loopcounter,n0) )
& ( 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(tptp_float_0_001,pv1341) ),
inference(flattening,[],[f148]) ).
fof(f326,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[],[f149]) ).
fof(f330,plain,
( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) ),
inference(cnf_transformation,[],[f149]) ).
fof(f339,plain,
~ leq(s_best7,n3),
inference(cnf_transformation,[],[f149]) ).
cnf(c_157,negated_conjecture,
~ leq(s_best7,n3),
inference(cnf_transformation,[],[f339]) ).
cnf(c_166,negated_conjecture,
( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) ),
inference(cnf_transformation,[],[f330]) ).
cnf(c_170,negated_conjecture,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[],[f326]) ).
cnf(c_206,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_166,c_157,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV132+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Aug 29 10:53:56 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.06/1.19 % SZS status Started for theBenchmark.p
% 1.06/1.19 % SZS status Theorem for theBenchmark.p
% 1.06/1.19
% 1.06/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.06/1.19
% 1.06/1.19 ------ iProver source info
% 1.06/1.19
% 1.06/1.19 git: date: 2023-05-31 18:12:56 +0000
% 1.06/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.06/1.19 git: non_committed_changes: false
% 1.06/1.19 git: last_make_outside_of_git: false
% 1.06/1.19
% 1.06/1.19 ------ Parsing...
% 1.06/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.06/1.19
% 1.06/1.19 ------ Preprocessing...
% 1.06/1.19
% 1.06/1.19 % SZS status Theorem for theBenchmark.p
% 1.06/1.19
% 1.06/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.06/1.19
% 1.06/1.19
%------------------------------------------------------------------------------