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

View Problem - Process Solution

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

% Computer : n004.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:06:19 EDT 2022

% Result   : Unknown 1.91s 2.17s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : MSC013-10 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n004.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Wed Jul 27 08:55:21 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.75/1.97  ----- Otter 3.3f, August 2004 -----
% 1.75/1.97  The process was started by sandbox on n004.cluster.edu,
% 1.75/1.97  Wed Jul 27 08:55:21 2022
% 1.75/1.97  The command was "./otter".  The process ID is 4472.
% 1.75/1.97  
% 1.75/1.97  set(prolog_style_variables).
% 1.75/1.97  set(auto).
% 1.75/1.97     dependent: set(auto1).
% 1.75/1.97     dependent: set(process_input).
% 1.75/1.97     dependent: clear(print_kept).
% 1.75/1.97     dependent: clear(print_new_demod).
% 1.75/1.97     dependent: clear(print_back_demod).
% 1.75/1.97     dependent: clear(print_back_sub).
% 1.75/1.97     dependent: set(control_memory).
% 1.75/1.97     dependent: assign(max_mem, 12000).
% 1.75/1.97     dependent: assign(pick_given_ratio, 4).
% 1.75/1.97     dependent: assign(stats_level, 1).
% 1.75/1.97     dependent: assign(max_seconds, 10800).
% 1.75/1.97  clear(print_given).
% 1.75/1.97  
% 1.75/1.97  list(usable).
% 1.75/1.97  0 [] A=A.
% 1.75/1.97  0 [] ife_q(A,A,B,C)=B.
% 1.75/1.97  0 [] e_qualish(n0,n0)=true.
% 1.75/1.97  0 [] e_qualish(n1,n1)=true.
% 1.75/1.97  0 [] ife_q(e_qualish(n0,n1),true,goal,true)=true.
% 1.75/1.97  0 [] ife_q(e_qualish(n1,n0),true,goal,true)=true.
% 1.75/1.97  0 [] ife_q(e_qualish(E,E),true,ife_q(e_qualish(D,D),true,ife_q(e_qualish(C,C),true,ife_q(e_qualish(B,B),true,ife_q(e_qualish(A,A),true,f(A,B,C,D,E,sK1_relation_exists_F(A,B,C,D,E)),true),true),true),true),true)=true.
% 1.75/1.97  0 [] ife_q(f(F,G,H,I,J,K),true,ife_q(f(A,B,C,D,E,K),true,e_qualish(E,J),true),true)=true.
% 1.75/1.97  0 [] ife_q(f(F,G,H,I,J,K),true,ife_q(f(A,B,C,D,E,K),true,e_qualish(D,I),true),true)=true.
% 1.75/1.97  0 [] ife_q(f(F,G,H,I,J,K),true,ife_q(f(A,B,C,D,E,K),true,e_qualish(C,H),true),true)=true.
% 1.75/1.97  0 [] ife_q(f(F,G,H,I,J,K),true,ife_q(f(A,B,C,D,E,K),true,e_qualish(B,G),true),true)=true.
% 1.75/1.97  0 [] ife_q(f(F,G,H,I,J,K),true,ife_q(f(A,B,C,D,E,K),true,e_qualish(A,F),true),true)=true.
% 1.75/1.97  0 [] goal!=true.
% 1.75/1.97  end_of_list.
% 1.75/1.97  
% 1.75/1.97  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.75/1.97  
% 1.75/1.97  All clauses are units, and equality is present; the
% 1.75/1.97  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.75/1.97  
% 1.75/1.97     dependent: set(knuth_bendix).
% 1.75/1.97     dependent: set(anl_eq).
% 1.75/1.97     dependent: set(para_from).
% 1.75/1.97     dependent: set(para_into).
% 1.75/1.97     dependent: clear(para_from_right).
% 1.75/1.97     dependent: clear(para_into_right).
% 1.75/1.97     dependent: set(para_from_vars).
% 1.75/1.97     dependent: set(eq_units_both_ways).
% 1.75/1.97     dependent: set(dynamic_demod_all).
% 1.75/1.97     dependent: set(dynamic_demod).
% 1.75/1.97     dependent: set(order_eq).
% 1.75/1.97     dependent: set(back_demod).
% 1.75/1.97     dependent: set(lrpo).
% 1.75/1.97  
% 1.75/1.97  ------------> process usable:
% 1.75/1.97  ** KEPT (pick-wt=3): 2 [copy,1,flip.1] true!=goal.
% 1.75/1.97  
% 1.75/1.97  ------------> process sos:
% 1.75/1.97  ** KEPT (pick-wt=3): 3 [] A=A.
% 1.75/1.97  ** KEPT (pick-wt=7): 4 [] ife_q(A,A,B,C)=B.
% 1.75/1.97  ---> New Demodulator: 5 [new_demod,4] ife_q(A,A,B,C)=B.
% 1.75/1.97  ** KEPT (pick-wt=5): 6 [] e_qualish(n0,n0)=true.
% 1.75/1.97  ---> New Demodulator: 7 [new_demod,6] e_qualish(n0,n0)=true.
% 1.75/1.97  ** KEPT (pick-wt=5): 8 [] e_qualish(n1,n1)=true.
% 1.75/1.97  ---> New Demodulator: 9 [new_demod,8] e_qualish(n1,n1)=true.
% 1.75/1.97  ** KEPT (pick-wt=9): 10 [] ife_q(e_qualish(n0,n1),true,goal,true)=true.
% 1.75/1.97  ---> New Demodulator: 11 [new_demod,10] ife_q(e_qualish(n0,n1),true,goal,true)=true.
% 1.75/1.97  ** KEPT (pick-wt=9): 12 [] ife_q(e_qualish(n1,n0),true,goal,true)=true.
% 1.75/1.97  ---> New Demodulator: 13 [new_demod,12] ife_q(e_qualish(n1,n0),true,goal,true)=true.
% 1.75/1.97  ** KEPT (pick-wt=44): 14 [] ife_q(e_qualish(A,A),true,ife_q(e_qualish(B,B),true,ife_q(e_qualish(C,C),true,ife_q(e_qualish(D,D),true,ife_q(e_qualish(E,E),true,f(E,D,C,B,A,sK1_relation_exists_F(E,D,C,B,A)),true),true),true),true),true)=true.
% 1.75/1.97  ---> New Demodulator: 15 [new_demod,14] ife_q(e_qualish(A,A),true,ife_q(e_qualish(B,B),true,ife_q(e_qualish(C,C),true,ife_q(e_qualish(D,D),true,ife_q(e_qualish(E,E),true,f(E,D,C,B,A,sK1_relation_exists_F(E,D,C,B,A)),true),true),true),true),true)=true.
% 1.75/1.97  ** KEPT (pick-wt=25): 16 [] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(K,E),true),true)=true.
% 1.75/1.97  ---> New Demodulator: 17 [new_demod,16] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(K,E),true),true)=true.
% 1.75/1.97  ** KEPT (pick-wt=25): 18 [] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(J,D),true),true)=true.
% 1.75/1.97  ---> New Demodulator: 19 [new_demod,18] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(J,D),true),true)=true.
% 1.75/1.97  ** KEPT (pick-wt=25): 20 [] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(I,C),true),true)=true.
% 1.75/1.97  ---> New Demodulator: 21 [new_demod,20] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(I,C),true),true)=true.
% 1.91/2.17  ** KEPT (pick-wt=25): 22 [] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(H,B),true),true)=true.
% 1.91/2.17  ---> New Demodulator: 23 [new_demod,22] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(H,B),true),true)=true.
% 1.91/2.17  ** KEPT (pick-wt=25): 24 [] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(G,A),true),true)=true.
% 1.91/2.17  ---> New Demodulator: 25 [new_demod,24] ife_q(f(A,B,C,D,E,F),true,ife_q(f(G,H,I,J,K,F),true,e_qualish(G,A),true),true)=true.
% 1.91/2.17    Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.91/2.17  >>>> Starting back demodulation with 5.
% 1.91/2.17  >>>> Starting back demodulation with 7.
% 1.91/2.17  >>>> Starting back demodulation with 9.
% 1.91/2.17  >>>> Starting back demodulation with 11.
% 1.91/2.17  >>>> Starting back demodulation with 13.
% 1.91/2.17  >>>> Starting back demodulation with 15.
% 1.91/2.17  >>>> Starting back demodulation with 17.
% 1.91/2.17  >>>> Starting back demodulation with 19.
% 1.91/2.17  >>>> Starting back demodulation with 21.
% 1.91/2.17  >>>> Starting back demodulation with 23.
% 1.91/2.17  >>>> Starting back demodulation with 25.
% 1.91/2.17  
% 1.91/2.17  ======= end of input processing =======
% 1.91/2.17  
% 1.91/2.17  =========== start of search ===========
% 1.91/2.17  
% 1.91/2.17  Search stopped because sos empty.
% 1.91/2.17  
% 1.91/2.17  
% 1.91/2.17  Search stopped because sos empty.
% 1.91/2.17  
% 1.91/2.17  ============ end of search ============
% 1.91/2.17  
% 1.91/2.17  -------------- statistics -------------
% 1.91/2.17  clauses given                936
% 1.91/2.17  clauses generated          19904
% 1.91/2.17  clauses kept                 937
% 1.91/2.17  clauses forward subsumed   19301
% 1.91/2.17  clauses back subsumed          0
% 1.91/2.17  Kbytes malloced             3906
% 1.91/2.17  
% 1.91/2.17  ----------- times (seconds) -----------
% 1.91/2.17  user CPU time          0.20          (0 hr, 0 min, 0 sec)
% 1.91/2.17  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 1.91/2.17  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.91/2.17  
% 1.91/2.17  Process 4472 finished Wed Jul 27 08:55:23 2022
% 1.91/2.17  Otter interrupted
% 1.91/2.17  PROOF NOT FOUND
%------------------------------------------------------------------------------