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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : HWV003-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:02 EDT 2022

% Result   : Unknown 3.00s 3.23s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : HWV003-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.15  % Command  : otter-tptp-script %s
% 0.12/0.36  % Computer : n014.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8042.1875MB
% 0.12/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36  % CPULimit : 300
% 0.12/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Wed Jul 27 06:39:09 EDT 2022
% 0.12/0.36  % CPUTime  : 
% 1.80/2.04  ----- Otter 3.3f, August 2004 -----
% 1.80/2.04  The process was started by sandbox on n014.cluster.edu,
% 1.80/2.04  Wed Jul 27 06:39:09 2022
% 1.80/2.04  The command was "./otter".  The process ID is 19851.
% 1.80/2.04  
% 1.80/2.04  set(prolog_style_variables).
% 1.80/2.04  set(auto).
% 1.80/2.04     dependent: set(auto1).
% 1.80/2.04     dependent: set(process_input).
% 1.80/2.04     dependent: clear(print_kept).
% 1.80/2.04     dependent: clear(print_new_demod).
% 1.80/2.04     dependent: clear(print_back_demod).
% 1.80/2.04     dependent: clear(print_back_sub).
% 1.80/2.04     dependent: set(control_memory).
% 1.80/2.04     dependent: assign(max_mem, 12000).
% 1.80/2.04     dependent: assign(pick_given_ratio, 4).
% 1.80/2.04     dependent: assign(stats_level, 1).
% 1.80/2.04     dependent: assign(max_seconds, 10800).
% 1.80/2.04  clear(print_given).
% 1.80/2.04  
% 1.80/2.04  list(usable).
% 1.80/2.04  0 [] A=A.
% 1.80/2.04  0 [] and(X,n0)=n0.
% 1.80/2.04  0 [] and(X,n1)=X.
% 1.80/2.04  0 [] or(X,n0)=X.
% 1.80/2.04  0 [] or(X,n1)=n1.
% 1.80/2.04  0 [] not(n0)=n1.
% 1.80/2.04  0 [] not(n1)=n0.
% 1.80/2.04  0 [] not(and(X,Y))=or(not(X),not(Y)).
% 1.80/2.04  0 [] not(or(X,Y))=and(not(X),not(Y)).
% 1.80/2.04  0 [] not(not(X))=X.
% 1.80/2.04  0 [] and(X,Y)=and(Y,X).
% 1.80/2.04  0 [] or(X,Y)=or(Y,X).
% 1.80/2.04  0 [] and(or(X,Y),Z)=or(and(X,Z),and(Y,Z)).
% 1.80/2.04  0 [] and(and(X,Y),Z)=and(and(X,Z),Y).
% 1.80/2.04  0 [] or(or(X,Y),Z)=or(or(X,Z),Y).
% 1.80/2.04  0 [] and(X,not(X))=n0.
% 1.80/2.04  0 [] or(X,not(X))=n1.
% 1.80/2.04  0 [] and(X,X)=X.
% 1.80/2.04  0 [] or(X,X)=X.
% 1.80/2.04  0 [] and(and(X,Y),not(Y))=n0.
% 1.80/2.04  0 [] and(and(X,Y),not(X))=n0.
% 1.80/2.04  0 [] or(or(X,Y),not(Y))=n1.
% 1.80/2.04  0 [] or(or(X,Y),not(X))=n1.
% 1.80/2.04  0 [] and(and(X,Y),Y)=and(X,Y).
% 1.80/2.04  0 [] or(or(X,Y),Y)=or(X,Y).
% 1.80/2.04  0 [] and(and(and(X1,X2),X3),not(X1))=n0.
% 1.80/2.04  0 [] and(and(and(X1,X2),X3),not(X2))=n0.
% 1.80/2.04  0 [] or(and(X,Y),Y)=Y.
% 1.80/2.04  0 [] or(and(X,Y),X)=X.
% 1.80/2.04  0 [] or(or(and(X,Y),Z),Y)=or(Z,Y).
% 1.80/2.04  0 [] or(or(X,and(Y,Z)),Z)=or(X,Z).
% 1.80/2.04  0 [] or(and(X,not(Y)),Y)=or(X,Y).
% 1.80/2.04  0 [] or(and(not(X),not(Y)),Y)=or(Y,not(X)).
% 1.80/2.04  0 [] or(and(and(X,Y),not(Z)),and(X,Z))=or(and(X,Y),and(X,Z)).
% 1.80/2.04  0 [] xor(X,Y)=or(and(X,not(Y)),and(Y,not(X))).
% 1.80/2.04  0 [] carryout(X,Y,Z)=or(and(X,or(Y,Z)),and(not(X),and(Y,Z))).
% 1.80/2.04  0 [] sum(X,Y,Z)=xor(xor(X,Y),Z).
% 1.80/2.04  0 [] a11=not(and(a,b)).
% 1.80/2.04  0 [] a12=not(and(a11,a)).
% 1.80/2.04  0 [] a13=not(and(a11,b)).
% 1.80/2.04  0 [] a14=not(and(a12,a13)).
% 1.80/2.04  0 [] a15=not(and(a14,carryin)).
% 1.80/2.04  0 [] a16=not(and(a14,a15)).
% 1.80/2.04  0 [] a17=not(and(a15,carryin)).
% 1.80/2.04  0 [] s1=not(and(a16,a17)).
% 1.80/2.04  0 [] c1=not(and(a11,a15)).
% 1.80/2.04  0 [] circuit(s1,c1).
% 1.80/2.04  0 [] -circuit(sum(a,b,carryin),carryout(a,b,carryin)).
% 1.80/2.04  end_of_list.
% 1.80/2.04  
% 1.80/2.04  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.80/2.04  
% 1.80/2.04  All clauses are units, and equality is present; the
% 1.80/2.04  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.80/2.04  
% 1.80/2.04     dependent: set(knuth_bendix).
% 1.80/2.04     dependent: set(anl_eq).
% 1.80/2.04     dependent: set(para_from).
% 1.80/2.04     dependent: set(para_into).
% 1.80/2.04     dependent: clear(para_from_right).
% 1.80/2.04     dependent: clear(para_into_right).
% 1.80/2.04     dependent: set(para_from_vars).
% 1.80/2.04     dependent: set(eq_units_both_ways).
% 1.80/2.04     dependent: set(dynamic_demod_all).
% 1.80/2.04     dependent: set(dynamic_demod).
% 1.80/2.04     dependent: set(order_eq).
% 1.80/2.04     dependent: set(back_demod).
% 1.80/2.04     dependent: set(lrpo).
% 1.80/2.04  
% 1.80/2.04  ------------> process usable:
% 1.80/2.04  ** KEPT (pick-wt=9): 1 [] -circuit(sum(a,b,carryin),carryout(a,b,carryin)).
% 1.80/2.04  
% 1.80/2.04  ------------> process sos:
% 1.80/2.04  ** KEPT (pick-wt=3): 2 [] A=A.
% 1.80/2.04  ** KEPT (pick-wt=5): 3 [] and(A,n0)=n0.
% 1.80/2.04  ---> New Demodulator: 4 [new_demod,3] and(A,n0)=n0.
% 1.80/2.04  ** KEPT (pick-wt=5): 5 [] and(A,n1)=A.
% 1.80/2.04  ---> New Demodulator: 6 [new_demod,5] and(A,n1)=A.
% 1.80/2.04  ** KEPT (pick-wt=5): 7 [] or(A,n0)=A.
% 1.80/2.04  ---> New Demodulator: 8 [new_demod,7] or(A,n0)=A.
% 1.80/2.04  ** KEPT (pick-wt=5): 9 [] or(A,n1)=n1.
% 1.80/2.04  ---> New Demodulator: 10 [new_demod,9] or(A,n1)=n1.
% 1.80/2.04  ** KEPT (pick-wt=4): 11 [] not(n0)=n1.
% 1.80/2.04  ---> New Demodulator: 12 [new_demod,11] not(n0)=n1.
% 1.80/2.04  ** KEPT (pick-wt=4): 13 [] not(n1)=n0.
% 1.80/2.04  ---> New Demodulator: 14 [new_demod,13] not(n1)=n0.
% 1.80/2.04  ** KEPT (pick-wt=10): 15 [] not(and(A,B))=or(not(A),not(B)).
% 1.80/2.04  ---> New Demodulator: 16 [new_demod,15] not(and(A,B))=or(not(A),not(B)).
% 1.80/2.04  ** KEPT (pick-wt=10): 17 [] not(or(A,B))=and(not(A),not(B)).
% 1.80/2.04  ---> New Demodulator: 18 [new_demod,17] not(or(A,B))=and(not(A),not(B)).
% 1.80/2.04  ** KEPT (pick-wt=5): 19 [] not(not(A))=A.
% 1.80/2.04  ---> New Demodulator: 20 [new_demod,19] not(not(A))=A.
% 1.80/2.04  ** KEPT (pick-wt=7): 21 [] and(A,B)=and(B,A).
% 1.80/2.04  ** KEPT (pick-wt=7): 22 [] or(A,B)=or(B,A).
% 1.80/2.04  ** KEPT (pick-wt=13): 24 [copy,23,flip.1] or(and(A,B),and(C,B))=and(or(A,C),B).
% 1.80/2.04  ---> New Demodulator: 25 [new_demod,24] or(and(A,B),and(C,B))=and(or(A,C),B).
% 1.80/2.04  ** KEPT (pick-wt=11): 26 [] and(and(A,B),C)=and(and(A,C),B).
% 1.80/2.04  ** KEPT (pick-wt=11): 27 [] or(or(A,B),C)=or(or(A,C),B).
% 1.80/2.04  ** KEPT (pick-wt=6): 28 [] and(A,not(A))=n0.
% 1.80/2.04  ---> New Demodulator: 29 [new_demod,28] and(A,not(A))=n0.
% 1.80/2.04  ** KEPT (pick-wt=6): 30 [] or(A,not(A))=n1.
% 1.80/2.04  ---> New Demodulator: 31 [new_demod,30] or(A,not(A))=n1.
% 1.80/2.04  ** KEPT (pick-wt=5): 32 [] and(A,A)=A.
% 1.80/2.04  ---> New Demodulator: 33 [new_demod,32] and(A,A)=A.
% 1.80/2.04  ** KEPT (pick-wt=5): 34 [] or(A,A)=A.
% 1.80/2.04  ---> New Demodulator: 35 [new_demod,34] or(A,A)=A.
% 1.80/2.04  ** KEPT (pick-wt=8): 36 [] and(and(A,B),not(B))=n0.
% 1.80/2.04  ---> New Demodulator: 37 [new_demod,36] and(and(A,B),not(B))=n0.
% 1.80/2.04  ** KEPT (pick-wt=8): 38 [] and(and(A,B),not(A))=n0.
% 1.80/2.04  ---> New Demodulator: 39 [new_demod,38] and(and(A,B),not(A))=n0.
% 1.80/2.04  ** KEPT (pick-wt=8): 40 [] or(or(A,B),not(B))=n1.
% 1.80/2.04  ---> New Demodulator: 41 [new_demod,40] or(or(A,B),not(B))=n1.
% 1.80/2.04  ** KEPT (pick-wt=8): 42 [] or(or(A,B),not(A))=n1.
% 1.80/2.04  ---> New Demodulator: 43 [new_demod,42] or(or(A,B),not(A))=n1.
% 1.80/2.04  ** KEPT (pick-wt=9): 44 [] and(and(A,B),B)=and(A,B).
% 1.80/2.04  ---> New Demodulator: 45 [new_demod,44] and(and(A,B),B)=and(A,B).
% 1.80/2.04  ** KEPT (pick-wt=9): 46 [] or(or(A,B),B)=or(A,B).
% 1.80/2.04  ---> New Demodulator: 47 [new_demod,46] or(or(A,B),B)=or(A,B).
% 1.80/2.04  ** KEPT (pick-wt=10): 48 [] and(and(and(A,B),C),not(A))=n0.
% 1.80/2.04  ---> New Demodulator: 49 [new_demod,48] and(and(and(A,B),C),not(A))=n0.
% 1.80/2.04  ** KEPT (pick-wt=10): 50 [] and(and(and(A,B),C),not(B))=n0.
% 1.80/2.04  ---> New Demodulator: 51 [new_demod,50] and(and(and(A,B),C),not(B))=n0.
% 1.80/2.04  ** KEPT (pick-wt=7): 52 [] or(and(A,B),B)=B.
% 1.80/2.04  ---> New Demodulator: 53 [new_demod,52] or(and(A,B),B)=B.
% 1.80/2.04  ** KEPT (pick-wt=7): 54 [] or(and(A,B),A)=A.
% 1.80/2.04  ---> New Demodulator: 55 [new_demod,54] or(and(A,B),A)=A.
% 1.80/2.04  ** KEPT (pick-wt=11): 56 [] or(or(and(A,B),C),B)=or(C,B).
% 1.80/2.04  ---> New Demodulator: 57 [new_demod,56] or(or(and(A,B),C),B)=or(C,B).
% 1.80/2.04  ** KEPT (pick-wt=11): 58 [] or(or(A,and(B,C)),C)=or(A,C).
% 1.80/2.04  ---> New Demodulator: 59 [new_demod,58] or(or(A,and(B,C)),C)=or(A,C).
% 1.80/2.04  ** KEPT (pick-wt=10): 60 [] or(and(A,not(B)),B)=or(A,B).
% 1.80/2.04  ---> New Demodulator: 61 [new_demod,60] or(and(A,not(B)),B)=or(A,B).
% 1.80/2.04    Following clause subsumed by 22 during input processing: 0 [demod,61] or(not(A),B)=or(B,not(A)).
% 1.80/2.04  ** KEPT (pick-wt=18): 62 [] or(and(and(A,B),not(C)),and(A,C))=or(and(A,B),and(A,C)).
% 1.80/2.04  ---> New Demodulator: 63 [new_demod,62] or(and(and(A,B),not(C)),and(A,C))=or(and(A,B),and(A,C)).
% 1.80/2.04  ** KEPT (pick-wt=13): 64 [] xor(A,B)=or(and(A,not(B)),and(B,not(A))).
% 1.80/2.04  ** KEPT (pick-wt=17): 66 [copy,65,flip.1] or(and(A,or(B,C)),and(not(A),and(B,C)))=carryout(A,B,C).
% 1.80/2.04  ---> New Demodulator: 67 [new_demod,66] or(and(A,or(B,C)),and(not(A),and(B,C)))=carryout(A,B,C).
% 1.80/2.04  ** KEPT (pick-wt=10): 69 [copy,68,flip.1] xor(xor(A,B),C)=sum(A,B,C).
% 1.80/2.04  ---> New Demodulator: 70 [new_demod,69] xor(xor(A,B),C)=sum(A,B,C).
% 1.80/2.04  ** KEPT (pick-wt=7): 72 [copy,71,demod,16,flip.1] or(not(a),not(b))=a11.
% 1.80/2.04  ---> New Demodulator: 73 [new_demod,72] or(not(a),not(b))=a11.
% 1.80/2.04  ** KEPT (pick-wt=7): 75 [copy,74,demod,16,flip.1] or(not(a11),not(a))=a12.
% 1.80/2.04  ---> New Demodulator: 76 [new_demod,75] or(not(a11),not(a))=a12.
% 1.80/2.04  ** KEPT (pick-wt=7): 78 [copy,77,demod,16,flip.1] or(not(a11),not(b))=a13.
% 1.80/2.04  ---> New Demodulator: 79 [new_demod,78] or(not(a11),not(b))=a13.
% 1.80/2.04  ** KEPT (pick-wt=7): 81 [copy,80,demod,16,flip.1] or(not(a12),not(a13))=a14.
% 1.80/2.04  ---> New Demodulator: 82 [new_demod,81] or(not(a12),not(a13))=a14.
% 1.80/2.04  ** KEPT (pick-wt=7): 84 [copy,83,demod,16,flip.1] or(not(a14),not(carryin))=a15.
% 1.80/2.04  ---> New Demodulator: 85 [new_demod,84] or(not(a14),not(carryin))=a15.
% 1.80/2.04  ** KEPT (pick-wt=7): 87 [copy,86,demod,16,flip.1] or(not(a14),not(a15))=a16.
% 1.80/2.04  ---> New Demodulator: 88 [new_demod,87] or(not(a14),not(a15))=a16.
% 1.80/2.04  ** KEPT (pick-wt=7): 90 [copy,89,demod,16,flip.1] or(not(a15),not(carryin))=a17.
% 1.80/2.04  ---> New Demodulator: 91 [new_demod,90] or(not(a15),not(carryin))=a17.
% 1.80/2.04  ** KEPT (pick-wt=7): 93 [copy,92,demod,16,flip.1] or(not(a16),not(a17))=s1.
% 1.80/2.04  ---> New Demodulator: 94 [new_demod,93] or(not(a16),not(a17))=s1.
% 1.80/2.04  ** KEPT (pick-wt=7): 96 [copy,95,demod,16,flip.1] or(not(a11),not(a15))=c1.
% 1.80/2.04  ---> New Demodulator: 97 [new_demod,96] or(not(a11),not(a15))=c1.
% 1.80/2.04  ** KEPT (pick-wt=3): 98 [] circuit(s1,c1).
% 1.80/2.04    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.80/2.04  >>>> Starting back demodulation with 4.
% 3.00/3.23  >>>> Starting back demodulation with 6.
% 3.00/3.23  >>>> Starting back demodulation with 8.
% 3.00/3.23  >>>> Starting back demodulation with 10.
% 3.00/3.23  >>>> Starting back demodulation with 12.
% 3.00/3.23  >>>> Starting back demodulation with 14.
% 3.00/3.23  >>>> Starting back demodulation with 16.
% 3.00/3.23  >>>> Starting back demodulation with 18.
% 3.00/3.23  >>>> Starting back demodulation with 20.
% 3.00/3.23    Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] and(A,B)=and(B,A).
% 3.00/3.23    Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] or(A,B)=or(B,A).
% 3.00/3.23  >>>> Starting back demodulation with 25.
% 3.00/3.23    Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] and(and(A,B),C)=and(and(A,C),B).
% 3.00/3.23    Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] or(or(A,B),C)=or(or(A,C),B).
% 3.00/3.23  >>>> Starting back demodulation with 29.
% 3.00/3.23  >>>> Starting back demodulation with 31.
% 3.00/3.23  >>>> Starting back demodulation with 33.
% 3.00/3.23  >>>> Starting back demodulation with 35.
% 3.00/3.23  >>>> Starting back demodulation with 37.
% 3.00/3.23  >>>> Starting back demodulation with 39.
% 3.00/3.23  >>>> Starting back demodulation with 41.
% 3.00/3.23  >>>> Starting back demodulation with 43.
% 3.00/3.23  >>>> Starting back demodulation with 45.
% 3.00/3.23  >>>> Starting back demodulation with 47.
% 3.00/3.23  >>>> Starting back demodulation with 49.
% 3.00/3.23  >>>> Starting back demodulation with 51.
% 3.00/3.23  >>>> Starting back demodulation with 53.
% 3.00/3.23  >>>> Starting back demodulation with 55.
% 3.00/3.23  >>>> Starting back demodulation with 57.
% 3.00/3.23  >>>> Starting back demodulation with 59.
% 3.00/3.23  >>>> Starting back demodulation with 61.
% 3.00/3.23  >>>> Starting back demodulation with 63.
% 3.00/3.23  ** KEPT (pick-wt=13): 99 [copy,64,flip.1] or(and(A,not(B)),and(B,not(A)))=xor(A,B).
% 3.00/3.23  >>>> Starting back demodulation with 67.
% 3.00/3.23  >>>> Starting back demodulation with 70.
% 3.00/3.23  >>>> Starting back demodulation with 73.
% 3.00/3.23  >>>> Starting back demodulation with 76.
% 3.00/3.23  >>>> Starting back demodulation with 79.
% 3.00/3.23  >>>> Starting back demodulation with 82.
% 3.00/3.23  >>>> Starting back demodulation with 85.
% 3.00/3.23  >>>> Starting back demodulation with 88.
% 3.00/3.23  >>>> Starting back demodulation with 91.
% 3.00/3.23  >>>> Starting back demodulation with 94.
% 3.00/3.23  >>>> Starting back demodulation with 97.
% 3.00/3.23    Following clause subsumed by 64 during input processing: 0 [copy,99,flip.1] xor(A,B)=or(and(A,not(B)),and(B,not(A))).
% 3.00/3.23  
% 3.00/3.23  ======= end of input processing =======
% 3.00/3.23  
% 3.00/3.23  =========== start of search ===========
% 3.00/3.23  
% 3.00/3.23  
% 3.00/3.23  Resetting weight limit to 9.
% 3.00/3.23  
% 3.00/3.23  
% 3.00/3.23  Resetting weight limit to 9.
% 3.00/3.23  
% 3.00/3.23  sos_size=494
% 3.00/3.23  
% 3.00/3.23  Search stopped because sos empty.
% 3.00/3.23  
% 3.00/3.23  
% 3.00/3.23  Search stopped because sos empty.
% 3.00/3.23  
% 3.00/3.23  ============ end of search ============
% 3.00/3.23  
% 3.00/3.23  -------------- statistics -------------
% 3.00/3.23  clauses given                972
% 3.00/3.23  clauses generated         222982
% 3.00/3.23  clauses kept                1544
% 3.00/3.23  clauses forward subsumed   93293
% 3.00/3.23  clauses back subsumed          1
% 3.00/3.23  Kbytes malloced             5859
% 3.00/3.23  
% 3.00/3.23  ----------- times (seconds) -----------
% 3.00/3.23  user CPU time          1.18          (0 hr, 0 min, 1 sec)
% 3.00/3.23  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 3.00/3.23  wall-clock time        3             (0 hr, 0 min, 3 sec)
% 3.00/3.23  
% 3.00/3.23  Process 19851 finished Wed Jul 27 06:39:12 2022
% 3.00/3.23  Otter interrupted
% 3.00/3.23  PROOF NOT FOUND
%------------------------------------------------------------------------------