TSTP Solution File: SWV132+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV132+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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 : Wed May 31 12:40:44 EDT 2023
% Result : Theorem 0.18s 0.57s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 26 ( 6 avg)
% Number of connectives : 114 ( 31 ~; 18 |; 37 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 (; 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f244,plain,
( ~ leq(tptp_float_0_001,pv1341)
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3) )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7) )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7) )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3) )
& ~ leq(s_best7,n3) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f249,plain,
( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3) ),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f258,plain,
~ leq(s_best7,n3),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f324,plain,
( spl0_0
<=> leq(tptp_float_0_001,pv1341) ),
introduced(split_symbol_definition) ).
fof(f325,plain,
( leq(tptp_float_0_001,pv1341)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f324]) ).
fof(f339,plain,
( spl0_4
<=> leq(s_best7,n3) ),
introduced(split_symbol_definition) ).
fof(f340,plain,
( leq(s_best7,n3)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f339]) ).
fof(f342,plain,
( spl0_0
| spl0_4 ),
inference(split_clause,[status(thm)],[f249,f324,f339]) ).
fof(f447,plain,
( $false
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f325,f245]) ).
fof(f448,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f447]) ).
fof(f449,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f340,f258]) ).
fof(f450,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f449]) ).
fof(f451,plain,
$false,
inference(sat_refutation,[status(thm)],[f342,f448,f450]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV132+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.33 % Computer : n011.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue May 30 11:45:12 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.11/0.35 % Drodi V3.5.1
% 0.18/0.57 % Refutation found
% 0.18/0.57 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.57 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.57 % Elapsed time: 0.021302 seconds
% 0.18/0.57 % CPU time: 0.019896 seconds
% 0.18/0.57 % Memory used: 4.048 MB
%------------------------------------------------------------------------------