TSTP Solution File: SWV034+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV034+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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:31 EDT 2023
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 25
% Syntax : Number of formulae : 154 ( 34 unt; 0 def)
% Number of atoms : 649 ( 161 equ)
% Maximal formula atoms : 59 ( 4 avg)
% Number of connectives : 763 ( 268 ~; 264 |; 181 &)
% ( 20 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 28 ( 26 usr; 21 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 25 con; 0-3 aty)
% Number of variables : 98 (; 87 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( 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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,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,
~ ( ( 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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,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(f251,plain,
( 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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,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(f252,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,[f251]) ).
fof(f253,plain,
! [H] :
( pd0_4(H)
=> ( leq(n0,H)
& leq(H,n3)
& a_select2(s_values7_init,H) != init ) ),
introduced(predicate_definition,[f251]) ).
fof(f254,plain,
! [I] :
( pd0_5(I)
=> ( leq(n0,I)
& leq(I,n2)
& a_select2(s_center7_init,I) != init ) ),
introduced(predicate_definition,[f251]) ).
fof(f255,plain,
! [J] :
( pd0_6(J)
=> ( leq(n0,J)
& leq(J,minus(n3,n1))
& a_select2(s_try7_init,J) != init ) ),
introduced(predicate_definition,[f251]) ).
fof(f256,plain,
( 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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,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)],[f251,f255,f254,f253,f252]) ).
fof(f257,plain,
( 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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv19,minus(n410,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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,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)],[f256]) ).
fof(f258,plain,
s_best7_init = init,
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f259,plain,
s_sworst7_init = init,
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f260,plain,
s_worst7_init = init,
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f261,plain,
leq(n0,s_best7),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f262,plain,
leq(n0,s_sworst7),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f263,plain,
leq(n0,s_worst7),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f264,plain,
leq(n0,pv19),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f265,plain,
leq(s_best7,n3),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f266,plain,
leq(s_sworst7,n3),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f267,plain,
leq(s_worst7,n3),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f268,plain,
leq(pv19,minus(n410,n1)),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f269,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)],[f257]) ).
fof(f270,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n3)
| a_select2(s_values7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f271,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| a_select2(s_center7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f272,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,minus(n3,n1))
| a_select2(s_try7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f273,plain,
( ~ gt(loopcounter,n1)
| pvar1400_init = init ),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f274,plain,
( ~ gt(loopcounter,n1)
| pvar1401_init = init ),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f275,plain,
( ~ gt(loopcounter,n1)
| pvar1402_init = init ),
inference(cnf_transformation,[status(esa)],[f257]) ).
fof(f276,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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,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)],[f257]) ).
fof(f277,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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ~ leq(pv19,minus(n410,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)],[f257]) ).
fof(f344,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)],[f252]) ).
fof(f345,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)],[f344]) ).
fof(f346,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f345]) ).
fof(f347,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f345]) ).
fof(f348,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(n0,sk0_31(X0)) ),
inference(cnf_transformation,[status(esa)],[f345]) ).
fof(f349,plain,
! [X0] :
( ~ pd0_3(X0)
| leq(sk0_31(X0),n3) ),
inference(cnf_transformation,[status(esa)],[f345]) ).
fof(f350,plain,
! [X0] :
( ~ pd0_3(X0)
| a_select3(simplex7_init,sk0_31(X0),X0) != init ),
inference(cnf_transformation,[status(esa)],[f345]) ).
fof(f351,plain,
! [H] :
( ~ pd0_4(H)
| ( leq(n0,H)
& leq(H,n3)
& a_select2(s_values7_init,H) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f253]) ).
fof(f352,plain,
! [X0] :
( ~ pd0_4(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f351]) ).
fof(f353,plain,
! [X0] :
( ~ pd0_4(X0)
| leq(X0,n3) ),
inference(cnf_transformation,[status(esa)],[f351]) ).
fof(f354,plain,
! [X0] :
( ~ pd0_4(X0)
| a_select2(s_values7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f351]) ).
fof(f355,plain,
! [I] :
( ~ pd0_5(I)
| ( leq(n0,I)
& leq(I,n2)
& a_select2(s_center7_init,I) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f254]) ).
fof(f356,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f355]) ).
fof(f357,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f355]) ).
fof(f358,plain,
! [X0] :
( ~ pd0_5(X0)
| a_select2(s_center7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f355]) ).
fof(f359,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)],[f255]) ).
fof(f360,plain,
! [X0] :
( ~ pd0_6(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f359]) ).
fof(f361,plain,
! [X0] :
( ~ pd0_6(X0)
| leq(X0,minus(n3,n1)) ),
inference(cnf_transformation,[status(esa)],[f359]) ).
fof(f362,plain,
! [X0] :
( ~ pd0_6(X0)
| a_select2(s_try7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f359]) ).
fof(f369,plain,
( spl0_0
<=> gt(loopcounter,n1) ),
introduced(split_symbol_definition) ).
fof(f372,plain,
( spl0_1
<=> pvar1400_init = init ),
introduced(split_symbol_definition) ).
fof(f375,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f273,f369,f372]) ).
fof(f376,plain,
( spl0_2
<=> pvar1401_init = init ),
introduced(split_symbol_definition) ).
fof(f379,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f274,f369,f376]) ).
fof(f380,plain,
( spl0_3
<=> pvar1402_init = init ),
introduced(split_symbol_definition) ).
fof(f383,plain,
( ~ spl0_0
| spl0_3 ),
inference(split_clause,[status(thm)],[f275,f369,f380]) ).
fof(f384,plain,
( spl0_4
<=> init = init ),
introduced(split_symbol_definition) ).
fof(f386,plain,
( init != init
| spl0_4 ),
inference(component_clause,[status(thm)],[f384]) ).
fof(f387,plain,
( spl0_5
<=> s_best7_init = init ),
introduced(split_symbol_definition) ).
fof(f389,plain,
( s_best7_init != init
| spl0_5 ),
inference(component_clause,[status(thm)],[f387]) ).
fof(f390,plain,
( spl0_6
<=> s_sworst7_init = init ),
introduced(split_symbol_definition) ).
fof(f392,plain,
( s_sworst7_init != init
| spl0_6 ),
inference(component_clause,[status(thm)],[f390]) ).
fof(f393,plain,
( spl0_7
<=> s_worst7_init = init ),
introduced(split_symbol_definition) ).
fof(f395,plain,
( s_worst7_init != init
| spl0_7 ),
inference(component_clause,[status(thm)],[f393]) ).
fof(f396,plain,
( spl0_8
<=> leq(n0,s_best7) ),
introduced(split_symbol_definition) ).
fof(f398,plain,
( ~ leq(n0,s_best7)
| spl0_8 ),
inference(component_clause,[status(thm)],[f396]) ).
fof(f399,plain,
( spl0_9
<=> leq(n0,s_sworst7) ),
introduced(split_symbol_definition) ).
fof(f401,plain,
( ~ leq(n0,s_sworst7)
| spl0_9 ),
inference(component_clause,[status(thm)],[f399]) ).
fof(f402,plain,
( spl0_10
<=> leq(n0,s_worst7) ),
introduced(split_symbol_definition) ).
fof(f404,plain,
( ~ leq(n0,s_worst7)
| spl0_10 ),
inference(component_clause,[status(thm)],[f402]) ).
fof(f405,plain,
( spl0_11
<=> leq(n0,pv19) ),
introduced(split_symbol_definition) ).
fof(f407,plain,
( ~ leq(n0,pv19)
| spl0_11 ),
inference(component_clause,[status(thm)],[f405]) ).
fof(f408,plain,
( spl0_12
<=> leq(s_best7,n3) ),
introduced(split_symbol_definition) ).
fof(f410,plain,
( ~ leq(s_best7,n3)
| spl0_12 ),
inference(component_clause,[status(thm)],[f408]) ).
fof(f411,plain,
( spl0_13
<=> leq(s_sworst7,n3) ),
introduced(split_symbol_definition) ).
fof(f413,plain,
( ~ leq(s_sworst7,n3)
| spl0_13 ),
inference(component_clause,[status(thm)],[f411]) ).
fof(f414,plain,
( spl0_14
<=> leq(s_worst7,n3) ),
introduced(split_symbol_definition) ).
fof(f416,plain,
( ~ leq(s_worst7,n3)
| spl0_14 ),
inference(component_clause,[status(thm)],[f414]) ).
fof(f417,plain,
( spl0_15
<=> leq(pv19,minus(n410,n1)) ),
introduced(split_symbol_definition) ).
fof(f419,plain,
( ~ leq(pv19,minus(n410,n1))
| spl0_15 ),
inference(component_clause,[status(thm)],[f417]) ).
fof(f420,plain,
( spl0_16
<=> pd0_3(sk0_23) ),
introduced(split_symbol_definition) ).
fof(f421,plain,
( pd0_3(sk0_23)
| ~ spl0_16 ),
inference(component_clause,[status(thm)],[f420]) ).
fof(f423,plain,
( spl0_17
<=> pd0_4(sk0_24) ),
introduced(split_symbol_definition) ).
fof(f424,plain,
( pd0_4(sk0_24)
| ~ spl0_17 ),
inference(component_clause,[status(thm)],[f423]) ).
fof(f426,plain,
( spl0_18
<=> pd0_5(sk0_25) ),
introduced(split_symbol_definition) ).
fof(f427,plain,
( pd0_5(sk0_25)
| ~ spl0_18 ),
inference(component_clause,[status(thm)],[f426]) ).
fof(f429,plain,
( spl0_19
<=> pd0_6(sk0_26) ),
introduced(split_symbol_definition) ).
fof(f430,plain,
( pd0_6(sk0_26)
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f429]) ).
fof(f432,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_0 ),
inference(split_clause,[status(thm)],[f276,f384,f387,f390,f393,f396,f399,f402,f405,f408,f411,f414,f417,f420,f423,f426,f429,f369]) ).
fof(f433,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_1
| ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f277,f384,f387,f390,f393,f396,f399,f402,f405,f408,f411,f414,f417,f420,f423,f426,f429,f372,f376,f380]) ).
fof(f436,plain,
s_sworst7_init = s_best7_init,
inference(forward_demodulation,[status(thm)],[f258,f259]) ).
fof(f437,plain,
s_worst7_init = s_best7_init,
inference(forward_demodulation,[status(thm)],[f258,f260]) ).
fof(f438,plain,
! [X0,X1] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| ~ leq(n0,X1)
| ~ leq(X1,n3)
| a_select3(simplex7_init,X1,X0) = s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f269]) ).
fof(f439,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n3)
| a_select2(s_values7_init,X0) = s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f270]) ).
fof(f440,plain,
! [X0] :
( ~ pd0_4(X0)
| a_select2(s_values7_init,X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f354]) ).
fof(f441,plain,
! [X0] :
( ~ pd0_4(X0)
| ~ leq(n0,X0)
| ~ leq(X0,n3) ),
inference(resolution,[status(thm)],[f440,f439]) ).
fof(f442,plain,
! [X0] :
( ~ pd0_4(X0)
| ~ leq(X0,n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f441,f352]) ).
fof(f443,plain,
! [X0] : ~ pd0_4(X0),
inference(forward_subsumption_resolution,[status(thm)],[f442,f353]) ).
fof(f444,plain,
! [X0] :
( ~ pd0_5(X0)
| a_select2(s_center7_init,X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f358]) ).
fof(f445,plain,
! [X0] :
( ~ pd0_6(X0)
| a_select2(s_try7_init,X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f362]) ).
fof(f446,plain,
( $false
| spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f419,f268]) ).
fof(f447,plain,
spl0_15,
inference(contradiction_clause,[status(thm)],[f446]) ).
fof(f448,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f416,f267]) ).
fof(f449,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f448]) ).
fof(f450,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f413,f266]) ).
fof(f451,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f450]) ).
fof(f452,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f410,f265]) ).
fof(f453,plain,
spl0_12,
inference(contradiction_clause,[status(thm)],[f452]) ).
fof(f454,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f407,f264]) ).
fof(f455,plain,
spl0_11,
inference(contradiction_clause,[status(thm)],[f454]) ).
fof(f456,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f404,f263]) ).
fof(f457,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f456]) ).
fof(f458,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f401,f262]) ).
fof(f459,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f458]) ).
fof(f460,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f398,f261]) ).
fof(f461,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f460]) ).
fof(f462,plain,
( s_best7_init != init
| spl0_7 ),
inference(forward_demodulation,[status(thm)],[f437,f395]) ).
fof(f463,plain,
( s_best7_init != s_best7_init
| spl0_7 ),
inference(forward_demodulation,[status(thm)],[f258,f462]) ).
fof(f464,plain,
( $false
| spl0_7 ),
inference(trivial_equality_resolution,[status(esa)],[f463]) ).
fof(f465,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f464]) ).
fof(f466,plain,
( s_best7_init != init
| spl0_6 ),
inference(forward_demodulation,[status(thm)],[f436,f392]) ).
fof(f467,plain,
( s_best7_init != s_best7_init
| spl0_6 ),
inference(forward_demodulation,[status(thm)],[f258,f466]) ).
fof(f468,plain,
( $false
| spl0_6 ),
inference(trivial_equality_resolution,[status(esa)],[f467]) ).
fof(f469,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f468]) ).
fof(f471,plain,
( s_best7_init != s_best7_init
| spl0_5 ),
inference(forward_demodulation,[status(thm)],[f258,f389]) ).
fof(f472,plain,
( $false
| spl0_5 ),
inference(trivial_equality_resolution,[status(esa)],[f471]) ).
fof(f473,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f472]) ).
fof(f475,plain,
( s_best7_init != init
| spl0_4 ),
inference(forward_demodulation,[status(thm)],[f258,f386]) ).
fof(f476,plain,
( s_best7_init != s_best7_init
| spl0_4 ),
inference(forward_demodulation,[status(thm)],[f258,f475]) ).
fof(f477,plain,
( $false
| spl0_4 ),
inference(trivial_equality_resolution,[status(esa)],[f476]) ).
fof(f478,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f477]) ).
fof(f479,plain,
! [X0] :
( ~ pd0_3(X0)
| a_select3(simplex7_init,sk0_31(X0),X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f350]) ).
fof(f480,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)],[f479,f438]) ).
fof(f481,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f480,f346]) ).
fof(f482,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| a_select2(s_center7_init,X0) = s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f271]) ).
fof(f483,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| ~ pd0_5(X0) ),
inference(resolution,[status(thm)],[f482,f444]) ).
fof(f484,plain,
! [X0] :
( ~ leq(X0,n2)
| ~ pd0_5(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f483,f356]) ).
fof(f485,plain,
! [X0] : ~ pd0_5(X0),
inference(forward_subsumption_resolution,[status(thm)],[f484,f357]) ).
fof(f486,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,minus(n3,n1))
| a_select2(s_try7_init,X0) = s_best7_init ),
inference(forward_demodulation,[status(thm)],[f258,f272]) ).
fof(f503,plain,
! [X0] :
( ~ leq(n0,X0)
| a_select2(s_try7_init,X0) = s_best7_init
| ~ pd0_6(X0) ),
inference(resolution,[status(thm)],[f486,f361]) ).
fof(f504,plain,
! [X0] :
( a_select2(s_try7_init,X0) = s_best7_init
| ~ pd0_6(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f503,f360]) ).
fof(f505,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f481,f347]) ).
fof(f506,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_31(X0))
| ~ pd0_3(X0) ),
inference(resolution,[status(thm)],[f505,f349]) ).
fof(f507,plain,
! [X0] :
( ~ pd0_3(X0)
| ~ leq(n0,sk0_31(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f506]) ).
fof(f508,plain,
! [X0] : ~ pd0_3(X0),
inference(forward_subsumption_resolution,[status(thm)],[f507,f348]) ).
fof(f509,plain,
! [X0] : ~ pd0_6(X0),
inference(forward_subsumption_resolution,[status(thm)],[f504,f445]) ).
fof(f510,plain,
( $false
| ~ spl0_19 ),
inference(backward_subsumption_resolution,[status(thm)],[f430,f509]) ).
fof(f511,plain,
~ spl0_19,
inference(contradiction_clause,[status(thm)],[f510]) ).
fof(f512,plain,
( $false
| ~ spl0_18 ),
inference(forward_subsumption_resolution,[status(thm)],[f427,f485]) ).
fof(f513,plain,
~ spl0_18,
inference(contradiction_clause,[status(thm)],[f512]) ).
fof(f514,plain,
( $false
| ~ spl0_16 ),
inference(forward_subsumption_resolution,[status(thm)],[f421,f508]) ).
fof(f515,plain,
~ spl0_16,
inference(contradiction_clause,[status(thm)],[f514]) ).
fof(f516,plain,
( $false
| ~ spl0_17 ),
inference(forward_subsumption_resolution,[status(thm)],[f424,f443]) ).
fof(f517,plain,
~ spl0_17,
inference(contradiction_clause,[status(thm)],[f516]) ).
fof(f518,plain,
$false,
inference(sat_refutation,[status(thm)],[f375,f379,f383,f432,f433,f447,f449,f451,f453,f455,f457,f459,f461,f465,f469,f473,f478,f511,f513,f515,f517]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV034+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue May 30 12:03:48 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.12/0.37 % Refutation found
% 0.12/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.38 % Elapsed time: 0.046404 seconds
% 0.19/0.38 % CPU time: 0.159223 seconds
% 0.19/0.38 % Memory used: 21.252 MB
%------------------------------------------------------------------------------