TSTP Solution File: SWV030+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV030+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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:30 EDT 2023
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 82 ( 20 unt; 0 def)
% Number of atoms : 375 ( 42 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 451 ( 158 ~; 158 |; 107 &)
% ( 13 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 14 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 15 con; 0-3 aty)
% Number of variables : 45 (; 38 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [A] :
( ( leq(n0,A)
& leq(A,n2) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,n3) )
=> a_select3(simplex7_init,B,A) = init ) )
& ! [C] :
( ( leq(n0,C)
& leq(C,minus(pv1376,n1)) )
=> a_select2(s_values7_init,C) = init ) )
=> ( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [D] :
( ( leq(n0,D)
& leq(D,n2) )
=> ! [E] :
( ( leq(n0,E)
& leq(E,n3) )
=> a_select3(simplex7_init,E,D) = init ) )
& ! [F] :
( ( leq(n0,F)
& leq(F,minus(pv1376,n1)) )
=> a_select2(s_values7_init,F) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [A] :
( ( leq(n0,A)
& leq(A,n2) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,n3) )
=> a_select3(simplex7_init,B,A) = init ) )
& ! [C] :
( ( leq(n0,C)
& leq(C,minus(pv1376,n1)) )
=> a_select2(s_values7_init,C) = init ) )
=> ( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [D] :
( ( leq(n0,D)
& leq(D,n2) )
=> ! [E] :
( ( leq(n0,E)
& leq(E,n3) )
=> a_select3(simplex7_init,E,D) = init ) )
& ! [F] :
( ( leq(n0,F)
& leq(F,minus(pv1376,n1)) )
=> a_select2(s_values7_init,F) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f259,plain,
( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [A] :
( ~ leq(n0,A)
| ~ leq(A,n2)
| ! [B] :
( ~ leq(n0,B)
| ~ leq(B,n3)
| a_select3(simplex7_init,B,A) = init ) )
& ! [C] :
( ~ leq(n0,C)
| ~ leq(C,minus(pv1376,n1))
| a_select2(s_values7_init,C) = init )
& ( init != init
| ~ leq(n0,pv7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(n0,pv1376)
| ~ leq(pv7,minus(n410,n1))
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ~ leq(pv1376,n3)
| ? [D] :
( leq(n0,D)
& leq(D,n2)
& ? [E] :
( leq(n0,E)
& leq(E,n3)
& a_select3(simplex7_init,E,D) != init ) )
| ? [F] :
( leq(n0,F)
& leq(F,minus(pv1376,n1))
& a_select2(s_values7_init,F) != init ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f260,plain,
! [D] :
( pd0_3(D)
=> ( leq(n0,D)
& leq(D,n2)
& ? [E] :
( leq(n0,E)
& leq(E,n3)
& a_select3(simplex7_init,E,D) != init ) ) ),
introduced(predicate_definition,[f259]) ).
fof(f261,plain,
( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [A] :
( ~ leq(n0,A)
| ~ leq(A,n2)
| ! [B] :
( ~ leq(n0,B)
| ~ leq(B,n3)
| a_select3(simplex7_init,B,A) = init ) )
& ! [C] :
( ~ leq(n0,C)
| ~ leq(C,minus(pv1376,n1))
| a_select2(s_values7_init,C) = init )
& ( init != init
| ~ leq(n0,pv7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(n0,pv1376)
| ~ leq(pv7,minus(n410,n1))
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ~ leq(pv1376,n3)
| ? [D] : pd0_3(D)
| ? [F] :
( leq(n0,F)
& leq(F,minus(pv1376,n1))
& a_select2(s_values7_init,F) != init ) ) ),
inference(formula_renaming,[status(thm)],[f259,f260]) ).
fof(f262,plain,
( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [A] :
( ~ leq(n0,A)
| ~ leq(A,n2)
| ! [B] :
( ~ leq(n0,B)
| ~ leq(B,n3)
| a_select3(simplex7_init,B,A) = init ) )
& ! [C] :
( ~ leq(n0,C)
| ~ leq(C,minus(pv1376,n1))
| a_select2(s_values7_init,C) = init )
& ( init != init
| ~ leq(n0,pv7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(n0,pv1376)
| ~ leq(pv7,minus(n410,n1))
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ~ leq(pv1376,n3)
| pd0_3(sk0_23)
| ( leq(n0,sk0_24)
& leq(sk0_24,minus(pv1376,n1))
& a_select2(s_values7_init,sk0_24) != init ) ) ),
inference(skolemization,[status(esa)],[f261]) ).
fof(f264,plain,
leq(n0,pv7),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f265,plain,
leq(n0,pv19),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f266,plain,
leq(n0,pv20),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f267,plain,
leq(n0,pv1376),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f268,plain,
leq(pv7,minus(n410,n1)),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f269,plain,
leq(pv19,minus(n410,n1)),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f270,plain,
leq(pv20,minus(n330,n1)),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f271,plain,
leq(pv1376,n3),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f272,plain,
! [X0,X1] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| ~ leq(n0,X1)
| ~ leq(X1,n3)
| a_select3(simplex7_init,X1,X0) = init ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f273,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,minus(pv1376,n1))
| a_select2(s_values7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f274,plain,
( init != init
| ~ leq(n0,pv7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(n0,pv1376)
| ~ leq(pv7,minus(n410,n1))
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ~ leq(pv1376,n3)
| pd0_3(sk0_23)
| leq(n0,sk0_24) ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f275,plain,
( init != init
| ~ leq(n0,pv7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(n0,pv1376)
| ~ leq(pv7,minus(n410,n1))
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ~ leq(pv1376,n3)
| pd0_3(sk0_23)
| leq(sk0_24,minus(pv1376,n1)) ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f276,plain,
( init != init
| ~ leq(n0,pv7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(n0,pv1376)
| ~ leq(pv7,minus(n410,n1))
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ~ leq(pv1376,n3)
| pd0_3(sk0_23)
| a_select2(s_values7_init,sk0_24) != init ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f351,plain,
! [D] :
( ~ pd0_3(D)
| ( leq(n0,D)
& leq(D,n2)
& ? [E] :
( leq(n0,E)
& leq(E,n3)
& a_select3(simplex7_init,E,D) != init ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f260]) ).
fof(f352,plain,
! [D] :
( ~ pd0_3(D)
| ( leq(n0,D)
& leq(D,n2)
& leq(n0,sk0_29(D))
& leq(sk0_29(D),n3)
& a_select3(simplex7_init,sk0_29(D),D) != init ) ),
inference(skolemization,[status(esa)],[f351]) ).
fof(f353,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f352]) ).
fof(f354,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f352]) ).
fof(f355,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,sk0_29(X0)) ),
inference(cnf_transformation,[status(esa)],[f352]) ).
fof(f356,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(sk0_29(X0),n3) ),
inference(cnf_transformation,[status(esa)],[f352]) ).
fof(f357,plain,
! [X0] :
( ~ pd0_3(X0)
| a_select3(simplex7_init,sk0_29(X0),X0) != init ),
inference(cnf_transformation,[status(esa)],[f352]) ).
fof(f364,plain,
( spl0_0
<=> init = init ),
introduced(split_symbol_definition) ).
fof(f366,plain,
( init != init
| spl0_0 ),
inference(component_clause,[status(thm)],[f364]) ).
fof(f367,plain,
( spl0_1
<=> leq(n0,pv7) ),
introduced(split_symbol_definition) ).
fof(f369,plain,
( ~ leq(n0,pv7)
| spl0_1 ),
inference(component_clause,[status(thm)],[f367]) ).
fof(f370,plain,
( spl0_2
<=> leq(n0,pv19) ),
introduced(split_symbol_definition) ).
fof(f372,plain,
( ~ leq(n0,pv19)
| spl0_2 ),
inference(component_clause,[status(thm)],[f370]) ).
fof(f373,plain,
( spl0_3
<=> leq(n0,pv20) ),
introduced(split_symbol_definition) ).
fof(f375,plain,
( ~ leq(n0,pv20)
| spl0_3 ),
inference(component_clause,[status(thm)],[f373]) ).
fof(f376,plain,
( spl0_4
<=> leq(n0,pv1376) ),
introduced(split_symbol_definition) ).
fof(f378,plain,
( ~ leq(n0,pv1376)
| spl0_4 ),
inference(component_clause,[status(thm)],[f376]) ).
fof(f379,plain,
( spl0_5
<=> leq(pv7,minus(n410,n1)) ),
introduced(split_symbol_definition) ).
fof(f381,plain,
( ~ leq(pv7,minus(n410,n1))
| spl0_5 ),
inference(component_clause,[status(thm)],[f379]) ).
fof(f382,plain,
( spl0_6
<=> leq(pv19,minus(n410,n1)) ),
introduced(split_symbol_definition) ).
fof(f384,plain,
( ~ leq(pv19,minus(n410,n1))
| spl0_6 ),
inference(component_clause,[status(thm)],[f382]) ).
fof(f385,plain,
( spl0_7
<=> leq(pv20,minus(n330,n1)) ),
introduced(split_symbol_definition) ).
fof(f387,plain,
( ~ leq(pv20,minus(n330,n1))
| spl0_7 ),
inference(component_clause,[status(thm)],[f385]) ).
fof(f388,plain,
( spl0_8
<=> leq(pv1376,n3) ),
introduced(split_symbol_definition) ).
fof(f390,plain,
( ~ leq(pv1376,n3)
| spl0_8 ),
inference(component_clause,[status(thm)],[f388]) ).
fof(f391,plain,
( spl0_9
<=> pd0_3(sk0_23) ),
introduced(split_symbol_definition) ).
fof(f392,plain,
( pd0_3(sk0_23)
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f391]) ).
fof(f394,plain,
( spl0_10
<=> leq(n0,sk0_24) ),
introduced(split_symbol_definition) ).
fof(f397,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_9
| spl0_10 ),
inference(split_clause,[status(thm)],[f274,f364,f367,f370,f373,f376,f379,f382,f385,f388,f391,f394]) ).
fof(f398,plain,
( spl0_11
<=> leq(sk0_24,minus(pv1376,n1)) ),
introduced(split_symbol_definition) ).
fof(f399,plain,
( leq(sk0_24,minus(pv1376,n1))
| ~ spl0_11 ),
inference(component_clause,[status(thm)],[f398]) ).
fof(f401,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_9
| spl0_11 ),
inference(split_clause,[status(thm)],[f275,f364,f367,f370,f373,f376,f379,f382,f385,f388,f391,f398]) ).
fof(f402,plain,
( spl0_12
<=> a_select2(s_values7_init,sk0_24) = init ),
introduced(split_symbol_definition) ).
fof(f405,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| spl0_9
| ~ spl0_12 ),
inference(split_clause,[status(thm)],[f276,f364,f367,f370,f373,f376,f379,f382,f385,f388,f391,f402]) ).
fof(f408,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f390,f271]) ).
fof(f409,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f408]) ).
fof(f410,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f387,f270]) ).
fof(f411,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f410]) ).
fof(f412,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f384,f269]) ).
fof(f413,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f412]) ).
fof(f414,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f381,f268]) ).
fof(f415,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f414]) ).
fof(f416,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f378,f267]) ).
fof(f417,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f416]) ).
fof(f418,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f375,f266]) ).
fof(f419,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f418]) ).
fof(f420,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f372,f265]) ).
fof(f421,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f420]) ).
fof(f422,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f369,f264]) ).
fof(f423,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f422]) ).
fof(f424,plain,
( $false
| spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f366]) ).
fof(f425,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f424]) ).
fof(f437,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_29(X0))
| ~ leq(sk0_29(X0),n3) ),
inference(resolution,[status(thm)],[f357,f272]) ).
fof(f438,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_29(X0))
| ~ leq(sk0_29(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f437,f353]) ).
fof(f439,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_29(X0))
| ~ leq(sk0_29(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f438,f354]) ).
fof(f440,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_29(X0))
| ~ pd0_3(X0) ),
inference(resolution,[status(thm)],[f439,f356]) ).
fof(f441,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_29(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f440]) ).
fof(f442,plain,
! [X0] : ~ pd0_3(X0),
inference(forward_subsumption_resolution,[status(thm)],[f441,f355]) ).
fof(f443,plain,
( $false
| ~ spl0_9 ),
inference(backward_subsumption_resolution,[status(thm)],[f392,f442]) ).
fof(f444,plain,
~ spl0_9,
inference(contradiction_clause,[status(thm)],[f443]) ).
fof(f445,plain,
( ~ leq(n0,sk0_24)
| a_select2(s_values7_init,sk0_24) = init
| ~ spl0_11 ),
inference(resolution,[status(thm)],[f399,f273]) ).
fof(f446,plain,
( ~ spl0_10
| spl0_12
| ~ spl0_11 ),
inference(split_clause,[status(thm)],[f445,f394,f402,f398]) ).
fof(f447,plain,
$false,
inference(sat_refutation,[status(thm)],[f397,f401,f405,f409,f411,f413,f415,f417,f419,f421,f423,f425,f444,f446]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV030+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue May 30 11:55:43 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.12/0.38 % Refutation found
% 0.12/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.40 % Elapsed time: 0.053070 seconds
% 0.19/0.40 % CPU time: 0.238036 seconds
% 0.19/0.40 % Memory used: 28.903 MB
%------------------------------------------------------------------------------