TSTP Solution File: SWV142+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV142+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n017.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:46 EDT 2023
% Result : Theorem 0.06s 0.27s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 153 ( 6 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 165 ( 48 ~; 43 |; 42 &)
% ( 4 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 19 (; 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X,Y,Z] :
( ( gt(X,Y)
& gt(Y,Z) )
=> gt(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,Y] :
( ( leq(X,Y)
& X != Y )
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ 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(n1,loopcounter)
& ( ~ 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(f64,axiom,
gt(n1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f88,plain,
! [X,Y,Z] :
( ~ gt(X,Y)
| ~ gt(Y,Z)
| gt(X,Z) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f89,plain,
! [X,Z] :
( ! [Y] :
( ~ gt(X,Y)
| ~ gt(Y,Z) )
| gt(X,Z) ),
inference(miniscoping,[status(esa)],[f88]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ~ gt(X0,X1)
| ~ gt(X1,X2)
| gt(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f89]) ).
fof(f106,plain,
! [X,Y] :
( ~ leq(X,Y)
| X = Y
| gt(Y,X) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f107,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f106]) ).
fof(f244,plain,
( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( 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(f246,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f256,plain,
( ~ gt(loopcounter,n0)
| leq(s_best7,n3) ),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f259,plain,
~ leq(s_best7,n3),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f269,plain,
gt(n1,n0),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f340,plain,
( spl0_4
<=> leq(s_best7,n3) ),
introduced(split_symbol_definition) ).
fof(f341,plain,
( leq(s_best7,n3)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f340]) ).
fof(f352,plain,
( spl0_7
<=> gt(loopcounter,n0) ),
introduced(split_symbol_definition) ).
fof(f354,plain,
( ~ gt(loopcounter,n0)
| spl0_7 ),
inference(component_clause,[status(thm)],[f352]) ).
fof(f358,plain,
( ~ spl0_7
| spl0_4 ),
inference(split_clause,[status(thm)],[f256,f352,f340]) ).
fof(f375,plain,
( spl0_10
<=> n1 = loopcounter ),
introduced(split_symbol_definition) ).
fof(f376,plain,
( n1 = loopcounter
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f375]) ).
fof(f378,plain,
( spl0_11
<=> gt(loopcounter,n1) ),
introduced(split_symbol_definition) ).
fof(f379,plain,
( gt(loopcounter,n1)
| ~ spl0_11 ),
inference(component_clause,[status(thm)],[f378]) ).
fof(f381,plain,
( n1 = loopcounter
| gt(loopcounter,n1) ),
inference(resolution,[status(thm)],[f107,f246]) ).
fof(f382,plain,
( spl0_10
| spl0_11 ),
inference(split_clause,[status(thm)],[f381,f375,f378]) ).
fof(f410,plain,
( ~ gt(n1,n0)
| ~ spl0_10
| spl0_7 ),
inference(forward_demodulation,[status(thm)],[f376,f354]) ).
fof(f411,plain,
( $false
| ~ spl0_10
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f410,f269]) ).
fof(f412,plain,
( ~ spl0_10
| spl0_7 ),
inference(contradiction_clause,[status(thm)],[f411]) ).
fof(f413,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f341,f259]) ).
fof(f414,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f413]) ).
fof(f416,plain,
! [X0] :
( ~ gt(loopcounter,X0)
| ~ gt(X0,n0)
| spl0_7 ),
inference(resolution,[status(thm)],[f354,f90]) ).
fof(f427,plain,
( ~ gt(n1,n0)
| spl0_7
| ~ spl0_11 ),
inference(resolution,[status(thm)],[f416,f379]) ).
fof(f428,plain,
( $false
| spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f427,f269]) ).
fof(f429,plain,
( spl0_7
| ~ spl0_11 ),
inference(contradiction_clause,[status(thm)],[f428]) ).
fof(f430,plain,
$false,
inference(sat_refutation,[status(thm)],[f358,f382,f412,f414,f429]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWV142+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n017.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 30 11:01:40 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.06/0.26 % Drodi V3.5.1
% 0.06/0.27 % Refutation found
% 0.06/0.27 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.06/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.06/0.28 % Elapsed time: 0.018217 seconds
% 0.06/0.28 % CPU time: 0.029090 seconds
% 0.06/0.28 % Memory used: 15.937 MB
%------------------------------------------------------------------------------