TSTP Solution File: SWV025+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV025+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n019.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:29 EDT 2023
% Result : Theorem 0.16s 0.40s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 27
% Syntax : Number of formulae : 150 ( 36 unt; 0 def)
% Number of atoms : 676 ( 152 equ)
% Maximal formula atoms : 66 ( 4 avg)
% Number of connectives : 788 ( 262 ~; 264 |; 210 &)
% ( 22 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 44 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 30 ( 28 usr; 23 prp; 0-2 aty)
% Number of functors : 32 ( 32 usr; 28 con; 0-3 aty)
% Number of variables : 89 (; 78 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( init = init
& s_best7_init = init
& s_sworst7_init = init
& s_worst7_init = init
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,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 )
& ! [D] :
( ( leq(n0,D)
& leq(D,n2) )
=> a_select2(s_center7_init,D) = init )
& ! [E] :
( ( leq(n0,E)
& leq(E,minus(n3,n1)) )
=> a_select2(s_try7_init,E) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) )
=> ( init = init
& s_best7_init = init
& s_sworst7_init = init
& s_worst7_init = init
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& ! [F] :
( ( leq(n0,F)
& leq(F,n2) )
=> ! [G] :
( ( leq(n0,G)
& leq(G,n3) )
=> a_select3(simplex7_init,G,F) = init ) )
& ! [H] :
( ( leq(n0,H)
& leq(H,n3) )
=> a_select2(s_values7_init,H) = init )
& ! [I] :
( ( leq(n0,I)
& leq(I,n2) )
=> a_select2(s_center7_init,I) = init )
& ! [J] :
( ( leq(n0,J)
& leq(J,minus(n3,n1)) )
=> a_select2(s_try7_init,J) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( init = init
& s_best7_init = init
& s_sworst7_init = init
& s_worst7_init = init
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,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 )
& ! [D] :
( ( leq(n0,D)
& leq(D,n2) )
=> a_select2(s_center7_init,D) = init )
& ! [E] :
( ( leq(n0,E)
& leq(E,minus(n3,n1)) )
=> a_select2(s_try7_init,E) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) )
=> ( init = init
& s_best7_init = init
& s_sworst7_init = init
& s_worst7_init = init
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& ! [F] :
( ( leq(n0,F)
& leq(F,n2) )
=> ! [G] :
( ( leq(n0,G)
& leq(G,n3) )
=> a_select3(simplex7_init,G,F) = init ) )
& ! [H] :
( ( leq(n0,H)
& leq(H,n3) )
=> a_select2(s_values7_init,H) = init )
& ! [I] :
( ( leq(n0,I)
& leq(I,n2) )
=> a_select2(s_center7_init,I) = init )
& ! [J] :
( ( leq(n0,J)
& leq(J,minus(n3,n1)) )
=> a_select2(s_try7_init,J) = init )
& ( gt(loopcounter,n1)
=> ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f259,plain,
( init = init
& s_best7_init = init
& s_sworst7_init = init
& s_worst7_init = init
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,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 )
& ! [D] :
( ~ leq(n0,D)
| ~ leq(D,n2)
| a_select2(s_center7_init,D) = init )
& ! [E] :
( ~ leq(n0,E)
| ~ leq(E,minus(n3,n1))
| a_select2(s_try7_init,E) = init )
& ( ~ gt(loopcounter,n1)
| ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) )
& ( init != init
| s_best7_init != init
| s_sworst7_init != init
| s_worst7_init != init
| ~ leq(n0,s_best7)
| ~ leq(n0,s_sworst7)
| ~ leq(n0,s_worst7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ? [F] :
( leq(n0,F)
& leq(F,n2)
& ? [G] :
( leq(n0,G)
& leq(G,n3)
& a_select3(simplex7_init,G,F) != init ) )
| ? [H] :
( leq(n0,H)
& leq(H,n3)
& a_select2(s_values7_init,H) != init )
| ? [I] :
( leq(n0,I)
& leq(I,n2)
& a_select2(s_center7_init,I) != init )
| ? [J] :
( leq(n0,J)
& leq(J,minus(n3,n1))
& a_select2(s_try7_init,J) != init )
| ( gt(loopcounter,n1)
& ( pvar1400_init != init
| pvar1401_init != init
| pvar1402_init != init ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f260,plain,
! [F] :
( pd0_3(F)
=> ( leq(n0,F)
& leq(F,n2)
& ? [G] :
( leq(n0,G)
& leq(G,n3)
& a_select3(simplex7_init,G,F) != init ) ) ),
introduced(predicate_definition,[f259]) ).
fof(f261,plain,
! [H] :
( pd0_4(H)
=> ( leq(n0,H)
& leq(H,n3)
& a_select2(s_values7_init,H) != init ) ),
introduced(predicate_definition,[f259]) ).
fof(f262,plain,
! [I] :
( pd0_5(I)
=> ( leq(n0,I)
& leq(I,n2)
& a_select2(s_center7_init,I) != init ) ),
introduced(predicate_definition,[f259]) ).
fof(f263,plain,
! [J] :
( pd0_6(J)
=> ( leq(n0,J)
& leq(J,minus(n3,n1))
& a_select2(s_try7_init,J) != init ) ),
introduced(predicate_definition,[f259]) ).
fof(f264,plain,
( init = init
& s_best7_init = init
& s_sworst7_init = init
& s_worst7_init = init
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,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 )
& ! [D] :
( ~ leq(n0,D)
| ~ leq(D,n2)
| a_select2(s_center7_init,D) = init )
& ! [E] :
( ~ leq(n0,E)
| ~ leq(E,minus(n3,n1))
| a_select2(s_try7_init,E) = init )
& ( ~ gt(loopcounter,n1)
| ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) )
& ( init != init
| s_best7_init != init
| s_sworst7_init != init
| s_worst7_init != init
| ~ leq(n0,s_best7)
| ~ leq(n0,s_sworst7)
| ~ leq(n0,s_worst7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| ? [F] : pd0_3(F)
| ? [H] : pd0_4(H)
| ? [I] : pd0_5(I)
| ? [J] : pd0_6(J)
| ( gt(loopcounter,n1)
& ( pvar1400_init != init
| pvar1401_init != init
| pvar1402_init != init ) ) ) ),
inference(formula_renaming,[status(thm)],[f259,f263,f262,f261,f260]) ).
fof(f265,plain,
( init = init
& s_best7_init = init
& s_sworst7_init = init
& s_worst7_init = init
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,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 )
& ! [D] :
( ~ leq(n0,D)
| ~ leq(D,n2)
| a_select2(s_center7_init,D) = init )
& ! [E] :
( ~ leq(n0,E)
| ~ leq(E,minus(n3,n1))
| a_select2(s_try7_init,E) = init )
& ( ~ gt(loopcounter,n1)
| ( pvar1400_init = init
& pvar1401_init = init
& pvar1402_init = init ) )
& ( init != init
| s_best7_init != init
| s_sworst7_init != init
| s_worst7_init != init
| ~ leq(n0,s_best7)
| ~ leq(n0,s_sworst7)
| ~ leq(n0,s_worst7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| pd0_3(sk0_23)
| pd0_4(sk0_24)
| pd0_5(sk0_25)
| pd0_6(sk0_26)
| ( gt(loopcounter,n1)
& ( pvar1400_init != init
| pvar1401_init != init
| pvar1402_init != init ) ) ) ),
inference(skolemization,[status(esa)],[f264]) ).
fof(f267,plain,
s_best7_init = init,
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f268,plain,
s_sworst7_init = init,
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f269,plain,
s_worst7_init = init,
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f270,plain,
leq(n0,s_best7),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f271,plain,
leq(n0,s_sworst7),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f272,plain,
leq(n0,s_worst7),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f274,plain,
leq(n0,pv19),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f275,plain,
leq(n0,pv20),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f276,plain,
leq(s_best7,n3),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f277,plain,
leq(s_sworst7,n3),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f278,plain,
leq(s_worst7,n3),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f280,plain,
leq(pv19,minus(n410,n1)),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f281,plain,
leq(pv20,minus(n330,n1)),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f282,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)],[f265]) ).
fof(f283,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n3)
| a_select2(s_values7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f284,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| a_select2(s_center7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f285,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,minus(n3,n1))
| a_select2(s_try7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f286,plain,
( ~ gt(loopcounter,n1)
| pvar1400_init = init ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f287,plain,
( ~ gt(loopcounter,n1)
| pvar1401_init = init ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f288,plain,
( ~ gt(loopcounter,n1)
| pvar1402_init = init ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f289,plain,
( init != init
| s_best7_init != init
| s_sworst7_init != init
| s_worst7_init != init
| ~ leq(n0,s_best7)
| ~ leq(n0,s_sworst7)
| ~ leq(n0,s_worst7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| pd0_3(sk0_23)
| pd0_4(sk0_24)
| pd0_5(sk0_25)
| pd0_6(sk0_26)
| gt(loopcounter,n1) ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f290,plain,
( init != init
| s_best7_init != init
| s_sworst7_init != init
| s_worst7_init != init
| ~ leq(n0,s_best7)
| ~ leq(n0,s_sworst7)
| ~ leq(n0,s_worst7)
| ~ leq(n0,pv19)
| ~ leq(n0,pv20)
| ~ leq(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,n1))
| ~ leq(pv20,minus(n330,n1))
| pd0_3(sk0_23)
| pd0_4(sk0_24)
| pd0_5(sk0_25)
| pd0_6(sk0_26)
| pvar1400_init != init
| pvar1401_init != init
| pvar1402_init != init ),
inference(cnf_transformation,[status(esa)],[f265]) ).
fof(f365,plain,
! [F] :
( ~ pd0_3(F)
| ( leq(n0,F)
& leq(F,n2)
& ? [G] :
( leq(n0,G)
& leq(G,n3)
& a_select3(simplex7_init,G,F) != init ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f260]) ).
fof(f366,plain,
! [F] :
( ~ pd0_3(F)
| ( leq(n0,F)
& leq(F,n2)
& leq(n0,sk0_31(F))
& leq(sk0_31(F),n3)
& a_select3(simplex7_init,sk0_31(F),F) != init ) ),
inference(skolemization,[status(esa)],[f365]) ).
fof(f367,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f366]) ).
fof(f368,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f366]) ).
fof(f369,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,sk0_31(X0)) ),
inference(cnf_transformation,[status(esa)],[f366]) ).
fof(f370,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(sk0_31(X0),n3) ),
inference(cnf_transformation,[status(esa)],[f366]) ).
fof(f371,plain,
! [X0] :
( ~ pd0_3(X0)
| a_select3(simplex7_init,sk0_31(X0),X0) != init ),
inference(cnf_transformation,[status(esa)],[f366]) ).
fof(f372,plain,
! [H] :
( ~ pd0_4(H)
| ( leq(n0,H)
& leq(H,n3)
& a_select2(s_values7_init,H) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f261]) ).
fof(f373,plain,
! [X0] :
( ~ pd0_4(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f372]) ).
fof(f374,plain,
! [X0] :
( ~ pd0_4(X0)
| leq(X0,n3) ),
inference(cnf_transformation,[status(esa)],[f372]) ).
fof(f375,plain,
! [X0] :
( ~ pd0_4(X0)
| a_select2(s_values7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f372]) ).
fof(f376,plain,
! [I] :
( ~ pd0_5(I)
| ( leq(n0,I)
& leq(I,n2)
& a_select2(s_center7_init,I) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f262]) ).
fof(f377,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f376]) ).
fof(f378,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f376]) ).
fof(f379,plain,
! [X0] :
( ~ pd0_5(X0)
| a_select2(s_center7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f376]) ).
fof(f380,plain,
! [J] :
( ~ pd0_6(J)
| ( leq(n0,J)
& leq(J,minus(n3,n1))
& a_select2(s_try7_init,J) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f263]) ).
fof(f381,plain,
! [X0] :
( ~ pd0_6(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f380]) ).
fof(f382,plain,
! [X0] :
( ~ pd0_6(X0)
| leq(X0,minus(n3,n1)) ),
inference(cnf_transformation,[status(esa)],[f380]) ).
fof(f383,plain,
! [X0] :
( ~ pd0_6(X0)
| a_select2(s_try7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f380]) ).
fof(f390,plain,
( spl0_0
<=> gt(loopcounter,n1) ),
introduced(split_symbol_definition) ).
fof(f393,plain,
( spl0_1
<=> pvar1400_init = init ),
introduced(split_symbol_definition) ).
fof(f396,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f286,f390,f393]) ).
fof(f397,plain,
( spl0_2
<=> pvar1401_init = init ),
introduced(split_symbol_definition) ).
fof(f400,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f287,f390,f397]) ).
fof(f401,plain,
( spl0_3
<=> pvar1402_init = init ),
introduced(split_symbol_definition) ).
fof(f404,plain,
( ~ spl0_0
| spl0_3 ),
inference(split_clause,[status(thm)],[f288,f390,f401]) ).
fof(f405,plain,
( spl0_4
<=> init = init ),
introduced(split_symbol_definition) ).
fof(f407,plain,
( init != init
| spl0_4 ),
inference(component_clause,[status(thm)],[f405]) ).
fof(f408,plain,
( spl0_5
<=> s_best7_init = init ),
introduced(split_symbol_definition) ).
fof(f410,plain,
( s_best7_init != init
| spl0_5 ),
inference(component_clause,[status(thm)],[f408]) ).
fof(f411,plain,
( spl0_6
<=> s_sworst7_init = init ),
introduced(split_symbol_definition) ).
fof(f413,plain,
( s_sworst7_init != init
| spl0_6 ),
inference(component_clause,[status(thm)],[f411]) ).
fof(f414,plain,
( spl0_7
<=> s_worst7_init = init ),
introduced(split_symbol_definition) ).
fof(f416,plain,
( s_worst7_init != init
| spl0_7 ),
inference(component_clause,[status(thm)],[f414]) ).
fof(f417,plain,
( spl0_8
<=> leq(n0,s_best7) ),
introduced(split_symbol_definition) ).
fof(f419,plain,
( ~ leq(n0,s_best7)
| spl0_8 ),
inference(component_clause,[status(thm)],[f417]) ).
fof(f420,plain,
( spl0_9
<=> leq(n0,s_sworst7) ),
introduced(split_symbol_definition) ).
fof(f422,plain,
( ~ leq(n0,s_sworst7)
| spl0_9 ),
inference(component_clause,[status(thm)],[f420]) ).
fof(f423,plain,
( spl0_10
<=> leq(n0,s_worst7) ),
introduced(split_symbol_definition) ).
fof(f425,plain,
( ~ leq(n0,s_worst7)
| spl0_10 ),
inference(component_clause,[status(thm)],[f423]) ).
fof(f426,plain,
( spl0_11
<=> leq(n0,pv19) ),
introduced(split_symbol_definition) ).
fof(f428,plain,
( ~ leq(n0,pv19)
| spl0_11 ),
inference(component_clause,[status(thm)],[f426]) ).
fof(f429,plain,
( spl0_12
<=> leq(n0,pv20) ),
introduced(split_symbol_definition) ).
fof(f431,plain,
( ~ leq(n0,pv20)
| spl0_12 ),
inference(component_clause,[status(thm)],[f429]) ).
fof(f432,plain,
( spl0_13
<=> leq(s_best7,n3) ),
introduced(split_symbol_definition) ).
fof(f434,plain,
( ~ leq(s_best7,n3)
| spl0_13 ),
inference(component_clause,[status(thm)],[f432]) ).
fof(f435,plain,
( spl0_14
<=> leq(s_sworst7,n3) ),
introduced(split_symbol_definition) ).
fof(f437,plain,
( ~ leq(s_sworst7,n3)
| spl0_14 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f438,plain,
( spl0_15
<=> leq(s_worst7,n3) ),
introduced(split_symbol_definition) ).
fof(f440,plain,
( ~ leq(s_worst7,n3)
| spl0_15 ),
inference(component_clause,[status(thm)],[f438]) ).
fof(f441,plain,
( spl0_16
<=> leq(pv19,minus(n410,n1)) ),
introduced(split_symbol_definition) ).
fof(f443,plain,
( ~ leq(pv19,minus(n410,n1))
| spl0_16 ),
inference(component_clause,[status(thm)],[f441]) ).
fof(f444,plain,
( spl0_17
<=> leq(pv20,minus(n330,n1)) ),
introduced(split_symbol_definition) ).
fof(f446,plain,
( ~ leq(pv20,minus(n330,n1))
| spl0_17 ),
inference(component_clause,[status(thm)],[f444]) ).
fof(f447,plain,
( spl0_18
<=> pd0_3(sk0_23) ),
introduced(split_symbol_definition) ).
fof(f448,plain,
( pd0_3(sk0_23)
| ~ spl0_18 ),
inference(component_clause,[status(thm)],[f447]) ).
fof(f450,plain,
( spl0_19
<=> pd0_4(sk0_24) ),
introduced(split_symbol_definition) ).
fof(f451,plain,
( pd0_4(sk0_24)
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f450]) ).
fof(f453,plain,
( spl0_20
<=> pd0_5(sk0_25) ),
introduced(split_symbol_definition) ).
fof(f454,plain,
( pd0_5(sk0_25)
| ~ spl0_20 ),
inference(component_clause,[status(thm)],[f453]) ).
fof(f456,plain,
( spl0_21
<=> pd0_6(sk0_26) ),
introduced(split_symbol_definition) ).
fof(f457,plain,
( pd0_6(sk0_26)
| ~ spl0_21 ),
inference(component_clause,[status(thm)],[f456]) ).
fof(f459,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13
| ~ spl0_14
| ~ spl0_15
| ~ spl0_16
| ~ spl0_17
| spl0_18
| spl0_19
| spl0_20
| spl0_21
| spl0_0 ),
inference(split_clause,[status(thm)],[f289,f405,f408,f411,f414,f417,f420,f423,f426,f429,f432,f435,f438,f441,f444,f447,f450,f453,f456,f390]) ).
fof(f460,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9
| ~ spl0_10
| ~ spl0_11
| ~ spl0_12
| ~ spl0_13
| ~ spl0_14
| ~ spl0_15
| ~ spl0_16
| ~ spl0_17
| spl0_18
| spl0_19
| spl0_20
| spl0_21
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f290,f405,f408,f411,f414,f417,f420,f423,f426,f429,f432,f435,f438,f441,f444,f447,f450,f453,f456,f393,f397,f401]) ).
fof(f463,plain,
( $false
| spl0_17 ),
inference(forward_subsumption_resolution,[status(thm)],[f446,f281]) ).
fof(f464,plain,
spl0_17,
inference(contradiction_clause,[status(thm)],[f463]) ).
fof(f465,plain,
( $false
| spl0_16 ),
inference(forward_subsumption_resolution,[status(thm)],[f443,f280]) ).
fof(f466,plain,
spl0_16,
inference(contradiction_clause,[status(thm)],[f465]) ).
fof(f467,plain,
( $false
| spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f440,f278]) ).
fof(f468,plain,
spl0_15,
inference(contradiction_clause,[status(thm)],[f467]) ).
fof(f469,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f437,f277]) ).
fof(f470,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f469]) ).
fof(f471,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f434,f276]) ).
fof(f472,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f471]) ).
fof(f473,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f431,f275]) ).
fof(f474,plain,
spl0_12,
inference(contradiction_clause,[status(thm)],[f473]) ).
fof(f475,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f428,f274]) ).
fof(f476,plain,
spl0_11,
inference(contradiction_clause,[status(thm)],[f475]) ).
fof(f477,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f425,f272]) ).
fof(f478,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f477]) ).
fof(f479,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f422,f271]) ).
fof(f480,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f479]) ).
fof(f481,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f419,f270]) ).
fof(f482,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f481]) ).
fof(f483,plain,
( init != init
| spl0_7 ),
inference(forward_demodulation,[status(thm)],[f269,f416]) ).
fof(f484,plain,
( $false
| spl0_7 ),
inference(trivial_equality_resolution,[status(esa)],[f483]) ).
fof(f485,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f484]) ).
fof(f486,plain,
( init != init
| spl0_6 ),
inference(forward_demodulation,[status(thm)],[f268,f413]) ).
fof(f487,plain,
( $false
| spl0_6 ),
inference(trivial_equality_resolution,[status(esa)],[f486]) ).
fof(f488,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f487]) ).
fof(f489,plain,
( init != init
| spl0_5 ),
inference(forward_demodulation,[status(thm)],[f267,f410]) ).
fof(f490,plain,
( $false
| spl0_5 ),
inference(trivial_equality_resolution,[status(esa)],[f489]) ).
fof(f491,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f490]) ).
fof(f492,plain,
( $false
| spl0_4 ),
inference(trivial_equality_resolution,[status(esa)],[f407]) ).
fof(f493,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f492]) ).
fof(f494,plain,
! [X0] :
( ~ pd0_4(X0)
| ~ leq(n0,X0)
| ~ leq(X0,n3) ),
inference(resolution,[status(thm)],[f375,f283]) ).
fof(f495,plain,
! [X0] :
( ~ pd0_4(X0)
| ~ leq(X0,n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f494,f373]) ).
fof(f496,plain,
! [X0] : ~ pd0_4(X0),
inference(forward_subsumption_resolution,[status(thm)],[f495,f374]) ).
fof(f497,plain,
! [X0] :
( ~ pd0_5(X0)
| ~ leq(n0,X0)
| ~ leq(X0,n2) ),
inference(resolution,[status(thm)],[f379,f284]) ).
fof(f498,plain,
! [X0] :
( ~ pd0_5(X0)
| ~ leq(X0,n2) ),
inference(forward_subsumption_resolution,[status(thm)],[f497,f377]) ).
fof(f499,plain,
! [X0] : ~ pd0_5(X0),
inference(forward_subsumption_resolution,[status(thm)],[f498,f378]) ).
fof(f516,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(resolution,[status(thm)],[f371,f282]) ).
fof(f517,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f516,f367]) ).
fof(f525,plain,
! [X0] :
( ~ pd0_6(X0)
| ~ leq(n0,X0)
| a_select2(s_try7_init,X0) = init ),
inference(resolution,[status(thm)],[f382,f285]) ).
fof(f526,plain,
! [X0] :
( ~ pd0_6(X0)
| a_select2(s_try7_init,X0) = init ),
inference(forward_subsumption_resolution,[status(thm)],[f525,f381]) ).
fof(f527,plain,
! [X0] : ~ pd0_6(X0),
inference(forward_subsumption_resolution,[status(thm)],[f526,f383]) ).
fof(f528,plain,
( $false
| ~ spl0_21 ),
inference(backward_subsumption_resolution,[status(thm)],[f457,f527]) ).
fof(f529,plain,
~ spl0_21,
inference(contradiction_clause,[status(thm)],[f528]) ).
fof(f530,plain,
( $false
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[status(thm)],[f454,f499]) ).
fof(f531,plain,
~ spl0_20,
inference(contradiction_clause,[status(thm)],[f530]) ).
fof(f532,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f517,f368]) ).
fof(f533,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_31(X0))
| ~ pd0_3(X0) ),
inference(resolution,[status(thm)],[f532,f370]) ).
fof(f534,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_31(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f533]) ).
fof(f535,plain,
! [X0] : ~ pd0_3(X0),
inference(forward_subsumption_resolution,[status(thm)],[f534,f369]) ).
fof(f536,plain,
( $false
| ~ spl0_18 ),
inference(backward_subsumption_resolution,[status(thm)],[f448,f535]) ).
fof(f537,plain,
~ spl0_18,
inference(contradiction_clause,[status(thm)],[f536]) ).
fof(f538,plain,
( $false
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[status(thm)],[f451,f496]) ).
fof(f539,plain,
~ spl0_19,
inference(contradiction_clause,[status(thm)],[f538]) ).
fof(f540,plain,
$false,
inference(sat_refutation,[status(thm)],[f396,f400,f404,f459,f460,f464,f466,f468,f470,f472,f474,f476,f478,f480,f482,f485,f488,f491,f493,f529,f531,f537,f539]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV025+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.05/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.31 % Computer : n019.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue May 30 11:40:10 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.32 % Drodi V3.5.1
% 0.16/0.40 % Refutation found
% 0.16/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.45/0.62 % Elapsed time: 0.095396 seconds
% 0.45/0.62 % CPU time: 0.254733 seconds
% 0.45/0.62 % Memory used: 32.847 MB
%------------------------------------------------------------------------------