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

View Problem - Process Solution

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

% Computer : n014.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:01 EDT 2022

% Result   : Unknown 44.98s 45.21s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : HWC003-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 04:04:54 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.67/1.84  
% 1.67/1.84  
% 1.67/1.84  WARNING, multiple arity: list/1, list/2.
% 1.67/1.84  
% 1.67/1.84  ----- Otter 3.3f, August 2004 -----
% 1.67/1.84  The process was started by sandbox2 on n014.cluster.edu,
% 1.67/1.84  Wed Jul 27 04:04:54 2022
% 1.67/1.84  The command was "./otter".  The process ID is 24430.
% 1.67/1.84  
% 1.67/1.84  set(prolog_style_variables).
% 1.67/1.84  set(auto).
% 1.67/1.84     dependent: set(auto1).
% 1.67/1.84     dependent: set(process_input).
% 1.67/1.84     dependent: clear(print_kept).
% 1.67/1.84     dependent: clear(print_new_demod).
% 1.67/1.84     dependent: clear(print_back_demod).
% 1.67/1.84     dependent: clear(print_back_sub).
% 1.67/1.84     dependent: set(control_memory).
% 1.67/1.84     dependent: assign(max_mem, 12000).
% 1.67/1.84     dependent: assign(pick_given_ratio, 4).
% 1.67/1.84     dependent: assign(stats_level, 1).
% 1.67/1.84     dependent: assign(max_seconds, 10800).
% 1.67/1.84  clear(print_given).
% 1.67/1.84  
% 1.67/1.84  list(usable).
% 1.67/1.84  0 [] A=A.
% 1.67/1.84  0 [] and(X,n0)=n0.
% 1.67/1.84  0 [] and(X,n1)=X.
% 1.67/1.84  0 [] or(X,n0)=X.
% 1.67/1.84  0 [] or(X,n1)=n1.
% 1.67/1.84  0 [] not(n0)=n1.
% 1.67/1.84  0 [] not(n1)=n0.
% 1.67/1.84  0 [] add_inverter(list(X,Y),Z)=list(X,add_inverter(Y,Z)).
% 1.67/1.84  0 [] add_inverter(X,Y)=list(Y,X).
% 1.67/1.84  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.67/1.84  0 [] make_reverse_list(V)=end.
% 1.67/1.84  0 [] possible_reversion(Xname,n1,n0)=Xname.
% 1.67/1.84  0 [] possible_reversion(Xname,n0,n1)=not_reversion.
% 1.67/1.84  0 [] possible_reversion(Xname,X,X)=not_reversion.
% 1.67/1.84  0 [] list_reversion(not_reversion,X)=X.
% 1.67/1.84  0 [] list_reversion(X,list_reversion(Y,Z))=list_reversion(Y,list_reversion(X,Z)).
% 1.67/1.84  0 [] list_reversion(X,list_reversion(X,Y))=list_reversion(X,Y).
% 1.67/1.84  0 [] -output(X1,X2,X3,X4,X5,X6,X7,X8,V)| -output(Y1,Y2,Y3,Y4,Y5,Y6,Y7,Y8,V)|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.67/1.84  0 [] -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.67/1.84  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.67/1.84  0 [] -test(X1,X2,X3,X4,X5,X6,X7,X8,V,Xrevlist)|output(X1,X2,X3,X4,X5,X6,X7,X8,V).
% 1.67/1.84  0 [] output(n0,n0,n0,n0,n1,n1,n1,n1,X).
% 1.67/1.84  0 [] output(n0,n0,n1,n1,n0,n0,n1,n1,X).
% 1.67/1.84  0 [] output(n0,n1,n0,n1,n0,n1,n0,n1,X).
% 1.67/1.84  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.67/1.84  end_of_list.
% 1.67/1.84  
% 1.67/1.84  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.67/1.84  
% 1.67/1.84  This is a Horn set with equality.  The strategy will be
% 1.67/1.84  Knuth-Bendix and hyper_res, with positive clauses in
% 1.67/1.84  sos and nonpositive clauses in usable.
% 1.67/1.84  
% 1.67/1.84     dependent: set(knuth_bendix).
% 1.67/1.84     dependent: set(anl_eq).
% 1.67/1.84     dependent: set(para_from).
% 1.67/1.84     dependent: set(para_into).
% 1.67/1.84     dependent: clear(para_from_right).
% 1.67/1.84     dependent: clear(para_into_right).
% 1.67/1.84     dependent: set(para_from_vars).
% 1.67/1.84     dependent: set(eq_units_both_ways).
% 1.67/1.84     dependent: set(dynamic_demod_all).
% 1.67/1.84     dependent: set(dynamic_demod).
% 1.67/1.84     dependent: set(order_eq).
% 1.67/1.84     dependent: set(back_demod).
% 1.67/1.84     dependent: set(lrpo).
% 1.67/1.84     dependent: set(hyper_res).
% 1.67/1.84     dependent: clear(order_hyper).
% 1.67/1.84  
% 1.67/1.84  ------------> process usable:
% 1.67/1.84  ** KEPT (pick-wt=46): 1 [] -output(A,B,C,D,E,F,G,H,I)| -output(J,K,L,M,N,O,P,Q,I)|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.67/1.84  ** KEPT (pick-wt=46): 2 [] -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.67/1.84  ** 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.67/1.84  ** KEPT (pick-wt=21): 4 [] -test(A,B,C,D,E,F,G,H,I,J)|output(A,B,C,D,E,F,G,H,I).
% 1.67/1.84  ** KEPT (pick-wt=30): 5 [] -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.67/1.84  
% 1.67/1.84  ------------> process sos:
% 1.67/1.84  ** KEPT (pick-wt=3): 6 [] A=A.
% 1.67/1.84  ** KEPT (pick-wt=5): 7 [] and(A,n0)=n0.
% 1.67/1.84  ---> New Demodulator: 8 [new_demod,7] and(A,n0)=n0.
% 1.67/1.84  ** KEPT (pick-wt=5): 9 [] and(A,n1)=A.
% 1.67/1.84  ---> New Demodulator: 10 [new_demod,9] and(A,n1)=A.
% 1.67/1.84  ** KEPT (pick-wt=5): 11 [] or(A,n0)=A.
% 1.67/1.84  ---> New Demodulator: 12 [new_demod,11] or(A,n0)=A.
% 1.67/1.84  ** KEPT (pick-wt=5): 13 [] or(A,n1)=n1.
% 1.67/1.84  ---> New Demodulator: 14 [new_demod,13] or(A,n1)=n1.
% 1.67/1.84  ** KEPT (pick-wt=4): 15 [] not(n0)=n1.
% 1.67/1.84  ---> New Demodulator: 16 [new_demod,15] not(n0)=n1.
% 1.67/1.84  ** KEPT (pick-wt=4): 17 [] not(n1)=n0.
% 1.67/1.84  ---> New Demodulator: 18 [new_demod,17] not(n1)=n0.
% 1.67/1.84  ** KEPT (pick-wt=11): 20 [copy,19,flip.1] list(A,add_inverter(B,C))=add_inverter(list(A,B),C).
% 1.67/1.84  ---> New Demodulator: 21 [new_demod,20] list(A,add_inverter(B,C))=add_inverter(list(A,B),C).
% 1.67/1.84  ** KEPT (pick-wt=7): 23 [copy,22,flip.1] list(A,B)=add_inverter(B,A).
% 1.67/1.84  ---> New Demodulator: 24 [new_demod,23] list(A,B)=add_inverter(B,A).
% 1.67/1.84  ** KEPT (pick-wt=75): 26 [copy,25,demod,24] 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.67/1.84  ---> New Demodulator: 27 [new_demod,26] 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.67/1.84  ** KEPT (pick-wt=4): 28 [] make_reverse_list(A)=end.
% 1.67/1.84  ---> New Demodulator: 29 [new_demod,28] make_reverse_list(A)=end.
% 1.67/1.84  ** KEPT (pick-wt=6): 30 [] possible_reversion(A,n1,n0)=A.
% 1.67/1.84  ---> New Demodulator: 31 [new_demod,30] possible_reversion(A,n1,n0)=A.
% 1.67/1.84  ** KEPT (pick-wt=6): 32 [] possible_reversion(A,n0,n1)=not_reversion.
% 1.67/1.84  ---> New Demodulator: 33 [new_demod,32] possible_reversion(A,n0,n1)=not_reversion.
% 1.67/1.84  ** KEPT (pick-wt=6): 34 [] possible_reversion(A,B,B)=not_reversion.
% 1.67/1.84  ---> New Demodulator: 35 [new_demod,34] possible_reversion(A,B,B)=not_reversion.
% 1.67/1.84  ** KEPT (pick-wt=5): 36 [] list_reversion(not_reversion,A)=A.
% 1.67/1.84  ---> New Demodulator: 37 [new_demod,36] list_reversion(not_reversion,A)=A.
% 1.67/1.84  ** KEPT (pick-wt=11): 38 [] list_reversion(A,list_reversion(B,C))=list_reversion(B,list_reversion(A,C)).
% 1.67/1.84  ** KEPT (pick-wt=9): 39 [] list_reversion(A,list_reversion(A,B))=list_reversion(A,B).
% 1.67/1.84  ---> New Demodulator: 40 [new_demod,39] list_reversion(A,list_reversion(A,B))=list_reversion(A,B).
% 1.67/1.84  ** KEPT (pick-wt=10): 41 [] output(n0,n0,n0,n0,n1,n1,n1,n1,A).
% 1.67/1.84  ** KEPT (pick-wt=10): 42 [] output(n0,n0,n1,n1,n0,n0,n1,n1,A).
% 1.67/1.84  ** KEPT (pick-wt=10): 43 [] output(n0,n1,n0,n1,n0,n1,n0,n1,A).
% 1.67/1.84    Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] A=A.
% 1.67/1.84  >>>> Starting back demodulation with 8.
% 1.67/1.84  >>>> Starting back demodulation with 10.
% 1.67/1.84  >>>> Starting back demodulation with 12.
% 44.98/45.21  >>>> Starting back demodulation with 14.
% 44.98/45.21  >>>> Starting back demodulation with 16.
% 44.98/45.21  >>>> Starting back demodulation with 18.
% 44.98/45.21  >>>> Starting back demodulation with 21.
% 44.98/45.21  >>>> Starting back demodulation with 24.
% 44.98/45.21      >> back demodulating 20 with 24.
% 44.98/45.21      >> back demodulating 3 with 24.
% 44.98/45.21  >>>> Starting back demodulation with 27.
% 44.98/45.21  >>>> Starting back demodulation with 29.
% 44.98/45.21      >> back demodulating 26 with 29.
% 44.98/45.21  >>>> Starting back demodulation with 31.
% 44.98/45.21  >>>> Starting back demodulation with 33.
% 44.98/45.21  >>>> Starting back demodulation with 35.
% 44.98/45.21  >>>> Starting back demodulation with 37.
% 44.98/45.21    Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] list_reversion(A,list_reversion(B,C))=list_reversion(B,list_reversion(A,C)).
% 44.98/45.21  >>>> Starting back demodulation with 40.
% 44.98/45.21    Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] add_inverter(add_inverter(A,B),C)=add_inverter(add_inverter(A,C),B).
% 44.98/45.21  >>>> Starting back demodulation with 47.
% 44.98/45.21  
% 44.98/45.21  ======= end of input processing =======
% 44.98/45.21  
% 44.98/45.21  =========== start of search ===========
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 23.
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 23.
% 44.98/45.21  
% 44.98/45.21  sos_size=1010
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 22.
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 22.
% 44.98/45.21  
% 44.98/45.21  sos_size=1081
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 21.
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 21.
% 44.98/45.21  
% 44.98/45.21  sos_size=1156
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 20.
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Resetting weight limit to 20.
% 44.98/45.21  
% 44.98/45.21  sos_size=1159
% 44.98/45.21  
% 44.98/45.21  Search stopped because sos empty.
% 44.98/45.21  
% 44.98/45.21  
% 44.98/45.21  Search stopped because sos empty.
% 44.98/45.21  
% 44.98/45.21  ============ end of search ============
% 44.98/45.21  
% 44.98/45.21  -------------- statistics -------------
% 44.98/45.21  clauses given               1741
% 44.98/45.21  clauses generated        8578102
% 44.98/45.21  clauses kept                2092
% 44.98/45.21  clauses forward subsumed 1654454
% 44.98/45.21  clauses back subsumed          0
% 44.98/45.21  Kbytes malloced             5859
% 44.98/45.21  
% 44.98/45.21  ----------- times (seconds) -----------
% 44.98/45.21  user CPU time         43.36          (0 hr, 0 min, 43 sec)
% 44.98/45.21  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 44.98/45.21  wall-clock time       45             (0 hr, 0 min, 45 sec)
% 44.98/45.21  
% 44.98/45.21  Process 24430 finished Wed Jul 27 04:05:39 2022
% 44.98/45.21  Otter interrupted
% 44.98/45.21  PROOF NOT FOUND
%------------------------------------------------------------------------------