TSTP Solution File: HWC003-2 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : HWC003-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n017.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:58:02 EDT 2022

% Result   : Unknown 13.67s 13.87s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : HWC003-2 : TPTP v8.1.0. Released v1.1.0.
% 0.00/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n017.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:27:18 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.72/1.94  
% 1.72/1.94  
% 1.72/1.94  WARNING, multiple arity: list/1, list/2.
% 1.72/1.94  
% 1.72/1.94  ----- Otter 3.3f, August 2004 -----
% 1.72/1.94  The process was started by sandbox on n017.cluster.edu,
% 1.72/1.94  Wed Jul 27 03:27:18 2022
% 1.72/1.94  The command was "./otter".  The process ID is 28691.
% 1.72/1.94  
% 1.72/1.94  set(prolog_style_variables).
% 1.72/1.94  set(auto).
% 1.72/1.94     dependent: set(auto1).
% 1.72/1.94     dependent: set(process_input).
% 1.72/1.94     dependent: clear(print_kept).
% 1.72/1.94     dependent: clear(print_new_demod).
% 1.72/1.94     dependent: clear(print_back_demod).
% 1.72/1.94     dependent: clear(print_back_sub).
% 1.72/1.94     dependent: set(control_memory).
% 1.72/1.94     dependent: assign(max_mem, 12000).
% 1.72/1.94     dependent: assign(pick_given_ratio, 4).
% 1.72/1.94     dependent: assign(stats_level, 1).
% 1.72/1.94     dependent: assign(max_seconds, 10800).
% 1.72/1.94  clear(print_given).
% 1.72/1.94  
% 1.72/1.94  list(usable).
% 1.72/1.94  0 [] A=A.
% 1.72/1.94  0 [] and(X,n0)=n0.
% 1.72/1.94  0 [] and(X,n1)=X.
% 1.72/1.94  0 [] or(X,n0)=X.
% 1.72/1.94  0 [] or(X,n1)=n1.
% 1.72/1.94  0 [] not(n0)=n1.
% 1.72/1.94  0 [] not(n1)=n0.
% 1.72/1.94  0 [] add_inverter(list(X,Y),Z)=list(X,add_inverter(Y,Z)).
% 1.72/1.94  0 [] add_inverter(X,Y)=list(Y,X).
% 1.72/1.94  0 [] make_reverse_list(list(inverter_table(X000,X001,X010,X011,X100,X101,X110,X111),V))=list_reversion(possible_reversion(r00m,X000,X001),list_reversion(possible_reversion(r01m,X010,X011),list_reversion(possible_reversion(r10m,X100,X101),list_reversion(possible_reversion(r11m,X110,X111),list_reversion(possible_reversion(r0m0,X000,X010),list_reversion(possible_reversion(r0m1,X001,X011),list_reversion(possible_reversion(r1m0,X100,X110),list_reversion(possible_reversion(r1m1,X101,X111),list_reversion(possible_reversion(rm00,X000,X100),list_reversion(possible_reversion(rm01,X001,X101),list_reversion(possible_reversion(rm10,X010,X110),list_reversion(possible_reversion(rm11,X011,X111),make_reverse_list(V))))))))))))).
% 1.72/1.94  0 [] make_reverse_list(V)=end.
% 1.72/1.94  0 [] possible_reversion(Xname,n1,n0)=Xname.
% 1.72/1.94  0 [] possible_reversion(Xname,n0,n1)=not_reversion.
% 1.72/1.94  0 [] possible_reversion(Xname,X,X)=not_reversion.
% 1.72/1.94  0 [] list_reversion(not_reversion,X)=X.
% 1.72/1.94  0 [] list_reversion(X,list_reversion(Y,Z))=list_reversion(Y,list_reversion(X,Z)).
% 1.72/1.94  0 [] list_reversion(X,list_reversion(X,Y))=list_reversion(X,Y).
% 1.72/1.94  0 [] -basic_output(X1,X2,X3,X4,X5,X6,X7,X8,V)| -basic_output(Y1,Y2,Y3,Y4,Y5,Y6,Y7,Y8,V)|basic_output(and(X1,Y1),and(X2,Y2),and(X3,Y3),and(X4,Y4),and(X5,Y5),and(X6,Y6),and(X7,Y7),and(X8,Y8),V).
% 1.72/1.94  0 [] -basic_output(X1,X2,X3,X4,X5,X6,X7,X8,V)| -output(Y1,Y2,Y3,Y4,Y5,Y6,Y7,Y8,V)|output(or(X1,Y1),or(X2,Y2),or(X3,Y3),or(X4,Y4),or(X5,Y5),or(X6,Y6),or(X7,Y7),or(X8,Y8),V).
% 1.72/1.94  0 [] -output(X1,X2,X3,X4,X5,X6,X7,X8,V)|test(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8),add_inverter(V,inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8))),make_reverse_list(list(inverter_table(not(X1),not(X2),not(X3),not(X4),not(X5),not(X6),not(X7),not(X8)),V))).
% 1.72/1.94  0 [] -basic_output(X1,X2,X3,X4,X5,X6,X7,X8,V)|output(X1,X2,X3,X4,X5,X6,X7,X8,V).
% 1.72/1.94  0 [] -test(X1,X2,X3,X4,X5,X6,X7,X8,V,Xrevlist)|basic_output(X1,X2,X3,X4,X5,X6,X7,X8,V).
% 1.72/1.94  0 [] output(n0,n0,n0,n0,n1,n1,n1,n1,X).
% 1.72/1.94  0 [] output(n0,n0,n1,n1,n0,n0,n1,n1,X).
% 1.72/1.94  0 [] output(n0,n1,n0,n1,n0,n1,n0,n1,X).
% 1.72/1.94  0 [] -output(n1,n1,n1,n1,n0,n0,n0,n0,V)| -output(n1,n1,n0,n0,n1,n1,n0,n0,V)| -output(n1,n0,n1,n0,n1,n0,n1,n0,V).
% 1.72/1.94  end_of_list.
% 1.72/1.94  
% 1.72/1.94  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.72/1.94  
% 1.72/1.94  This is a Horn set with equality.  The strategy will be
% 1.72/1.94  Knuth-Bendix and hyper_res, with positive clauses in
% 1.72/1.94  sos and nonpositive clauses in usable.
% 1.72/1.94  
% 1.72/1.94     dependent: set(knuth_bendix).
% 1.72/1.94     dependent: set(anl_eq).
% 1.72/1.94     dependent: set(para_from).
% 1.72/1.94     dependent: set(para_into).
% 1.72/1.94     dependent: clear(para_from_right).
% 1.72/1.94     dependent: clear(para_into_right).
% 1.72/1.94     dependent: set(para_from_vars).
% 1.72/1.94     dependent: set(eq_units_both_ways).
% 1.72/1.94     dependent: set(dynamic_demod_all).
% 1.72/1.94     dependent: set(dynamic_demod).
% 1.72/1.94     dependent: set(order_eq).
% 1.72/1.94     dependent: set(back_demod).
% 1.72/1.94     dependent: set(lrpo).
% 1.72/1.94     dependent: set(hyper_res).
% 1.72/1.94     dependent: clear(order_hyper).
% 1.72/1.94  
% 1.72/1.94  ------------> process usable:
% 1.72/1.94  ** KEPT (pick-wt=46): 1 [] -basic_output(A,B,C,D,E,F,G,H,I)| -basic_output(J,K,L,M,N,O,P,Q,I)|basic_output(and(A,J),and(B,K),and(C,L),and(D,M),and(E,N),and(F,O),and(G,P),and(H,Q),I).
% 1.72/1.94  ** KEPT (pick-wt=46): 2 [] -basic_output(A,B,C,D,E,F,G,H,I)| -output(J,K,L,M,N,O,P,Q,I)|output(or(A,J),or(B,K),or(C,L),or(D,M),or(E,N),or(F,O),or(G,P),or(H,Q),I).
% 1.72/1.94  ** KEPT (pick-wt=66): 3 [] -output(A,B,C,D,E,F,G,H,I)|test(not(A),not(B),not(C),not(D),not(E),not(F),not(G),not(H),add_inverter(I,inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(G),not(H))),make_reverse_list(list(inverter_table(not(A),not(B),not(C),not(D),not(E),not(F),not(G),not(H)),I))).
% 1.72/1.94  ** KEPT (pick-wt=20): 4 [] -basic_output(A,B,C,D,E,F,G,H,I)|output(A,B,C,D,E,F,G,H,I).
% 1.72/1.94  ** KEPT (pick-wt=21): 5 [] -test(A,B,C,D,E,F,G,H,I,J)|basic_output(A,B,C,D,E,F,G,H,I).
% 1.72/1.94  ** KEPT (pick-wt=30): 6 [] -output(n1,n1,n1,n1,n0,n0,n0,n0,A)| -output(n1,n1,n0,n0,n1,n1,n0,n0,A)| -output(n1,n0,n1,n0,n1,n0,n1,n0,A).
% 1.72/1.94  
% 1.72/1.94  ------------> process sos:
% 1.72/1.94  ** KEPT (pick-wt=3): 7 [] A=A.
% 1.72/1.94  ** KEPT (pick-wt=5): 8 [] and(A,n0)=n0.
% 1.72/1.94  ---> New Demodulator: 9 [new_demod,8] and(A,n0)=n0.
% 1.72/1.94  ** KEPT (pick-wt=5): 10 [] and(A,n1)=A.
% 1.72/1.94  ---> New Demodulator: 11 [new_demod,10] and(A,n1)=A.
% 1.72/1.94  ** KEPT (pick-wt=5): 12 [] or(A,n0)=A.
% 1.72/1.94  ---> New Demodulator: 13 [new_demod,12] or(A,n0)=A.
% 1.72/1.94  ** KEPT (pick-wt=5): 14 [] or(A,n1)=n1.
% 1.72/1.94  ---> New Demodulator: 15 [new_demod,14] or(A,n1)=n1.
% 1.72/1.94  ** KEPT (pick-wt=4): 16 [] not(n0)=n1.
% 1.72/1.94  ---> New Demodulator: 17 [new_demod,16] not(n0)=n1.
% 1.72/1.94  ** KEPT (pick-wt=4): 18 [] not(n1)=n0.
% 1.72/1.94  ---> New Demodulator: 19 [new_demod,18] not(n1)=n0.
% 1.72/1.94  ** KEPT (pick-wt=11): 21 [copy,20,flip.1] list(A,add_inverter(B,C))=add_inverter(list(A,B),C).
% 1.72/1.94  ---> New Demodulator: 22 [new_demod,21] list(A,add_inverter(B,C))=add_inverter(list(A,B),C).
% 1.72/1.94  ** KEPT (pick-wt=7): 24 [copy,23,flip.1] list(A,B)=add_inverter(B,A).
% 1.72/1.94  ---> New Demodulator: 25 [new_demod,24] list(A,B)=add_inverter(B,A).
% 1.72/1.94  ** KEPT (pick-wt=75): 27 [copy,26,demod,25] make_reverse_list(add_inverter(A,inverter_table(B,C,D,E,F,G,H,I)))=list_reversion(possible_reversion(r00m,B,C),list_reversion(possible_reversion(r01m,D,E),list_reversion(possible_reversion(r10m,F,G),list_reversion(possible_reversion(r11m,H,I),list_reversion(possible_reversion(r0m0,B,D),list_reversion(possible_reversion(r0m1,C,E),list_reversion(possible_reversion(r1m0,F,H),list_reversion(possible_reversion(r1m1,G,I),list_reversion(possible_reversion(rm00,B,F),list_reversion(possible_reversion(rm01,C,G),list_reversion(possible_reversion(rm10,D,H),list_reversion(possible_reversion(rm11,E,I),make_reverse_list(A))))))))))))).
% 1.72/1.94  ---> New Demodulator: 28 [new_demod,27] make_reverse_list(add_inverter(A,inverter_table(B,C,D,E,F,G,H,I)))=list_reversion(possible_reversion(r00m,B,C),list_reversion(possible_reversion(r01m,D,E),list_reversion(possible_reversion(r10m,F,G),list_reversion(possible_reversion(r11m,H,I),list_reversion(possible_reversion(r0m0,B,D),list_reversion(possible_reversion(r0m1,C,E),list_reversion(possible_reversion(r1m0,F,H),list_reversion(possible_reversion(r1m1,G,I),list_reversion(possible_reversion(rm00,B,F),list_reversion(possible_reversion(rm01,C,G),list_reversion(possible_reversion(rm10,D,H),list_reversion(possible_reversion(rm11,E,I),make_reverse_list(A))))))))))))).
% 1.72/1.94  ** KEPT (pick-wt=4): 29 [] make_reverse_list(A)=end.
% 1.72/1.94  ---> New Demodulator: 30 [new_demod,29] make_reverse_list(A)=end.
% 1.72/1.94  ** KEPT (pick-wt=6): 31 [] possible_reversion(A,n1,n0)=A.
% 1.72/1.94  ---> New Demodulator: 32 [new_demod,31] possible_reversion(A,n1,n0)=A.
% 1.72/1.94  ** KEPT (pick-wt=6): 33 [] possible_reversion(A,n0,n1)=not_reversion.
% 1.72/1.94  ---> New Demodulator: 34 [new_demod,33] possible_reversion(A,n0,n1)=not_reversion.
% 1.72/1.94  ** KEPT (pick-wt=6): 35 [] possible_reversion(A,B,B)=not_reversion.
% 1.72/1.94  ---> New Demodulator: 36 [new_demod,35] possible_reversion(A,B,B)=not_reversion.
% 1.72/1.94  ** KEPT (pick-wt=5): 37 [] list_reversion(not_reversion,A)=A.
% 1.72/1.94  ---> New Demodulator: 38 [new_demod,37] list_reversion(not_reversion,A)=A.
% 1.72/1.94  ** KEPT (pick-wt=11): 39 [] list_reversion(A,list_reversion(B,C))=list_reversion(B,list_reversion(A,C)).
% 1.72/1.94  ** KEPT (pick-wt=9): 40 [] list_reversion(A,list_reversion(A,B))=list_reversion(A,B).
% 1.72/1.94  ---> New Demodulator: 41 [new_demod,40] list_reversion(A,list_reversion(A,B))=list_reversion(A,B).
% 1.72/1.94  ** KEPT (pick-wt=10): 42 [] output(n0,n0,n0,n0,n1,n1,n1,n1,A).
% 1.72/1.94  ** KEPT (pick-wt=10): 43 [] output(n0,n0,n1,n1,n0,n0,n1,n1,A).
% 1.72/1.94  ** KEPT (pick-wt=10): 44 [] output(n0,n1,n0,n1,n0,n1,n0,n1,A).
% 13.67/13.87    Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 13.67/13.87  >>>> Starting back demodulation with 9.
% 13.67/13.87  >>>> Starting back demodulation with 11.
% 13.67/13.87  >>>> Starting back demodulation with 13.
% 13.67/13.87  >>>> Starting back demodulation with 15.
% 13.67/13.87  >>>> Starting back demodulation with 17.
% 13.67/13.87  >>>> Starting back demodulation with 19.
% 13.67/13.87  >>>> Starting back demodulation with 22.
% 13.67/13.87  >>>> Starting back demodulation with 25.
% 13.67/13.87      >> back demodulating 21 with 25.
% 13.67/13.87      >> back demodulating 3 with 25.
% 13.67/13.87  >>>> Starting back demodulation with 28.
% 13.67/13.87  >>>> Starting back demodulation with 30.
% 13.67/13.87      >> back demodulating 27 with 30.
% 13.67/13.87  >>>> Starting back demodulation with 32.
% 13.67/13.87  >>>> Starting back demodulation with 34.
% 13.67/13.87  >>>> Starting back demodulation with 36.
% 13.67/13.87  >>>> Starting back demodulation with 38.
% 13.67/13.87    Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] list_reversion(A,list_reversion(B,C))=list_reversion(B,list_reversion(A,C)).
% 13.67/13.87  >>>> Starting back demodulation with 41.
% 13.67/13.87    Following clause subsumed by 45 during input processing: 0 [copy,45,flip.1] add_inverter(add_inverter(A,B),C)=add_inverter(add_inverter(A,C),B).
% 13.67/13.87  >>>> Starting back demodulation with 48.
% 13.67/13.87  
% 13.67/13.87  ======= end of input processing =======
% 13.67/13.87  
% 13.67/13.87  =========== start of search ===========
% 13.67/13.87  
% 13.67/13.87  
% 13.67/13.87  Resetting weight limit to 23.
% 13.67/13.87  
% 13.67/13.87  
% 13.67/13.87  Resetting weight limit to 23.
% 13.67/13.87  
% 13.67/13.87  sos_size=834
% 13.67/13.87  
% 13.67/13.87  Search stopped because sos empty.
% 13.67/13.87  
% 13.67/13.87  
% 13.67/13.87  Search stopped because sos empty.
% 13.67/13.87  
% 13.67/13.87  ============ end of search ============
% 13.67/13.87  
% 13.67/13.87  -------------- statistics -------------
% 13.67/13.87  clauses given                915
% 13.67/13.87  clauses generated        1786708
% 13.67/13.87  clauses kept                1280
% 13.67/13.87  clauses forward subsumed   85839
% 13.67/13.87  clauses back subsumed          0
% 13.67/13.87  Kbytes malloced             5859
% 13.67/13.87  
% 13.67/13.87  ----------- times (seconds) -----------
% 13.67/13.87  user CPU time         11.92          (0 hr, 0 min, 11 sec)
% 13.67/13.87  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 13.67/13.87  wall-clock time       13             (0 hr, 0 min, 13 sec)
% 13.67/13.87  
% 13.67/13.87  Process 28691 finished Wed Jul 27 03:27:31 2022
% 13.67/13.87  Otter interrupted
% 13.67/13.87  PROOF NOT FOUND
%------------------------------------------------------------------------------