TSTP Solution File: SWV031+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV031+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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.14s 0.32s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 12 unt; 0 def)
% Number of atoms : 302 ( 56 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 362 ( 130 ~; 126 |; 80 &)
% ( 10 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 11 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 73 (; 66 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [I,L1,U1,J,L2,U2,Val] :
( ( leq(L1,I)
& leq(I,U1)
& leq(L2,J)
& leq(J,U2) )
=> a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J) = Val ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,n1))
& ! [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,n3) )
=> a_select2(s_values7_init,C) = init ) )
=> ( init = init
& a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) = init
& leq(n0,pv9)
& leq(pv9,minus(n410,n1))
& ! [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,n3) )
=> a_select2(s_values7_init,F) = init ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,n1))
& ! [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,n3) )
=> a_select2(s_values7_init,C) = init ) )
=> ( init = init
& a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) = init
& leq(n0,pv9)
& leq(pv9,minus(n410,n1))
& ! [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,n3) )
=> a_select2(s_values7_init,F) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
! [I,L1,U1,J,L2,U2,Val] :
( ~ leq(L1,I)
| ~ leq(I,U1)
| ~ leq(L2,J)
| ~ leq(J,U2)
| a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J) = Val ),
inference(pre_NNF_transformation,[status(esa)],[f17]) ).
fof(f144,plain,
! [I,L1,U1,J,L2,U2] :
( ~ leq(L1,I)
| ~ leq(I,U1)
| ~ leq(L2,J)
| ~ leq(J,U2)
| ! [Val] : a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J) = Val ),
inference(miniscoping,[status(esa)],[f143]) ).
fof(f145,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| ~ leq(X3,X4)
| ~ leq(X4,X5)
| a_select3(tptp_const_array2(dim(X0,X2),dim(X3,X5),X6),X1,X4) = X6 ),
inference(cnf_transformation,[status(esa)],[f144]) ).
fof(f259,plain,
( init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,n1))
& ! [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,n3)
| a_select2(s_values7_init,C) = init )
& ( init != init
| a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) != init
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ? [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,n3)
& 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,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,n1))
& ! [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,n3)
| a_select2(s_values7_init,C) = init )
& ( init != init
| a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) != init
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ? [D] : pd0_3(D)
| ? [F] :
( leq(n0,F)
& leq(F,n3)
& a_select2(s_values7_init,F) != init ) ) ),
inference(formula_renaming,[status(thm)],[f259,f260]) ).
fof(f262,plain,
( init = init
& leq(n0,pv9)
& leq(n0,pv10)
& leq(pv9,minus(n410,n1))
& leq(pv10,minus(n330,n1))
& ! [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,n3)
| a_select2(s_values7_init,C) = init )
& ( init != init
| a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) != init
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| pd0_3(sk0_23)
| ( leq(n0,sk0_24)
& leq(sk0_24,n3)
& a_select2(s_values7_init,sk0_24) != init ) ) ),
inference(skolemization,[status(esa)],[f261]) ).
fof(f264,plain,
leq(n0,pv9),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f265,plain,
leq(n0,pv10),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f266,plain,
leq(pv9,minus(n410,n1)),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f267,plain,
leq(pv10,minus(n330,n1)),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f268,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(f269,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n3)
| a_select2(s_values7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f270,plain,
( init != init
| a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) != init
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| pd0_3(sk0_23)
| leq(n0,sk0_24) ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f271,plain,
( init != init
| a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) != init
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| pd0_3(sk0_23)
| leq(sk0_24,n3) ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f272,plain,
( init != init
| a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) != init
| ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| pd0_3(sk0_23)
| a_select2(s_values7_init,sk0_24) != init ),
inference(cnf_transformation,[status(esa)],[f262]) ).
fof(f347,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(f348,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)],[f347]) ).
fof(f349,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f348]) ).
fof(f350,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f348]) ).
fof(f351,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,sk0_29(X0)) ),
inference(cnf_transformation,[status(esa)],[f348]) ).
fof(f352,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(sk0_29(X0),n3) ),
inference(cnf_transformation,[status(esa)],[f348]) ).
fof(f353,plain,
! [X0] :
( ~ pd0_3(X0)
| a_select3(simplex7_init,sk0_29(X0),X0) != init ),
inference(cnf_transformation,[status(esa)],[f348]) ).
fof(f360,plain,
( spl0_0
<=> init = init ),
introduced(split_symbol_definition) ).
fof(f362,plain,
( init != init
| spl0_0 ),
inference(component_clause,[status(thm)],[f360]) ).
fof(f363,plain,
( spl0_1
<=> a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) = init ),
introduced(split_symbol_definition) ).
fof(f365,plain,
( a_select3(tptp_const_array2(dim(n0,minus(n410,n1)),dim(n0,minus(n330,n1)),init),pv9,pv10) != init
| spl0_1 ),
inference(component_clause,[status(thm)],[f363]) ).
fof(f366,plain,
( spl0_2
<=> leq(n0,pv9) ),
introduced(split_symbol_definition) ).
fof(f368,plain,
( ~ leq(n0,pv9)
| spl0_2 ),
inference(component_clause,[status(thm)],[f366]) ).
fof(f369,plain,
( spl0_3
<=> leq(pv9,minus(n410,n1)) ),
introduced(split_symbol_definition) ).
fof(f371,plain,
( ~ leq(pv9,minus(n410,n1))
| spl0_3 ),
inference(component_clause,[status(thm)],[f369]) ).
fof(f372,plain,
( spl0_4
<=> pd0_3(sk0_23) ),
introduced(split_symbol_definition) ).
fof(f373,plain,
( pd0_3(sk0_23)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f372]) ).
fof(f375,plain,
( spl0_5
<=> leq(n0,sk0_24) ),
introduced(split_symbol_definition) ).
fof(f378,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f270,f360,f363,f366,f369,f372,f375]) ).
fof(f379,plain,
( spl0_6
<=> leq(sk0_24,n3) ),
introduced(split_symbol_definition) ).
fof(f382,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| spl0_4
| spl0_6 ),
inference(split_clause,[status(thm)],[f271,f360,f363,f366,f369,f372,f379]) ).
fof(f383,plain,
( spl0_7
<=> a_select2(s_values7_init,sk0_24) = init ),
introduced(split_symbol_definition) ).
fof(f385,plain,
( a_select2(s_values7_init,sk0_24) != init
| spl0_7 ),
inference(component_clause,[status(thm)],[f383]) ).
fof(f386,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| spl0_4
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f272,f360,f363,f366,f369,f372,f383]) ).
fof(f417,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f371,f266]) ).
fof(f418,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f417]) ).
fof(f419,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f368,f264]) ).
fof(f420,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f419]) ).
fof(f421,plain,
( spl0_8
<=> leq(n0,pv10) ),
introduced(split_symbol_definition) ).
fof(f423,plain,
( ~ leq(n0,pv10)
| spl0_8 ),
inference(component_clause,[status(thm)],[f421]) ).
fof(f424,plain,
( spl0_9
<=> leq(pv10,minus(n330,n1)) ),
introduced(split_symbol_definition) ).
fof(f426,plain,
( ~ leq(pv10,minus(n330,n1))
| spl0_9 ),
inference(component_clause,[status(thm)],[f424]) ).
fof(f427,plain,
( ~ leq(n0,pv9)
| ~ leq(pv9,minus(n410,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n330,n1))
| spl0_1 ),
inference(resolution,[status(thm)],[f365,f145]) ).
fof(f428,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_8
| ~ spl0_9
| spl0_1 ),
inference(split_clause,[status(thm)],[f427,f366,f369,f421,f424,f363]) ).
fof(f429,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f426,f267]) ).
fof(f430,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f429]) ).
fof(f431,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f423,f265]) ).
fof(f432,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f431]) ).
fof(f433,plain,
( $false
| spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f362]) ).
fof(f434,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f433]) ).
fof(f516,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)],[f353,f268]) ).
fof(f517,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_29(X0))
| ~ leq(sk0_29(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f516,f349]) ).
fof(f780,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_29(X0))
| ~ leq(sk0_29(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f517,f350]) ).
fof(f781,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_29(X0))
| ~ pd0_3(X0) ),
inference(resolution,[status(thm)],[f780,f352]) ).
fof(f782,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_29(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f781]) ).
fof(f783,plain,
! [X0] : ~ pd0_3(X0),
inference(forward_subsumption_resolution,[status(thm)],[f782,f351]) ).
fof(f784,plain,
( $false
| ~ spl0_4 ),
inference(backward_subsumption_resolution,[status(thm)],[f373,f783]) ).
fof(f785,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f784]) ).
fof(f801,plain,
( ~ leq(n0,sk0_24)
| ~ leq(sk0_24,n3)
| spl0_7 ),
inference(resolution,[status(thm)],[f385,f269]) ).
fof(f802,plain,
( ~ spl0_5
| ~ spl0_6
| spl0_7 ),
inference(split_clause,[status(thm)],[f801,f375,f379,f383]) ).
fof(f803,plain,
$false,
inference(sat_refutation,[status(thm)],[f378,f382,f386,f418,f420,f428,f430,f432,f434,f785,f802]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SWV031+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.04/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n010.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 11:35:22 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.31 % Drodi V3.5.1
% 0.14/0.32 % Refutation found
% 0.14/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.56 % Elapsed time: 0.043315 seconds
% 0.15/0.56 % CPU time: 0.024022 seconds
% 0.15/0.56 % Memory used: 4.205 MB
%------------------------------------------------------------------------------