TSTP Solution File: ALG441-10 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : ALG441-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n006.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 12:46:40 EDT 2022

% Result   : Unknown 3.27s 3.45s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : ALG441-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n006.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 : Wed Jul 27 03:52:02 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.89/2.10  ----- Otter 3.3f, August 2004 -----
% 1.89/2.10  The process was started by sandbox2 on n006.cluster.edu,
% 1.89/2.10  Wed Jul 27 03:52:02 2022
% 1.89/2.10  The command was "./otter".  The process ID is 18691.
% 1.89/2.10  
% 1.89/2.10  set(prolog_style_variables).
% 1.89/2.10  set(auto).
% 1.89/2.10     dependent: set(auto1).
% 1.89/2.10     dependent: set(process_input).
% 1.89/2.10     dependent: clear(print_kept).
% 1.89/2.10     dependent: clear(print_new_demod).
% 1.89/2.10     dependent: clear(print_back_demod).
% 1.89/2.10     dependent: clear(print_back_sub).
% 1.89/2.10     dependent: set(control_memory).
% 1.89/2.10     dependent: assign(max_mem, 12000).
% 1.89/2.10     dependent: assign(pick_given_ratio, 4).
% 1.89/2.10     dependent: assign(stats_level, 1).
% 1.89/2.10     dependent: assign(max_seconds, 10800).
% 1.89/2.10  clear(print_given).
% 1.89/2.10  
% 1.89/2.10  list(usable).
% 1.89/2.10  0 [] A=A.
% 1.89/2.10  0 [] ife_q(A,A,B,C)=B.
% 1.89/2.10  0 [] m(A,A,B)=B.
% 1.89/2.10  0 [] m(A,B,B)=A.
% 1.89/2.10  0 [] u(A,A)=A.
% 1.89/2.10  0 [] v(A,A,A,A)=A.
% 1.89/2.10  0 [] u(A,B)=u(B,A).
% 1.89/2.10  0 [] v(A,A,A,B)=v(A,A,B,A).
% 1.89/2.10  0 [] v(A,A,B,A)=v(A,B,A,A).
% 1.89/2.10  0 [] v(A,B,A,A)=v(B,A,A,A).
% 1.89/2.10  0 [] u(A,B)=v(A,A,A,B).
% 1.89/2.10  0 [] ife_q(r(X6,X7,X8),true,ife_q(r(X3,X4,X5),true,ife_q(r(X0,X1,X2),true,r(m(X0,X3,X6),m(X1,X4,X7),m(X2,X5,X8)),true),true),true)=true.
% 1.89/2.10  0 [] ife_q(r(X3,X4,X5),true,ife_q(r(X0,X1,X2),true,r(u(X0,X3),u(X1,X4),u(X2,X5)),true),true)=true.
% 1.89/2.10  0 [] ife_q(r(X9,X10,X11),true,ife_q(r(X6,X7,X8),true,ife_q(r(X3,X4,X5),true,ife_q(r(X0,X1,X2),true,r(v(X0,X3,X6,X9),v(X1,X4,X7,X10),v(X2,X5,X8,X11)),true),true),true),true)=true.
% 1.89/2.10  0 [] r(a,a,b)=true.
% 1.89/2.10  0 [] r(a,b,a)=true.
% 1.89/2.10  0 [] r(b,a,a)=true.
% 1.89/2.10  0 [] r(a,a,a)!=true.
% 1.89/2.10  end_of_list.
% 1.89/2.10  
% 1.89/2.10  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.89/2.10  
% 1.89/2.10  All clauses are units, and equality is present; the
% 1.89/2.10  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.89/2.10  
% 1.89/2.10     dependent: set(knuth_bendix).
% 1.89/2.10     dependent: set(anl_eq).
% 1.89/2.10     dependent: set(para_from).
% 1.89/2.10     dependent: set(para_into).
% 1.89/2.10     dependent: clear(para_from_right).
% 1.89/2.10     dependent: clear(para_into_right).
% 1.89/2.10     dependent: set(para_from_vars).
% 1.89/2.10     dependent: set(eq_units_both_ways).
% 1.89/2.10     dependent: set(dynamic_demod_all).
% 1.89/2.10     dependent: set(dynamic_demod).
% 1.89/2.10     dependent: set(order_eq).
% 1.89/2.10     dependent: set(back_demod).
% 1.89/2.10     dependent: set(lrpo).
% 1.89/2.10  
% 1.89/2.10  ------------> process usable:
% 1.89/2.10  ** KEPT (pick-wt=6): 1 [] r(a,a,a)!=true.
% 1.89/2.10  
% 1.89/2.10  ------------> process sos:
% 1.89/2.10  ** KEPT (pick-wt=3): 2 [] A=A.
% 1.89/2.10  ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 1.89/2.10  ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 1.89/2.10  ** KEPT (pick-wt=6): 5 [] m(A,A,B)=B.
% 1.89/2.10  ---> New Demodulator: 6 [new_demod,5] m(A,A,B)=B.
% 1.89/2.10  ** KEPT (pick-wt=6): 7 [] m(A,B,B)=A.
% 1.89/2.10  ---> New Demodulator: 8 [new_demod,7] m(A,B,B)=A.
% 1.89/2.10  ** KEPT (pick-wt=5): 9 [] u(A,A)=A.
% 1.89/2.10  ---> New Demodulator: 10 [new_demod,9] u(A,A)=A.
% 1.89/2.10  ** KEPT (pick-wt=7): 11 [] v(A,A,A,A)=A.
% 1.89/2.10  ---> New Demodulator: 12 [new_demod,11] v(A,A,A,A)=A.
% 1.89/2.10  ** KEPT (pick-wt=7): 13 [] u(A,B)=u(B,A).
% 1.89/2.10  ** KEPT (pick-wt=11): 14 [] v(A,A,A,B)=v(A,A,B,A).
% 1.89/2.10  ** KEPT (pick-wt=11): 15 [] v(A,A,B,A)=v(A,B,A,A).
% 1.89/2.10  ** KEPT (pick-wt=11): 16 [] v(A,B,A,A)=v(B,A,A,A).
% 1.89/2.10  ** KEPT (pick-wt=9): 17 [] u(A,B)=v(A,A,A,B).
% 1.89/2.10  ---> New Demodulator: 18 [new_demod,17] u(A,B)=v(A,A,A,B).
% 1.89/2.10  ** KEPT (pick-wt=36): 19 [] ife_q(r(A,B,C),true,ife_q(r(D,E,F),true,ife_q(r(G,H,I),true,r(m(G,D,A),m(H,E,B),m(I,F,C)),true),true),true)=true.
% 1.89/2.10  ---> New Demodulator: 20 [new_demod,19] ife_q(r(A,B,C),true,ife_q(r(D,E,F),true,ife_q(r(G,H,I),true,r(m(G,D,A),m(H,E,B),m(I,F,C)),true),true),true)=true.
% 1.89/2.10  ** KEPT (pick-wt=32): 22 [copy,21,demod,18,18,18] ife_q(r(A,B,C),true,ife_q(r(D,E,F),true,r(v(D,D,D,A),v(E,E,E,B),v(F,F,F,C)),true),true)=true.
% 1.89/2.10  ---> New Demodulator: 23 [new_demod,22] ife_q(r(A,B,C),true,ife_q(r(D,E,F),true,r(v(D,D,D,A),v(E,E,E,B),v(F,F,F,C)),true),true)=true.
% 1.89/2.10  ** KEPT (pick-wt=46): 24 [] ife_q(r(A,B,C),true,ife_q(r(D,E,F),true,ife_q(r(G,H,I),true,ife_q(r(J,K,L),true,r(v(J,G,D,A),v(K,H,E,B),v(L,I,F,C)),true),true),true),true)=true.
% 1.89/2.10  ---> New Demodulator: 25 [new_demod,24] ife_q(r(A,B,C),true,ife_q(r(D,E,F),true,ife_q(r(G,H,I),true,ife_q(r(J,K,L),true,r(v(J,G,D,A),v(K,H,E,B),v(L,I,F,C)),true),true),true),true)=true.
% 1.89/2.10  ** KEPT (pick-wt=6): 26 [] r(a,a,b)=true.
% 1.89/2.10  ---> New Demodulator: 27 [new_demod,26] r(a,a,b)=true.
% 1.89/2.10  ** KEPT (pick-wt=6): 28 [] r(a,b,a)=true.
% 1.89/2.10  ---> New Demodulator: 29 [new_demod,28] r(a,b,a)=true.
% 1.89/2.10  ** KEPT (pick-wt=6): 30 [] r(b,a,a)=true.
% 1.89/2.10  ---> New Demodulator: 31 [new_demod,30] r(b,a,a)=true.
% 3.27/3.45    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 3.27/3.45  >>>> Starting back demodulation with 4.
% 3.27/3.45  >>>> Starting back demodulation with 6.
% 3.27/3.45  >>>> Starting back demodulation with 8.
% 3.27/3.45  >>>> Starting back demodulation with 10.
% 3.27/3.45  >>>> Starting back demodulation with 12.
% 3.27/3.45  ** KEPT (pick-wt=11): 32 [copy,13,flip.1,demod,18,18] v(A,A,A,B)=v(B,B,B,A).
% 3.27/3.45  ** KEPT (pick-wt=11): 33 [copy,14,flip.1] v(A,A,B,A)=v(A,A,A,B).
% 3.27/3.45  ** KEPT (pick-wt=11): 34 [copy,15,flip.1] v(A,B,A,A)=v(A,A,B,A).
% 3.27/3.45  ** KEPT (pick-wt=11): 35 [copy,16,flip.1] v(A,B,B,B)=v(B,A,B,B).
% 3.27/3.45  >>>> Starting back demodulation with 18.
% 3.27/3.45      >> back demodulating 13 with 18.
% 3.27/3.45      >> back demodulating 9 with 18.
% 3.27/3.45  >>>> Starting back demodulation with 20.
% 3.27/3.45  >>>> Starting back demodulation with 23.
% 3.27/3.45  >>>> Starting back demodulation with 25.
% 3.27/3.45  >>>> Starting back demodulation with 27.
% 3.27/3.45  >>>> Starting back demodulation with 29.
% 3.27/3.45  >>>> Starting back demodulation with 31.
% 3.27/3.45    Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] v(A,A,A,B)=v(B,B,B,A).
% 3.27/3.45    Following clause subsumed by 14 during input processing: 0 [copy,33,flip.1] v(A,A,A,B)=v(A,A,B,A).
% 3.27/3.45    Following clause subsumed by 15 during input processing: 0 [copy,34,flip.1] v(A,A,B,A)=v(A,B,A,A).
% 3.27/3.45    Following clause subsumed by 16 during input processing: 0 [copy,35,flip.1] v(A,B,A,A)=v(B,A,A,A).
% 3.27/3.45  
% 3.27/3.45  ======= end of input processing =======
% 3.27/3.45  
% 3.27/3.45  =========== start of search ===========
% 3.27/3.45  
% 3.27/3.45  
% 3.27/3.45  Resetting weight limit to 22.
% 3.27/3.45  
% 3.27/3.45  
% 3.27/3.45  Resetting weight limit to 22.
% 3.27/3.45  
% 3.27/3.45  sos_size=279
% 3.27/3.45  
% 3.27/3.45  
% 3.27/3.45  Resetting weight limit to 18.
% 3.27/3.45  
% 3.27/3.45  
% 3.27/3.45  Resetting weight limit to 18.
% 3.27/3.45  
% 3.27/3.45  sos_size=324
% 3.27/3.45  
% 3.27/3.45  
% 3.27/3.45  Resetting weight limit to 14.
% 3.27/3.45  
% 3.27/3.45  
% 3.27/3.45  Resetting weight limit to 14.
% 3.27/3.45  
% 3.27/3.45  sos_size=390
% 3.27/3.45  
% 3.27/3.45  Search stopped because sos empty.
% 3.27/3.45  
% 3.27/3.45  
% 3.27/3.45  Search stopped because sos empty.
% 3.27/3.45  
% 3.27/3.45  ============ end of search ============
% 3.27/3.45  
% 3.27/3.45  -------------- statistics -------------
% 3.27/3.45  clauses given                650
% 3.27/3.45  clauses generated         228881
% 3.27/3.45  clauses kept                 653
% 3.27/3.45  clauses forward subsumed   25108
% 3.27/3.45  clauses back subsumed          0
% 3.27/3.45  Kbytes malloced             7812
% 3.27/3.45  
% 3.27/3.45  ----------- times (seconds) -----------
% 3.27/3.45  user CPU time          1.34          (0 hr, 0 min, 1 sec)
% 3.27/3.45  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 3.27/3.45  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 3.27/3.45  
% 3.27/3.45  Process 18691 finished Wed Jul 27 03:52:05 2022
% 3.27/3.45  Otter interrupted
% 3.27/3.45  PROOF NOT FOUND
%------------------------------------------------------------------------------