TSTP Solution File: SWV036+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SWV036+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %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 Jul 27 13:19:43 EDT 2022

% Result   : Unknown 4.05s 4.23s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV036+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 06:11:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.28/2.47  ----- Otter 3.3f, August 2004 -----
% 2.28/2.47  The process was started by sandbox2 on n019.cluster.edu,
% 2.28/2.47  Wed Jul 27 06:11:37 2022
% 2.28/2.47  The command was "./otter".  The process ID is 30109.
% 2.28/2.47  
% 2.28/2.47  set(prolog_style_variables).
% 2.28/2.47  set(auto).
% 2.28/2.47     dependent: set(auto1).
% 2.28/2.47     dependent: set(process_input).
% 2.28/2.47     dependent: clear(print_kept).
% 2.28/2.47     dependent: clear(print_new_demod).
% 2.28/2.47     dependent: clear(print_back_demod).
% 2.28/2.47     dependent: clear(print_back_sub).
% 2.28/2.47     dependent: set(control_memory).
% 2.28/2.47     dependent: assign(max_mem, 12000).
% 2.28/2.47     dependent: assign(pick_given_ratio, 4).
% 2.28/2.47     dependent: assign(stats_level, 1).
% 2.28/2.47     dependent: assign(max_seconds, 10800).
% 2.28/2.47  clear(print_given).
% 2.28/2.47  
% 2.28/2.47  formula_list(usable).
% 2.28/2.47  all A (A=A).
% 2.28/2.47  all X Y (gt(X,Y)|gt(Y,X)|X=Y).
% 2.28/2.47  all X Y Z (gt(X,Y)>(Y,Z)->gt(X,Z)).
% 2.28/2.47  all X (-gt(X,X)).
% 2.28/2.47  all X le_q(X,X).
% 2.28/2.47  all X Y Z (le_q(X,Y)&le_q(Y,Z)->le_q(X,Z)).
% 2.28/2.47  all X Y (lt(X,Y)<->gt(Y,X)).
% 2.28/2.47  all X Y (ge_q(X,Y)<->le_q(Y,X)).
% 2.28/2.47  all X Y (gt(Y,X)->le_q(X,Y)).
% 2.28/2.47  all X Y (le_q(X,Y)&X!=Y->gt(Y,X)).
% 2.28/2.47  all X Y (le_q(X,pred(Y))<->gt(Y,X)).
% 2.28/2.47  all X gt(succ(X),X).
% 2.28/2.47  all X Y (le_q(X,Y)->le_q(X,succ(Y))).
% 2.28/2.47  all X Y (le_q(X,Y)<->gt(succ(Y),X)).
% 2.28/2.47  all X C (le_q(n0,X)->le_q(uniform_int_rnd(C,X),X)).
% 2.28/2.47  all X C (le_q(n0,X)->le_q(n0,uniform_int_rnd(C,X))).
% 2.28/2.47  all I L U Val (le_q(L,I)&le_q(I,U)->a_select2(tptp_const_array1(dim(L,U),Val),I)=Val).
% 2.28/2.47  all I L1 U1 J L2 U2 Val (le_q(L1,I)&le_q(I,U1)&le_q(L2,J)&le_q(J,U2)->a_select3(tptp_const_array2(dim(L1,U1),dim(L2,U2),Val),I,J)=Val).
% 2.28/2.47  all A N ((all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(A,I,J)=a_select3(A,J,I)))-> (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(trans(A),I,J)=a_select3(trans(A),J,I)))).
% 2.28/2.47  all A N ((all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(A,I,J)=a_select3(A,J,I)))-> (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(inv(A),I,J)=a_select3(inv(A),J,I)))).
% 2.28/2.47  all A N ((all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(A,I,J)=a_select3(A,J,I)))-> (all I J K VAL (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)&le_q(n0,K)&le_q(K,N)->a_select3(tptp_update3(A,K,K,VAL),I,J)=a_select3(tptp_update3(A,K,K,VAL),J,I)))).
% 2.28/2.47  all A B N ((all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(A,I,J)=a_select3(A,J,I)))& (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(B,I,J)=a_select3(B,J,I)))-> (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(tptp_madd(A,B),I,J)=a_select3(tptp_madd(A,B),J,I)))).
% 2.28/2.47  all A B N ((all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(A,I,J)=a_select3(A,J,I)))& (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(B,I,J)=a_select3(B,J,I)))-> (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(tptp_msub(A,B),I,J)=a_select3(tptp_msub(A,B),J,I)))).
% 2.28/2.47  all A B N ((all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(B,I,J)=a_select3(B,J,I)))-> (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J)=a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I)))).
% 2.28/2.47  all A B N M ((all I J (le_q(n0,I)&le_q(I,M)&le_q(n0,J)&le_q(J,M)->a_select3(B,I,J)=a_select3(B,J,I)))-> (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),I,J)=a_select3(tptp_mmul(A,tptp_mmul(B,trans(A))),J,I)))).
% 2.28/2.47  all A B C D E F N M ((all I J (le_q(n0,I)&le_q(I,M)&le_q(n0,J)&le_q(J,M)->a_select3(D,I,J)=a_select3(D,J,I)))& (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(A,I,J)=a_select3(A,J,I)))& (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(F,I,J)=a_select3(F,J,I)))-> (all I J (le_q(n0,I)&le_q(I,N)&le_q(n0,J)&le_q(J,N)->a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),I,J)=a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),J,I)))).
% 2.28/2.47  all Body (sum(n0,tptp_minus_1,Body)=n0).
% 2.28/2.47  all Body (tptp_float_0_0=sum(n0,tptp_minus_1,Body)).
% 2.28/2.47  succ(tptp_minus_1)=n0.
% 2.28/2.47  all X (plus(X,n1)=succ(X)).
% 2.28/2.47  all X (plus(n1,X)=succ(X)).
% 2.28/2.47  all X (plus(X,n2)=succ(succ(X))).
% 2.28/2.47  all X (plus(n2,X)=succ(succ(X))).
% 2.28/2.47  all X (plus(X,n3)=succ(succ(succ(X)))).
% 4.05/4.23  all X (plus(n3,X)=succ(succ(succ(X)))).
% 4.05/4.23  all X (plus(X,n4)=succ(succ(succ(succ(X))))).
% 4.05/4.23  all X (plus(n4,X)=succ(succ(succ(succ(X))))).
% 4.05/4.23  all X (plus(X,n5)=succ(succ(succ(succ(succ(X)))))).
% 4.05/4.23  all X (plus(n5,X)=succ(succ(succ(succ(succ(X)))))).
% 4.05/4.23  all X (minus(X,n1)=pred(X)).
% 4.05/4.23  all X (pred(succ(X))=X).
% 4.05/4.23  all X (succ(pred(X))=X).
% 4.05/4.23  all X Y (le_q(succ(X),succ(Y))<->le_q(X,Y)).
% 4.05/4.23  all X Y (le_q(succ(X),Y)->gt(Y,X)).
% 4.05/4.23  all X Y (le_q(minus(X,Y),X)->le_q(n0,Y)).
% 4.05/4.23  all X U V VAL (a_select3(tptp_update3(X,U,V,VAL),U,V)=VAL).
% 4.05/4.23  all I J U V X VAL VAL2 (I!=U&J=V&a_select3(X,U,V)=VAL->a_select3(tptp_update3(X,I,J,VAL2),U,V)=VAL).
% 4.05/4.23  all I J U V X VAL ((all I0 J0 (le_q(n0,I0)&le_q(n0,J0)&le_q(I0,U)&le_q(J0,V)->a_select3(X,I0,J0)=VAL))&le_q(n0,I)&le_q(I,U)&le_q(n0,J)&le_q(J,V)->a_select3(tptp_update3(X,U,V,VAL),I,J)=VAL).
% 4.05/4.23  all X U VAL (a_select2(tptp_update2(X,U,VAL),U)=VAL).
% 4.05/4.23  all I U X VAL VAL2 (I!=U&a_select2(X,U)=VAL->a_select2(tptp_update2(X,I,VAL2),U)=VAL).
% 4.05/4.23  all I U X VAL ((all I0 (le_q(n0,I0)&le_q(I0,U)->a_select2(X,I0)=VAL))&le_q(n0,I)&le_q(I,U)->a_select2(tptp_update2(X,U,VAL),I)=VAL).
% 4.05/4.23  true.
% 4.05/4.23  def!=use.
% 4.05/4.23  -(s_best7_init=init&s_sworst7_init=init&s_worst7_init=init&le_q(n0,s_best7)&le_q(n0,s_sworst7)&le_q(n0,s_worst7)&le_q(n2,pv1388)&le_q(s_best7,n3)&le_q(s_sworst7,n3)&le_q(s_worst7,n3)&le_q(pv1388,n3)& (all A (le_q(n0,A)&le_q(A,n2)-> (all B (le_q(n0,B)&le_q(B,n3)->a_select3(simplex7_init,B,A)=init))))& (all C (le_q(n0,C)&le_q(C,n3)->a_select2(s_values7_init,C)=init))& (all D (le_q(n0,D)&le_q(D,n2)->a_select2(s_center7_init,D)=init))& (gt(loopcounter,n1)->pvar1400_init=init&pvar1401_init=init&pvar1402_init=init)->init=init&s_best7_init=init&a_select2(s_values7_init,s_best7)=init&a_select2(s_values7_init,pv1388)=init& (-gt(a_select2(s_values7,pv1388),a_select2(s_values7,s_best7))->init=init&s_worst7_init=init&a_select2(s_values7_init,s_worst7)=init&a_select2(s_values7_init,pv1388)=init& (-le_q(a_select2(s_values7,pv1388),a_select2(s_values7,s_worst7))->init=init&s_sworst7_init=init&a_select2(s_values7_init,s_sworst7)=init&a_select2(s_values7_init,pv1388)=init& (-le_q(a_select2(s_values7,pv1388),a_select2(s_values7,s_sworst7))->s_best7_init=init&s_sworst7_init=init&s_worst7_init=init&le_q(n0,s_best7)&le_q(n0,s_sworst7)&le_q(n0,s_worst7)&le_q(s_best7,n3)&le_q(s_sworst7,n3)&le_q(s_worst7,n3)& (all E (le_q(n0,E)&le_q(E,n2)-> (all F (le_q(n0,F)&le_q(F,n3)->a_select3(simplex7_init,F,E)=init))))& (all G (le_q(n0,G)&le_q(G,n3)->a_select2(s_values7_init,G)=init))& (all H (le_q(n0,H)&le_q(H,n2)->a_select2(s_center7_init,H)=init))& (gt(loopcounter,n1)->pvar1400_init=init&pvar1401_init=init&pvar1402_init=init))& (le_q(a_select2(s_values7,pv1388),a_select2(s_values7,s_sworst7))->init=init&s_best7_init=init&s_worst7_init=init&le_q(n0,s_best7)&le_q(n0,s_worst7)&le_q(n0,pv1388)&le_q(s_best7,n3)&le_q(s_worst7,n3)&le_q(pv1388,n3)& (all I (le_q(n0,I)&le_q(I,n2)-> (all J (le_q(n0,J)&le_q(J,n3)->a_select3(simplex7_init,J,I)=init))))& (all K (le_q(n0,K)&le_q(K,n3)->a_select2(s_values7_init,K)=init))& (all L (le_q(n0,L)&le_q(L,n2)->a_select2(s_center7_init,L)=init))& (gt(loopcounter,n1)->pvar1400_init=init&pvar1401_init=init&pvar1402_init=init)))& (le_q(a_select2(s_values7,pv1388),a_select2(s_values7,s_worst7))->init=init&s_best7_init=init&s_worst7_init=init&le_q(n0,s_best7)&le_q(n0,s_worst7)&le_q(n0,pv1388)&le_q(s_best7,n3)&le_q(s_worst7,n3)&le_q(pv1388,n3)& (all M (le_q(n0,M)&le_q(M,n2)-> (all N (le_q(n0,N)&le_q(N,n3)->a_select3(simplex7_init,N,M)=init))))& (all O (le_q(n0,O)&le_q(O,n3)->a_select2(s_values7_init,O)=init))& (all P (le_q(n0,P)&le_q(P,n2)->a_select2(s_center7_init,P)=init))& (gt(loopcounter,n1)->pvar1400_init=init&pvar1401_init=init&pvar1402_init=init)))& (gt(a_select2(s_values7,pv1388),a_select2(s_values7,s_best7))->init=init&s_sworst7_init=init&s_worst7_init=init&le_q(n0,s_sworst7)&le_q(n0,s_worst7)&le_q(n0,pv1388)&le_q(s_sworst7,n3)&le_q(s_worst7,n3)&le_q(pv1388,n3)& (all Q (le_q(n0,Q)&le_q(Q,n2)-> (all R (le_q(n0,R)&le_q(R,n3)->a_select3(simplex7_init,R,Q)=init))))& (all S (le_q(n0,S)&le_q(S,n3)->a_select2(s_values7_init,S)=init))& (all T
% 4.05/4.23  Search stopped in tp_alloc by max_mem option.
% 4.05/4.23   (le_q(n0,T)&le_q(T,n2)->a_select2(s_center7_init,T)=init))& (gt(loopcounter,n1)->pvar1400_init=init&pvar1401_init=init&pvar1402_init=init))).
% 4.05/4.23  gt(n5,n4).
% 4.05/4.23  gt(n4,tptp_minus_1).
% 4.05/4.23  gt(n5,tptp_minus_1).
% 4.05/4.23  gt(n0,tptp_minus_1).
% 4.05/4.23  gt(n1,tptp_minus_1).
% 4.05/4.23  gt(n2,tptp_minus_1).
% 4.05/4.23  gt(n3,tptp_minus_1).
% 4.05/4.23  gt(n4,n0).
% 4.05/4.23  gt(n5,n0).
% 4.05/4.23  gt(n1,n0).
% 4.05/4.23  gt(n2,n0).
% 4.05/4.23  gt(n3,n0).
% 4.05/4.23  gt(n4,n1).
% 4.05/4.23  gt(n5,n1).
% 4.05/4.23  gt(n2,n1).
% 4.05/4.23  gt(n3,n1).
% 4.05/4.23  gt(n4,n2).
% 4.05/4.23  gt(n5,n2).
% 4.05/4.23  gt(n3,n2).
% 4.05/4.23  gt(n4,n3).
% 4.05/4.23  gt(n5,n3).
% 4.05/4.23  all X (le_q(n0,X)&le_q(X,n4)->X=n0|X=n1|X=n2|X=n3|X=n4).
% 4.05/4.23  all X (le_q(n0,X)&le_q(X,n5)->X=n0|X=n1|X=n2|X=n3|X=n4|X=n5).
% 4.05/4.23  all X (le_q(n0,X)&le_q(X,n0)->X=n0).
% 4.05/4.23  all X (le_q(n0,X)&le_q(X,n1)->X=n0|X=n1).
% 4.05/4.23  all X (le_q(n0,X)&le_q(X,n2)->X=n0|X=n1|X=n2).
% 4.05/4.23  all X (le_q(n0,X)&le_q(X,n3)->X=n0|X=n1|X=n2|X=n3).
% 4.05/4.23  succ(succ(succ(succ(n0))))=n4.
% 4.05/4.23  succ(succ(succ(succ(succ(n0)))))=n5.
% 4.05/4.23  succ(n0)=n1.
% 4.05/4.23  succ(succ(n0))=n2.
% 4.05/4.23  succ(succ(succ(n0)))=n3.
% 4.05/4.23  end_of_list.
% 4.05/4.23  
% 4.05/4.23  Search stopped in tp_alloc by max_mem option.
% 4.05/4.23  
% 4.05/4.23  ============ end of search ============
% 4.05/4.23  
% 4.05/4.23  -------------- statistics -------------
% 4.05/4.23  clauses given                  0
% 4.05/4.23  clauses generated              0
% 4.05/4.23  clauses kept                   0
% 4.05/4.23  clauses forward subsumed       0
% 4.05/4.23  clauses back subsumed          0
% 4.05/4.23  Kbytes malloced            11718
% 4.05/4.23  
% 4.05/4.23  ----------- times (seconds) -----------
% 4.05/4.23  user CPU time          1.76          (0 hr, 0 min, 1 sec)
% 4.05/4.23  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 4.05/4.23  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 4.05/4.23  
% 4.05/4.23  Process 30109 finished Wed Jul 27 06:11:40 2022
% 4.05/4.23  Otter interrupted
% 4.05/4.23  PROOF NOT FOUND
%------------------------------------------------------------------------------