TSTP Solution File: SWV038+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV038+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:31 EDT 2023
% Result : Theorem 0.13s 0.34s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 27
% Syntax : Number of formulae : 154 ( 33 unt; 0 def)
% Number of atoms : 675 ( 187 equ)
% Maximal formula atoms : 59 ( 4 avg)
% Number of connectives : 817 ( 296 ~; 282 |; 184 &)
% ( 20 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 30 ( 28 usr; 23 prp; 0-2 aty)
% Number of functors : 28 ( 28 usr; 24 con; 0-3 aty)
% Number of variables : 103 (; 82 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,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,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
& ( n0 != pv1413
=> ( 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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& ! [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 ) ) ) )
& ( n0 = pv1413
=> true ) ) ),
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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,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,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
& ( n0 != pv1413
=> ( 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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& ! [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 ) ) ) )
& ( n0 = pv1413
=> true ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f242,plain,
true,
inference(cnf_transformation,[status(esa)],[f51]) ).
fof(f244,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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,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,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
| ( n0 != pv1413
& ( 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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ? [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 ) ) ) )
| ( n0 = pv1413
& ~ true ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
( pd0_3
=> ( n0 != pv1413
& ( 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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ? [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 ) ) ) ) ),
introduced(predicate_definition,[f244]) ).
fof(f246,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(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,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,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
| pd0_3
| ( n0 = pv1413
& ~ true ) ) ),
inference(formula_renaming,[status(thm)],[f244,f245]) ).
fof(f247,plain,
s_best7_init = init,
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f248,plain,
s_sworst7_init = init,
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f249,plain,
s_worst7_init = init,
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f250,plain,
leq(n0,s_best7),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f251,plain,
leq(n0,s_sworst7),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f252,plain,
leq(n0,s_worst7),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f253,plain,
leq(s_best7,n3),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f254,plain,
leq(s_sworst7,n3),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f255,plain,
leq(s_worst7,n3),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f256,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)],[f246]) ).
fof(f257,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n3)
| a_select2(s_values7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f258,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| a_select2(s_center7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f259,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,minus(n3,n1))
| a_select2(s_try7_init,X0) = init ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f260,plain,
( ~ gt(loopcounter,n1)
| pvar1400_init = init ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f261,plain,
( ~ gt(loopcounter,n1)
| pvar1401_init = init ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f262,plain,
( ~ gt(loopcounter,n1)
| pvar1402_init = init ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f264,plain,
( init != init
| pd0_3
| ~ true ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f324,plain,
( ~ pd0_3
| ( n0 != pv1413
& ( 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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ? [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)],[f245]) ).
fof(f325,plain,
! [F] :
( pd0_5(F)
=> ( leq(n0,F)
& leq(F,n2)
& ? [G] :
( leq(n0,G)
& leq(G,n3)
& a_select3(simplex7_init,G,F) != init ) ) ),
introduced(predicate_definition,[f324]) ).
fof(f326,plain,
! [H] :
( pd0_6(H)
=> ( leq(n0,H)
& leq(H,n3)
& a_select2(s_values7_init,H) != init ) ),
introduced(predicate_definition,[f324]) ).
fof(f327,plain,
! [I] :
( pd0_7(I)
=> ( leq(n0,I)
& leq(I,n2)
& a_select2(s_center7_init,I) != init ) ),
introduced(predicate_definition,[f324]) ).
fof(f328,plain,
! [J] :
( pd0_8(J)
=> ( leq(n0,J)
& leq(J,minus(n3,n1))
& a_select2(s_try7_init,J) != init ) ),
introduced(predicate_definition,[f324]) ).
fof(f329,plain,
( ~ pd0_3
| ( n0 != pv1413
& ( 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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| ? [F] : pd0_5(F)
| ? [H] : pd0_6(H)
| ? [I] : pd0_7(I)
| ? [J] : pd0_8(J)
| ( gt(loopcounter,n1)
& ( pvar1400_init != init
| pvar1401_init != init
| pvar1402_init != init ) ) ) ) ),
inference(formula_renaming,[status(thm)],[f324,f328,f327,f326,f325]) ).
fof(f330,plain,
( ~ pd0_3
| ( n0 != pv1413
& ( 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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| pd0_5(sk0_27)
| pd0_6(sk0_28)
| pd0_7(sk0_29)
| pd0_8(sk0_30)
| ( gt(loopcounter,n1)
& ( pvar1400_init != init
| pvar1401_init != init
| pvar1402_init != init ) ) ) ) ),
inference(skolemization,[status(esa)],[f329]) ).
fof(f332,plain,
( ~ pd0_3
| 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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| pd0_5(sk0_27)
| pd0_6(sk0_28)
| pd0_7(sk0_29)
| pd0_8(sk0_30)
| gt(loopcounter,n1) ),
inference(cnf_transformation,[status(esa)],[f330]) ).
fof(f333,plain,
( ~ pd0_3
| 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(s_best7,n3)
| ~ leq(s_sworst7,n3)
| ~ leq(s_worst7,n3)
| pd0_5(sk0_27)
| pd0_6(sk0_28)
| pd0_7(sk0_29)
| pd0_8(sk0_30)
| pvar1400_init != init
| pvar1401_init != init
| pvar1402_init != init ),
inference(cnf_transformation,[status(esa)],[f330]) ).
fof(f340,plain,
! [F] :
( ~ pd0_5(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)],[f325]) ).
fof(f341,plain,
! [F] :
( ~ pd0_5(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)],[f340]) ).
fof(f342,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f341]) ).
fof(f343,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f341]) ).
fof(f344,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(n0,sk0_31(X0)) ),
inference(cnf_transformation,[status(esa)],[f341]) ).
fof(f345,plain,
! [X0] :
( ~ pd0_5(X0)
| leq(sk0_31(X0),n3) ),
inference(cnf_transformation,[status(esa)],[f341]) ).
fof(f346,plain,
! [X0] :
( ~ pd0_5(X0)
| a_select3(simplex7_init,sk0_31(X0),X0) != init ),
inference(cnf_transformation,[status(esa)],[f341]) ).
fof(f347,plain,
! [H] :
( ~ pd0_6(H)
| ( leq(n0,H)
& leq(H,n3)
& a_select2(s_values7_init,H) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f326]) ).
fof(f348,plain,
! [X0] :
( ~ pd0_6(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f347]) ).
fof(f349,plain,
! [X0] :
( ~ pd0_6(X0)
| leq(X0,n3) ),
inference(cnf_transformation,[status(esa)],[f347]) ).
fof(f350,plain,
! [X0] :
( ~ pd0_6(X0)
| a_select2(s_values7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f347]) ).
fof(f351,plain,
! [I] :
( ~ pd0_7(I)
| ( leq(n0,I)
& leq(I,n2)
& a_select2(s_center7_init,I) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f327]) ).
fof(f352,plain,
! [X0] :
( ~ pd0_7(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f351]) ).
fof(f353,plain,
! [X0] :
( ~ pd0_7(X0)
| leq(X0,n2) ),
inference(cnf_transformation,[status(esa)],[f351]) ).
fof(f354,plain,
! [X0] :
( ~ pd0_7(X0)
| a_select2(s_center7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f351]) ).
fof(f355,plain,
! [J] :
( ~ pd0_8(J)
| ( leq(n0,J)
& leq(J,minus(n3,n1))
& a_select2(s_try7_init,J) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f328]) ).
fof(f356,plain,
! [X0] :
( ~ pd0_8(X0)
| leq(n0,X0) ),
inference(cnf_transformation,[status(esa)],[f355]) ).
fof(f357,plain,
! [X0] :
( ~ pd0_8(X0)
| leq(X0,minus(n3,n1)) ),
inference(cnf_transformation,[status(esa)],[f355]) ).
fof(f358,plain,
! [X0] :
( ~ pd0_8(X0)
| a_select2(s_try7_init,X0) != init ),
inference(cnf_transformation,[status(esa)],[f355]) ).
fof(f359,plain,
( spl0_0
<=> gt(loopcounter,n1) ),
introduced(split_symbol_definition) ).
fof(f362,plain,
( spl0_1
<=> pvar1400_init = init ),
introduced(split_symbol_definition) ).
fof(f365,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f260,f359,f362]) ).
fof(f366,plain,
( spl0_2
<=> pvar1401_init = init ),
introduced(split_symbol_definition) ).
fof(f369,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f261,f359,f366]) ).
fof(f370,plain,
( spl0_3
<=> pvar1402_init = init ),
introduced(split_symbol_definition) ).
fof(f373,plain,
( ~ spl0_0
| spl0_3 ),
inference(split_clause,[status(thm)],[f262,f359,f370]) ).
fof(f374,plain,
( spl0_4
<=> init = init ),
introduced(split_symbol_definition) ).
fof(f376,plain,
( init != init
| spl0_4 ),
inference(component_clause,[status(thm)],[f374]) ).
fof(f377,plain,
( spl0_5
<=> pd0_3 ),
introduced(split_symbol_definition) ).
fof(f384,plain,
( spl0_7
<=> true ),
introduced(split_symbol_definition) ).
fof(f386,plain,
( ~ true
| spl0_7 ),
inference(component_clause,[status(thm)],[f384]) ).
fof(f387,plain,
( ~ spl0_4
| spl0_5
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f264,f374,f377,f384]) ).
fof(f389,plain,
( spl0_8
<=> s_best7_init = init ),
introduced(split_symbol_definition) ).
fof(f391,plain,
( s_best7_init != init
| spl0_8 ),
inference(component_clause,[status(thm)],[f389]) ).
fof(f392,plain,
( spl0_9
<=> s_sworst7_init = init ),
introduced(split_symbol_definition) ).
fof(f394,plain,
( s_sworst7_init != init
| spl0_9 ),
inference(component_clause,[status(thm)],[f392]) ).
fof(f395,plain,
( spl0_10
<=> s_worst7_init = init ),
introduced(split_symbol_definition) ).
fof(f397,plain,
( s_worst7_init != init
| spl0_10 ),
inference(component_clause,[status(thm)],[f395]) ).
fof(f398,plain,
( spl0_11
<=> leq(n0,s_best7) ),
introduced(split_symbol_definition) ).
fof(f400,plain,
( ~ leq(n0,s_best7)
| spl0_11 ),
inference(component_clause,[status(thm)],[f398]) ).
fof(f401,plain,
( spl0_12
<=> leq(n0,s_sworst7) ),
introduced(split_symbol_definition) ).
fof(f403,plain,
( ~ leq(n0,s_sworst7)
| spl0_12 ),
inference(component_clause,[status(thm)],[f401]) ).
fof(f404,plain,
( spl0_13
<=> leq(n0,s_worst7) ),
introduced(split_symbol_definition) ).
fof(f406,plain,
( ~ leq(n0,s_worst7)
| spl0_13 ),
inference(component_clause,[status(thm)],[f404]) ).
fof(f407,plain,
( spl0_14
<=> leq(s_best7,n3) ),
introduced(split_symbol_definition) ).
fof(f409,plain,
( ~ leq(s_best7,n3)
| spl0_14 ),
inference(component_clause,[status(thm)],[f407]) ).
fof(f410,plain,
( spl0_15
<=> leq(s_sworst7,n3) ),
introduced(split_symbol_definition) ).
fof(f412,plain,
( ~ leq(s_sworst7,n3)
| spl0_15 ),
inference(component_clause,[status(thm)],[f410]) ).
fof(f413,plain,
( spl0_16
<=> leq(s_worst7,n3) ),
introduced(split_symbol_definition) ).
fof(f415,plain,
( ~ leq(s_worst7,n3)
| spl0_16 ),
inference(component_clause,[status(thm)],[f413]) ).
fof(f416,plain,
( spl0_17
<=> pd0_5(sk0_27) ),
introduced(split_symbol_definition) ).
fof(f417,plain,
( pd0_5(sk0_27)
| ~ spl0_17 ),
inference(component_clause,[status(thm)],[f416]) ).
fof(f419,plain,
( spl0_18
<=> pd0_6(sk0_28) ),
introduced(split_symbol_definition) ).
fof(f420,plain,
( pd0_6(sk0_28)
| ~ spl0_18 ),
inference(component_clause,[status(thm)],[f419]) ).
fof(f422,plain,
( spl0_19
<=> pd0_7(sk0_29) ),
introduced(split_symbol_definition) ).
fof(f423,plain,
( pd0_7(sk0_29)
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f422]) ).
fof(f425,plain,
( spl0_20
<=> pd0_8(sk0_30) ),
introduced(split_symbol_definition) ).
fof(f426,plain,
( pd0_8(sk0_30)
| ~ spl0_20 ),
inference(component_clause,[status(thm)],[f425]) ).
fof(f428,plain,
( ~ spl0_5
| ~ spl0_4
| ~ 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_0 ),
inference(split_clause,[status(thm)],[f332,f377,f374,f389,f392,f395,f398,f401,f404,f407,f410,f413,f416,f419,f422,f425,f359]) ).
fof(f429,plain,
( ~ spl0_5
| ~ spl0_4
| ~ 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_1
| ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f333,f377,f374,f389,f392,f395,f398,f401,f404,f407,f410,f413,f416,f419,f422,f425,f362,f366,f370]) ).
fof(f432,plain,
( $false
| spl0_4 ),
inference(trivial_equality_resolution,[status(esa)],[f376]) ).
fof(f433,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f432]) ).
fof(f434,plain,
s_sworst7_init = s_best7_init,
inference(forward_demodulation,[status(thm)],[f247,f248]) ).
fof(f435,plain,
s_worst7_init = s_best7_init,
inference(forward_demodulation,[status(thm)],[f247,f249]) ).
fof(f436,plain,
( $false
| spl0_16 ),
inference(forward_subsumption_resolution,[status(thm)],[f415,f255]) ).
fof(f437,plain,
spl0_16,
inference(contradiction_clause,[status(thm)],[f436]) ).
fof(f438,plain,
( $false
| spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f412,f254]) ).
fof(f439,plain,
spl0_15,
inference(contradiction_clause,[status(thm)],[f438]) ).
fof(f440,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f409,f253]) ).
fof(f441,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f440]) ).
fof(f442,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f406,f252]) ).
fof(f443,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f442]) ).
fof(f444,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f403,f251]) ).
fof(f445,plain,
spl0_12,
inference(contradiction_clause,[status(thm)],[f444]) ).
fof(f446,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f400,f250]) ).
fof(f447,plain,
spl0_11,
inference(contradiction_clause,[status(thm)],[f446]) ).
fof(f448,plain,
( s_best7_init != init
| spl0_10 ),
inference(forward_demodulation,[status(thm)],[f435,f397]) ).
fof(f449,plain,
( s_best7_init != s_best7_init
| spl0_10 ),
inference(forward_demodulation,[status(thm)],[f247,f448]) ).
fof(f450,plain,
( $false
| spl0_10 ),
inference(trivial_equality_resolution,[status(esa)],[f449]) ).
fof(f451,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f450]) ).
fof(f452,plain,
( s_best7_init != init
| spl0_9 ),
inference(forward_demodulation,[status(thm)],[f434,f394]) ).
fof(f453,plain,
( s_best7_init != s_best7_init
| spl0_9 ),
inference(forward_demodulation,[status(thm)],[f247,f452]) ).
fof(f454,plain,
( $false
| spl0_9 ),
inference(trivial_equality_resolution,[status(esa)],[f453]) ).
fof(f455,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f454]) ).
fof(f457,plain,
( s_best7_init != s_best7_init
| spl0_8 ),
inference(forward_demodulation,[status(thm)],[f247,f391]) ).
fof(f458,plain,
( $false
| spl0_8 ),
inference(trivial_equality_resolution,[status(esa)],[f457]) ).
fof(f459,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f458]) ).
fof(f461,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)],[f247,f256]) ).
fof(f462,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n3)
| a_select2(s_values7_init,X0) = s_best7_init ),
inference(forward_demodulation,[status(thm)],[f247,f257]) ).
fof(f463,plain,
! [X0] :
( ~ pd0_6(X0)
| a_select2(s_values7_init,X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f247,f350]) ).
fof(f464,plain,
! [X0] :
( ~ pd0_6(X0)
| ~ leq(n0,X0)
| ~ leq(X0,n3) ),
inference(resolution,[status(thm)],[f463,f462]) ).
fof(f465,plain,
! [X0] :
( ~ pd0_6(X0)
| ~ leq(X0,n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f464,f348]) ).
fof(f466,plain,
! [X0] : ~ pd0_6(X0),
inference(forward_subsumption_resolution,[status(thm)],[f465,f349]) ).
fof(f467,plain,
! [X0] :
( ~ pd0_7(X0)
| a_select2(s_center7_init,X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f247,f354]) ).
fof(f468,plain,
! [X0] :
( ~ pd0_8(X0)
| a_select2(s_try7_init,X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f247,f358]) ).
fof(f469,plain,
! [X0] :
( ~ pd0_5(X0)
| a_select3(simplex7_init,sk0_31(X0),X0) != s_best7_init ),
inference(forward_demodulation,[status(thm)],[f247,f346]) ).
fof(f470,plain,
! [X0] :
( ~ pd0_5(X0)
| ~ leq(n0,X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(resolution,[status(thm)],[f469,f461]) ).
fof(f471,plain,
! [X0] :
( ~ pd0_5(X0)
| ~ leq(X0,n2)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f470,f342]) ).
fof(f472,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| a_select2(s_center7_init,X0) = s_best7_init ),
inference(forward_demodulation,[status(thm)],[f247,f258]) ).
fof(f473,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n2)
| ~ pd0_7(X0) ),
inference(resolution,[status(thm)],[f472,f467]) ).
fof(f474,plain,
! [X0] :
( ~ leq(X0,n2)
| ~ pd0_7(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f473,f352]) ).
fof(f475,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,minus(n3,n1))
| a_select2(s_try7_init,X0) = s_best7_init ),
inference(forward_demodulation,[status(thm)],[f247,f259]) ).
fof(f497,plain,
! [X0] :
( ~ leq(n0,X0)
| a_select2(s_try7_init,X0) = s_best7_init
| ~ pd0_8(X0) ),
inference(resolution,[status(thm)],[f475,f357]) ).
fof(f498,plain,
! [X0] :
( a_select2(s_try7_init,X0) = s_best7_init
| ~ pd0_8(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f497,f356]) ).
fof(f499,plain,
! [X0] :
( ~ pd0_5(X0)
| ~ leq(n0,sk0_31(X0))
| ~ leq(sk0_31(X0),n3) ),
inference(forward_subsumption_resolution,[status(thm)],[f471,f343]) ).
fof(f500,plain,
! [X0] :
( ~ pd0_5(X0)
| ~ leq(n0,sk0_31(X0))
| ~ pd0_5(X0) ),
inference(resolution,[status(thm)],[f499,f345]) ).
fof(f501,plain,
! [X0] :
( ~ pd0_5(X0)
| ~ leq(n0,sk0_31(X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f500]) ).
fof(f502,plain,
! [X0] : ~ pd0_5(X0),
inference(forward_subsumption_resolution,[status(thm)],[f501,f344]) ).
fof(f503,plain,
! [X0] : ~ pd0_7(X0),
inference(forward_subsumption_resolution,[status(thm)],[f474,f353]) ).
fof(f516,plain,
! [X0] : ~ pd0_8(X0),
inference(forward_subsumption_resolution,[status(thm)],[f498,f468]) ).
fof(f517,plain,
( $false
| ~ spl0_20 ),
inference(backward_subsumption_resolution,[status(thm)],[f426,f516]) ).
fof(f518,plain,
~ spl0_20,
inference(contradiction_clause,[status(thm)],[f517]) ).
fof(f519,plain,
( $false
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[status(thm)],[f423,f503]) ).
fof(f520,plain,
~ spl0_19,
inference(contradiction_clause,[status(thm)],[f519]) ).
fof(f521,plain,
( $false
| ~ spl0_17 ),
inference(forward_subsumption_resolution,[status(thm)],[f417,f502]) ).
fof(f522,plain,
~ spl0_17,
inference(contradiction_clause,[status(thm)],[f521]) ).
fof(f523,plain,
( $false
| ~ spl0_18 ),
inference(forward_subsumption_resolution,[status(thm)],[f420,f466]) ).
fof(f524,plain,
~ spl0_18,
inference(contradiction_clause,[status(thm)],[f523]) ).
fof(f525,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f242,f386]) ).
fof(f526,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f525]) ).
fof(f527,plain,
$false,
inference(sat_refutation,[status(thm)],[f365,f369,f373,f387,f428,f429,f433,f437,f439,f441,f443,f445,f447,f451,f455,f459,f518,f520,f522,f524,f526]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV038+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29 % Computer : n010.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue May 30 11:33:22 EDT 2023
% 0.08/0.29 % CPUTime :
% 0.13/0.30 % Drodi V3.5.1
% 0.13/0.34 % Refutation found
% 0.13/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.36 % Elapsed time: 0.071839 seconds
% 0.13/0.36 % CPU time: 0.133792 seconds
% 0.13/0.36 % Memory used: 21.402 MB
%------------------------------------------------------------------------------