↑ Up

EQP---0.9e.UNK-Non.f

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : SWX229-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n005.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 : Tue May  5 07:00:12 PM UTC 2026

% Result   : Unknown 7.13s 7.52s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX229-1 : TPTP v9.3.0. Released v9.3.0.
% 0.13/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.17/0.34  % Computer : n005.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Tue May  5 12:57:30 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.72/1.11  ----- EQP 0.9e, May 2009 -----
% 0.72/1.11  The job began on n005.cluster.edu, Tue May  5 12:57:31 2026
% 0.72/1.11  The command was "./eqp09e".
% 0.72/1.11  
% 0.72/1.11  set(prolog_style_variables).
% 0.72/1.11  set(lrpo).
% 0.72/1.11  set(basic_paramod).
% 0.72/1.11  set(functional_subsume).
% 0.72/1.11  set(ordered_paramod).
% 0.72/1.11  set(prime_paramod).
% 0.72/1.11  set(para_pairs).
% 0.72/1.11  assign(pick_given_ratio,4).
% 0.72/1.11  clear(print_kept).
% 0.72/1.11  clear(print_new_demod).
% 0.72/1.11  clear(print_back_demod).
% 0.72/1.11  clear(print_given).
% 0.72/1.11  assign(max_mem,64000).
% 0.72/1.11  end_of_commands.
% 0.72/1.11  
% 0.72/1.11  Usable:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Sos:
% 0.72/1.11  0 (wt=-1) [] aux(A,B,btrue) = B.
% 0.72/1.11  0 (wt=-1) [] aux(A,B,bfalse) = A.
% 0.72/1.11  0 (wt=-1) [] aux2(A,B,btrue) = nil4.
% 0.72/1.11  0 (wt=-1) [] aux2(A,B,bfalse) = cons4(A,enumFromToNat(suc(A),B)).
% 0.72/1.11  0 (wt=-1) [] aux3(A,btrue) = cons6(o,bin(halfNat(suc(A)))).
% 0.72/1.11  0 (wt=-1) [] aux3(A,bfalse) = cons6(i,bin(halfNat(suc(A)))).
% 0.72/1.11  0 (wt=-1) [] predNat(zero) = zero.
% 0.72/1.11  0 (wt=-1) [] predNat(suc(A)) = A.
% 0.72/1.11  0 (wt=-1) [] orb(btrue,A) = btrue.
% 0.72/1.11  0 (wt=-1) [] orb(bfalse,A) = A.
% 0.72/1.11  0 (wt=-1) [] or2(nil5) = bfalse.
% 0.72/1.11  0 (wt=-1) [] or2(cons5(A,B)) = orb(A,or2(B)).
% 0.72/1.11  0 (wt=-1) [] one = suc(zero).
% 0.72/1.11  0 (wt=-1) [] two = suc(one).
% 0.72/1.11  0 (wt=-1) [] three = suc(two).
% 0.72/1.11  0 (wt=-1) [] notb(btrue) = bfalse.
% 0.72/1.11  0 (wt=-1) [] notb(bfalse) = btrue.
% 0.72/1.11  0 (wt=-1) [] lt(zero,zero) = bfalse.
% 0.72/1.11  0 (wt=-1) [] lt(zero,suc(A)) = btrue.
% 0.72/1.11  0 (wt=-1) [] lt(suc(A),zero) = bfalse.
% 0.72/1.11  0 (wt=-1) [] lt(suc(A),suc(B)) = lt(A,B).
% 0.72/1.11  0 (wt=-1) [] maxNat(A,B) = aux(A,B,lt(A,B)).
% 0.72/1.11  0 (wt=-1) [] maximum(A,nil2) = A.
% 0.72/1.11  0 (wt=-1) [] maximum(A,cons2(pair22(B,C),D)) = maximum(maxNat(A,maxNat(B,C)),D).
% 0.72/1.11  0 (wt=-1) [] len(nil3) = zero.
% 0.72/1.11  0 (wt=-1) [] len(cons3(A,B)) = suc(len(B)).
% 0.72/1.11  0 (wt=-1) [] last(A,nil3) = A.
% 0.72/1.11  0 (wt=-1) [] last(A,cons3(B,C)) = last(B,C).
% 0.72/1.11  0 (wt=-1) [] halfNat(zero) = zero.
% 0.72/1.11  0 (wt=-1) [] halfNat(suc(zero)) = zero.
% 0.72/1.11  0 (wt=-1) [] halfNat(suc(suc(A))) = suc(halfNat(A)).
% 0.72/1.11  0 (wt=-1) [] evenNat(zero) = btrue.
% 0.72/1.11  0 (wt=-1) [] evenNat(suc(zero)) = bfalse.
% 0.72/1.11  0 (wt=-1) [] evenNat(suc(suc(A))) = evenNat(A).
% 0.72/1.11  0 (wt=-1) [] enumFromToNat(A,B) = aux2(A,B,lt(B,A)).
% 0.72/1.11  0 (wt=-1) [] dodeca(nil4) = nil2.
% 0.72/1.11  0 (wt=-1) [] dodeca(cons4(A,B)) = cons2(pair22(A,suc(A)),dodeca(B)).
% 0.72/1.11  0 (wt=-1) [] bin(zero) = nil6.
% 0.72/1.11  0 (wt=-1) [] bin(suc(A)) = aux3(A,evenNat(suc(A))).
% 0.72/1.11  0 (wt=-1) [] bgraph(nil2) = nil.
% 0.72/1.11  0 (wt=-1) [] bgraph(cons2(pair22(A,B),C)) = cons(pair2(bin(A),bin(B)),bgraph(C)).
% 0.72/1.11  0 (wt=-1) [] beq(nil6,nil6) = btrue.
% 0.72/1.11  0 (wt=-1) [] beq(nil6,cons6(A,B)) = bfalse.
% 0.72/1.11  0 (wt=-1) [] beq(cons6(i,A),nil6) = bfalse.
% 0.72/1.11  0 (wt=-1) [] beq(cons6(i,A),cons6(i,B)) = beq(A,B).
% 0.72/1.11  0 (wt=-1) [] beq(cons6(i,A),cons6(o,B)) = bfalse.
% 0.72/1.11  0 (wt=-1) [] beq(cons6(o,A),nil6) = bfalse.
% 0.72/1.11  0 (wt=-1) [] beq(cons6(o,A),cons6(i,B)) = bfalse.
% 0.72/1.11  0 (wt=-1) [] beq(cons6(o,A),cons6(o,B)) = beq(A,B).
% 0.72/1.11  0 (wt=-1) [] belem(A,nil3) = nil5.
% 0.72/1.11  0 (wt=-1) [] belem(A,cons3(B,C)) = cons5(beq(A,B),belem(A,C)).
% 0.72/1.11  0 (wt=-1) [] belem2(A,B) = or2(belem(A,B)).
% 0.72/1.11  0 (wt=-1) [] append(nil2,A) = A.
% 0.72/1.11  0 (wt=-1) [] append(cons2(A,B),C) = cons2(A,append(B,C)).
% 0.72/1.11  0 (wt=-1) [] andb(btrue,A) = A.
% 0.72/1.11  0 (wt=-1) [] andb(bfalse,A) = bfalse.
% 0.72/1.11  0 (wt=-1) [] bpath(A,B,nil) = nil5.
% 0.72/1.11  0 (wt=-1) [] bpath(A,B,cons(pair2(C,D),E)) = cons5(orb(andb(beq(C,A),beq(D,B)),andb(beq(C,B),beq(D,A))),bpath(A,B,E)).
% 0.72/1.11  0 (wt=-1) [] bpath2(nil3,A) = btrue.
% 0.72/1.11  0 (wt=-1) [] bpath2(cons3(A,nil3),B) = btrue.
% 0.72/1.11  0 (wt=-1) [] bpath2(cons3(A,cons3(B,C)),D) = andb(or2(bpath(A,B,D)),bpath2(cons3(B,C),D)).
% 0.72/1.11  0 (wt=-1) [] bunique(nil3) = btrue.
% 0.72/1.11  0 (wt=-1) [] bunique(cons3(A,B)) = andb(notb(belem2(A,B)),bunique(B)).
% 0.72/1.11  0 (wt=-1) [] add(zero,A) = A.
% 0.72/1.11  0 (wt=-1) [] add(suc(A),B) = suc(add(A,B)).
% 0.72/1.11  0 (wt=-1) [] btour(nil3,nil2) = btrue.
% 0.72/1.11  0 (wt=-1) [] btour(nil3,cons2(A,B)) = bfalse.
% 0.72/1.11  0 (wt=-1) [] btour(cons3(A,B),nil2) = bfalse.
% 0.72/1.11  0 (wt=-1) [] btour(cons3(A,B),cons2(pair22(C,D),E)) = andb(beq(A,last(A,B)),andb(bpath2(cons3(A,B),bgraph(cons2(pair22(C,D),E))),andb(bunique(B),eq(len(cons3(A,B)),add(two,maximum(maxNat(C,D),E)))))).
% 0.72/1.11  0 (wt=-1) [] dodeca2(A,nil4) = nil2.
% 0.72/1.11  0 (wt=-1) [] dodeca2(A,cons4(B,C)) = cons2(pair22(B,add(suc(A),B)),dodeca2(A,C)).
% 0.72/1.11  0 (wt=-1) [] dodeca3(A,nil4) = nil2.
% 0.72/1.11  0 (wt=-1) [] dodeca3(A,cons4(B,C)) = cons2(pair22(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)).
% 0.72/1.11  0 (wt=-1) [] dodeca4(A,nil4) = nil2.
% 0.72/1.11  0 (wt=-1) [] dodeca4(A,cons4(B,C)) = cons2(pair22(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)).
% 0.72/1.11  0 (wt=-1) [] dodeca5(A,nil4) = nil2.
% 0.72/1.11  0 (wt=-1) [] dodeca5(A,cons4(B,C)) = cons2(pair22(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)).
% 0.72/1.11  0 (wt=-1) [] dodeca6(A,nil4) = nil2.
% 0.72/1.11  0 (wt=-1) [] dodeca6(A,cons4(B,C)) = cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),suc(B))),dodeca6(A,C)).
% 0.72/1.11  0 (wt=-1) [] dodeca7(zero) = nil2.
% 0.72/1.11  0 (wt=-1) [] dodeca7(suc(A)) = append(cons2(pair22(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons2(pair22(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),A),add(add(add(suc(A),suc(A)),suc(A)),zero)),dodeca6(A,enumFromToNat(zero,A)))))))).
% 0.72/1.11  0 (wt=-1) [] prop_bt3(A) = notb(btour(A,dodeca7(three))).
% 0.72/1.11  0 (wt=-1) [] eq2(bfalse,btrue) = bfalse.
% 0.72/1.11  0 (wt=-1) [] eq2(btrue,bfalse) = bfalse.
% 0.72/1.11  0 (wt=-1) [] eq3(i,o) = bfalse.
% 0.72/1.11  0 (wt=-1) [] eq3(o,i) = bfalse.
% 0.72/1.11  0 (wt=-1) [] eq(suc(A),suc(B)) = eq(A,B).
% 0.72/1.11  0 (wt=-1) [] eq(zero,suc(A)) = bfalse.
% 0.72/1.11  0 (wt=-1) [] eq(suc(A),zero) = bfalse.
% 0.72/1.11  0 (wt=-1) [] eq(A,A) = btrue.
% 0.72/1.11  0 (wt=-1) [] eq2(A,A) = btrue.
% 0.72/1.11  0 (wt=-1) [] eq3(A,A) = btrue.
% 0.72/1.11  0 (wt=-1) [] -(eq2(prop_bt3(A),bfalse) = btrue).
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Demodulators:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Passive:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Starting to process input.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 1 (wt=6) [] aux(A,B,btrue) = B.
% 0.72/1.11  1 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 2 (wt=6) [] aux(A,B,bfalse) = A.
% 0.72/1.11  2 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 3 (wt=6) [] aux2(A,B,btrue) = nil4.
% 0.72/1.11  3 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 4 (wt=11) [flip(1)] cons4(A,enumFromToNat(suc(A),B)) = aux2(A,B,bfalse).
% 0.72/1.11  4 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 5 (wt=10) [flip(1)] cons6(o,bin(halfNat(suc(A)))) = aux3(A,btrue).
% 0.72/1.11  5 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 6 (wt=10) [flip(1)] cons6(i,bin(halfNat(suc(A)))) = aux3(A,bfalse).
% 0.72/1.11  6 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 7 (wt=4) [] predNat(zero) = zero.
% 0.72/1.11  7 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 8 (wt=5) [] predNat(suc(A)) = A.
% 0.72/1.11  8 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 9 (wt=5) [] orb(btrue,A) = btrue.
% 0.72/1.11  9 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 10 (wt=5) [] orb(bfalse,A) = A.
% 0.72/1.11  10 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 11 (wt=4) [] or2(nil5) = bfalse.
% 0.72/1.11  11 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 12 (wt=9) [] or2(cons5(A,B)) = orb(A,or2(B)).
% 0.72/1.11  12 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 13 (wt=4) [flip(1)] suc(zero) = one.
% 0.72/1.11  13 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 14 (wt=4) [flip(1)] suc(one) = two.
% 0.72/1.11  14 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 15 (wt=4) [flip(1)] suc(two) = three.
% 0.72/1.11  15 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 16 (wt=4) [] notb(btrue) = bfalse.
% 0.72/1.11  16 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 17 (wt=4) [] notb(bfalse) = btrue.
% 0.72/1.11  17 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 18 (wt=5) [] lt(zero,zero) = bfalse.
% 0.72/1.11  18 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 19 (wt=6) [] lt(zero,suc(A)) = btrue.
% 0.72/1.11  19 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 20 (wt=6) [] lt(suc(A),zero) = bfalse.
% 0.72/1.11  20 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 21 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B).
% 0.72/1.11  21 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 22 (wt=10) [] maxNat(A,B) = aux(A,B,lt(A,B)).
% 0.72/1.11  22 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 23 (wt=5) [] maximum(A,nil2) = A.
% 0.72/1.11  23 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 24 (wt=26) [demod([22,22])] maximum(A,cons2(pair22(B,C),D)) = maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 25 (wt=26) [flip(24)] maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D) = maximum(A,cons2(pair22(B,C),D)).
% 0.72/1.11  clause forward subsumed: 0 (wt=26) [flip(25)] maximum(A,cons2(pair22(B,C),D)) = maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 26 (wt=4) [] len(nil3) = zero.
% 0.72/1.11  26 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 27 (wt=8) [] len(cons3(A,B)) = suc(len(B)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 28 (wt=8) [flip(27)] suc(len(A)) = len(cons3(B,A)).
% 0.72/1.11  clause forward subsumed: 0 (wt=8) [flip(28)] len(cons3(B,A)) = suc(len(A)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 29 (wt=5) [] last(A,nil3) = A.
% 0.72/1.11  29 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 30 (wt=9) [] last(A,cons3(B,C)) = last(B,C).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 31 (wt=9) [flip(30)] last(A,B) = last(C,cons3(A,B)).
% 0.72/1.11  clause forward subsumed: 0 (wt=9) [flip(31)] last(C,cons3(A,B)) = last(A,B).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 32 (wt=4) [] halfNat(zero) = zero.
% 0.72/1.11  32 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 33 (wt=4) [demod([13])] halfNat(one) = zero.
% 0.72/1.11  33 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 34 (wt=8) [] halfNat(suc(suc(A))) = suc(halfNat(A)).
% 0.72/1.11  34 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 35 (wt=4) [] evenNat(zero) = btrue.
% 0.72/1.11  35 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 36 (wt=4) [demod([13])] evenNat(one) = bfalse.
% 0.72/1.11  36 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 37 (wt=7) [] evenNat(suc(suc(A))) = evenNat(A).
% 0.72/1.11  37 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 38 (wt=10) [flip(1)] aux2(A,B,lt(B,A)) = enumFromToNat(A,B).
% 0.72/1.11  38 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 39 (wt=4) [] dodeca(nil4) = nil2.
% 0.72/1.11  39 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 40 (wt=12) [] dodeca(cons4(A,B)) = cons2(pair22(A,suc(A)),dodeca(B)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 41 (wt=12) [flip(40)] cons2(pair22(A,suc(A)),dodeca(B)) = dodeca(cons4(A,B)).
% 0.72/1.11  clause forward subsumed: 0 (wt=12) [flip(41)] dodeca(cons4(A,B)) = cons2(pair22(A,suc(A)),dodeca(B)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 42 (wt=4) [] bin(zero) = nil6.
% 0.72/1.11  42 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 43 (wt=9) [flip(1)] aux3(A,evenNat(suc(A))) = bin(suc(A)).
% 0.72/1.11  43 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 44 (wt=4) [] bgraph(nil2) = nil.
% 0.72/1.11  44 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 45 (wt=15) [] bgraph(cons2(pair22(A,B),C)) = cons(pair2(bin(A),bin(B)),bgraph(C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 46 (wt=15) [flip(45)] cons(pair2(bin(A),bin(B)),bgraph(C)) = bgraph(cons2(pair22(A,B),C)).
% 0.72/1.11  clause forward subsumed: 0 (wt=15) [flip(46)] bgraph(cons2(pair22(A,B),C)) = cons(pair2(bin(A),bin(B)),bgraph(C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 47 (wt=5) [] beq(nil6,nil6) = btrue.
% 0.72/1.11  47 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 48 (wt=7) [] beq(nil6,cons6(A,B)) = bfalse.
% 0.72/1.11  48 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 49 (wt=7) [] beq(cons6(i,A),nil6) = bfalse.
% 0.72/1.11  49 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 50 (wt=11) [] beq(cons6(i,A),cons6(i,B)) = beq(A,B).
% 0.72/1.11  50 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 51 (wt=9) [] beq(cons6(i,A),cons6(o,B)) = bfalse.
% 0.72/1.11  51 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 52 (wt=7) [] beq(cons6(o,A),nil6) = bfalse.
% 0.72/1.11  52 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 53 (wt=9) [] beq(cons6(o,A),cons6(i,B)) = bfalse.
% 0.72/1.11  53 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 54 (wt=11) [] beq(cons6(o,A),cons6(o,B)) = beq(A,B).
% 0.72/1.11  54 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 55 (wt=5) [] belem(A,nil3) = nil5.
% 0.72/1.11  55 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 56 (wt=13) [flip(1)] cons5(beq(A,B),belem(A,C)) = belem(A,cons3(B,C)).
% 0.72/1.11  56 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 57 (wt=8) [flip(1)] or2(belem(A,B)) = belem2(A,B).
% 0.72/1.11  57 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 58 (wt=5) [] append(nil2,A) = A.
% 0.72/1.11  58 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 59 (wt=11) [flip(1)] cons2(A,append(B,C)) = append(cons2(A,B),C).
% 0.72/1.11  59 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 60 (wt=5) [] andb(btrue,A) = A.
% 0.72/1.11  60 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 61 (wt=5) [] andb(bfalse,A) = bfalse.
% 0.72/1.11  61 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 62 (wt=6) [] bpath(A,B,nil) = nil5.
% 0.72/1.11  62 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 63 (wt=29) [] bpath(A,B,cons(pair2(C,D),E)) = cons5(orb(andb(beq(C,A),beq(D,B)),andb(beq(C,B),beq(D,A))),bpath(A,B,E)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 64 (wt=29) [flip(63)] cons5(orb(andb(beq(A,B),beq(C,D)),andb(beq(A,D),beq(C,B))),bpath(B,D,E)) = bpath(B,D,cons(pair2(A,C),E)).
% 0.72/1.11  clause forward subsumed: 0 (wt=29) [flip(64)] bpath(B,D,cons(pair2(A,C),E)) = cons5(orb(andb(beq(A,B),beq(C,D)),andb(beq(A,D),beq(C,B))),bpath(B,D,E)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 65 (wt=5) [] bpath2(nil3,A) = btrue.
% 0.72/1.11  65 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 66 (wt=7) [] bpath2(cons3(A,nil3),B) = btrue.
% 0.72/1.11  66 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 67 (wt=19) [] bpath2(cons3(A,cons3(B,C)),D) = andb(or2(bpath(A,B,D)),bpath2(cons3(B,C),D)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 68 (wt=19) [flip(67)] andb(or2(bpath(A,B,C)),bpath2(cons3(B,D),C)) = bpath2(cons3(A,cons3(B,D)),C).
% 0.72/1.11  clause forward subsumed: 0 (wt=19) [flip(68)] bpath2(cons3(A,cons3(B,D)),C) = andb(or2(bpath(A,B,C)),bpath2(cons3(B,D),C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 69 (wt=4) [] bunique(nil3) = btrue.
% 0.72/1.11  69 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 70 (wt=12) [flip(1)] andb(notb(belem2(A,B)),bunique(B)) = bunique(cons3(A,B)).
% 0.72/1.11  70 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 71 (wt=5) [] add(zero,A) = A.
% 0.72/1.11  71 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 72 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B).
% 0.72/1.11  72 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 73 (wt=5) [] btour(nil3,nil2) = btrue.
% 0.72/1.11  73 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 74 (wt=7) [] btour(nil3,cons2(A,B)) = bfalse.
% 0.72/1.11  74 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 75 (wt=7) [] btour(cons3(A,B),nil2) = bfalse.
% 0.72/1.11  75 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 76 (wt=45) [demod([22])] btour(cons3(A,B),cons2(pair22(C,D),E)) = andb(beq(A,last(A,B)),andb(bpath2(cons3(A,B),bgraph(cons2(pair22(C,D),E))),andb(bunique(B),eq(len(cons3(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 77 (wt=45) [flip(76)] andb(beq(A,last(A,B)),andb(bpath2(cons3(A,B),bgraph(cons2(pair22(C,D),E))),andb(bunique(B),eq(len(cons3(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))) = btour(cons3(A,B),cons2(pair22(C,D),E)).
% 0.72/1.11  clause forward subsumed: 0 (wt=45) [flip(77)] btour(cons3(A,B),cons2(pair22(C,D),E)) = andb(beq(A,last(A,B)),andb(bpath2(cons3(A,B),bgraph(cons2(pair22(C,D),E))),andb(bunique(B),eq(len(cons3(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 78 (wt=5) [] dodeca2(A,nil4) = nil2.
% 0.72/1.11  78 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 79 (wt=16) [] dodeca2(A,cons4(B,C)) = cons2(pair22(B,add(suc(A),B)),dodeca2(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 80 (wt=16) [flip(79)] cons2(pair22(A,add(suc(B),A)),dodeca2(B,C)) = dodeca2(B,cons4(A,C)).
% 0.72/1.11  clause forward subsumed: 0 (wt=16) [flip(80)] dodeca2(B,cons4(A,C)) = cons2(pair22(A,add(suc(B),A)),dodeca2(B,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 81 (wt=5) [] dodeca3(A,nil4) = nil2.
% 0.72/1.11  81 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 82 (wt=22) [] dodeca3(A,cons4(B,C)) = cons2(pair22(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 83 (wt=22) [flip(82)] cons2(pair22(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)) = dodeca3(A,cons4(B,C)).
% 0.72/1.11  clause forward subsumed: 0 (wt=22) [flip(83)] dodeca3(A,cons4(B,C)) = cons2(pair22(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 84 (wt=5) [] dodeca4(A,nil4) = nil2.
% 0.72/1.11  84 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 85 (wt=23) [] dodeca4(A,cons4(B,C)) = cons2(pair22(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 86 (wt=23) [flip(85)] cons2(pair22(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)) = dodeca4(A,cons4(B,C)).
% 0.72/1.11  clause forward subsumed: 0 (wt=23) [flip(86)] dodeca4(A,cons4(B,C)) = cons2(pair22(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 87 (wt=5) [] dodeca5(A,nil4) = nil2.
% 0.72/1.11  87 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 88 (wt=28) [] dodeca5(A,cons4(B,C)) = cons2(pair22(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 89 (wt=28) [flip(88)] cons2(pair22(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)) = dodeca5(A,cons4(B,C)).
% 0.72/1.11  clause forward subsumed: 0 (wt=28) [flip(89)] dodeca5(A,cons4(B,C)) = cons2(pair22(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 90 (wt=5) [] dodeca6(A,nil4) = nil2.
% 0.72/1.11  90 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 91 (wt=32) [] dodeca6(A,cons4(B,C)) = cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),suc(B))),dodeca6(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 92 (wt=32) [flip(91)] cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),suc(B))),dodeca6(A,C)) = dodeca6(A,cons4(B,C)).
% 0.72/1.11  clause forward subsumed: 0 (wt=32) [flip(92)] dodeca6(A,cons4(B,C)) = cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),suc(B))),dodeca6(A,C)).
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 93 (wt=4) [] dodeca7(zero) = nil2.
% 0.72/1.11  93 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 94 (wt=78) [] dodeca7(suc(A)) = append(cons2(pair22(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons2(pair22(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),A),add(add(add(suc(A),suc(A)),suc(A)),zero)),dodeca6(A,enumFromToNat(zero,A)))))))).
% 0.72/1.11  94 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 95 (wt=8) [] prop_bt3(A) = notb(btour(A,dodeca7(three))).
% 0.72/1.11  95 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 96 (wt=5) [] eq2(bfalse,btrue) = bfalse.
% 0.72/1.11  96 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 97 (wt=5) [] eq2(btrue,bfalse) = bfalse.
% 0.72/1.11  97 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 98 (wt=5) [] eq3(i,o) = bfalse.
% 0.72/1.11  98 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 99 (wt=5) [] eq3(o,i) = bfalse.
% 0.72/1.11  99 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 100 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B).
% 0.72/1.11  100 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 101 (wt=6) [] eq(zero,suc(A)) = bfalse.
% 0.72/1.11  101 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 102 (wt=6) [] eq(suc(A),zero) = bfalse.
% 0.72/1.11  102 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 103 (wt=5) [] eq(A,A) = btrue.
% 0.72/1.11  103 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 104 (wt=5) [] eq2(A,A) = btrue.
% 0.72/1.11  104 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 105 (wt=5) [] eq3(A,A) = btrue.
% 0.72/1.11  105 is a new demodulator.
% 0.72/1.11  
% 0.72/1.11  ** KEPT: 106 (wt=9) [demod([95])] -(eq2(notb(btour(A,dodeca7(three))),bfalse) = btrue).
% 0.72/1.11  
% 0.72/1.11  After processing input:
% 0.72/1.11  
% 0.72/1.11  Usable:
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Sos:
% 0.72/1.11  7 (wt=4) [] predNat(zero) = zero.
% 0.72/1.11  11 (wt=4) [] or2(nil5) = bfalse.
% 0.72/1.11  13 (wt=4) [flip(1)] suc(zero) = one.
% 0.72/1.11  14 (wt=4) [flip(1)] suc(one) = two.
% 0.72/1.11  15 (wt=4) [flip(1)] suc(two) = three.
% 0.72/1.11  16 (wt=4) [] notb(btrue) = bfalse.
% 0.72/1.11  17 (wt=4) [] notb(bfalse) = btrue.
% 0.72/1.11  26 (wt=4) [] len(nil3) = zero.
% 0.72/1.11  32 (wt=4) [] halfNat(zero) = zero.
% 0.72/1.11  33 (wt=4) [demod([13])] halfNat(one) = zero.
% 0.72/1.11  35 (wt=4) [] evenNat(zero) = btrue.
% 0.72/1.11  36 (wt=4) [demod([13])] evenNat(one) = bfalse.
% 0.72/1.11  39 (wt=4) [] dodeca(nil4) = nil2.
% 0.72/1.11  42 (wt=4) [] bin(zero) = nil6.
% 0.72/1.11  44 (wt=4) [] bgraph(nil2) = nil.
% 0.72/1.11  69 (wt=4) [] bunique(nil3) = btrue.
% 0.72/1.11  93 (wt=4) [] dodeca7(zero) = nil2.
% 0.72/1.11  8 (wt=5) [] predNat(suc(A)) = A.
% 0.72/1.11  9 (wt=5) [] orb(btrue,A) = btrue.
% 0.72/1.11  10 (wt=5) [] orb(bfalse,A) = A.
% 0.72/1.11  18 (wt=5) [] lt(zero,zero) = bfalse.
% 0.72/1.11  23 (wt=5) [] maximum(A,nil2) = A.
% 0.72/1.11  29 (wt=5) [] last(A,nil3) = A.
% 0.72/1.11  47 (wt=5) [] beq(nil6,nil6) = btrue.
% 0.72/1.11  55 (wt=5) [] belem(A,nil3) = nil5.
% 0.72/1.11  58 (wt=5) [] append(nil2,A) = A.
% 0.72/1.11  60 (wt=5) [] andb(btrue,A) = A.
% 0.72/1.11  61 (wt=5) [] andb(bfalse,A) = bfalse.
% 0.72/1.11  65 (wt=5) [] bpath2(nil3,A) = btrue.
% 0.72/1.11  71 (wt=5) [] add(zero,A) = A.
% 0.72/1.11  73 (wt=5) [] btour(nil3,nil2) = btrue.
% 0.72/1.11  78 (wt=5) [] dodeca2(A,nil4) = nil2.
% 0.72/1.11  81 (wt=5) [] dodeca3(A,nil4) = nil2.
% 0.72/1.11  84 (wt=5) [] dodeca4(A,nil4) = nil2.
% 0.72/1.11  87 (wt=5) [] dodeca5(A,nil4) = nil2.
% 0.72/1.11  90 (wt=5) [] dodeca6(A,nil4) = nil2.
% 0.72/1.11  96 (wt=5) [] eq2(bfalse,btrue) = bfalse.
% 0.72/1.11  97 (wt=5) [] eq2(btrue,bfalse) = bfalse.
% 0.72/1.11  98 (wt=5) [] eq3(i,o) = bfalse.
% 0.72/1.11  99 (wt=5) [] eq3(o,i) = bfalse.
% 0.72/1.11  103 (wt=5) [] eq(A,A) = btrue.
% 0.72/1.11  104 (wt=5) [] eq2(A,A) = btrue.
% 0.72/1.11  105 (wt=5) [] eq3(A,A) = btrue.
% 0.72/1.11  1 (wt=6) [] aux(A,B,btrue) = B.
% 0.72/1.11  2 (wt=6) [] aux(A,B,bfalse) = A.
% 0.72/1.11  3 (wt=6) [] aux2(A,B,btrue) = nil4.
% 0.72/1.11  19 (wt=6) [] lt(zero,suc(A)) = btrue.
% 0.72/1.11  20 (wt=6) [] lt(suc(A),zero) = bfalse.
% 0.72/1.11  62 (wt=6) [] bpath(A,B,nil) = nil5.
% 0.72/1.11  101 (wt=6) [] eq(zero,suc(A)) = bfalse.
% 0.72/1.11  102 (wt=6) [] eq(suc(A),zero) = bfalse.
% 0.72/1.11  37 (wt=7) [] evenNat(suc(suc(A))) = evenNat(A).
% 0.72/1.11  48 (wt=7) [] beq(nil6,cons6(A,B)) = bfalse.
% 0.72/1.11  49 (wt=7) [] beq(cons6(i,A),nil6) = bfalse.
% 0.72/1.11  52 (wt=7) [] beq(cons6(o,A),nil6) = bfalse.
% 0.72/1.11  66 (wt=7) [] bpath2(cons3(A,nil3),B) = btrue.
% 0.72/1.11  74 (wt=7) [] btour(nil3,cons2(A,B)) = bfalse.
% 0.72/1.11  75 (wt=7) [] btour(cons3(A,B),nil2) = bfalse.
% 0.72/1.11  27 (wt=8) [] len(cons3(A,B)) = suc(len(B)).
% 0.72/1.11  28 (wt=8) [flip(27)] suc(len(A)) = len(cons3(B,A)).
% 0.72/1.11  34 (wt=8) [] halfNat(suc(suc(A))) = suc(halfNat(A)).
% 0.72/1.11  57 (wt=8) [flip(1)] or2(belem(A,B)) = belem2(A,B).
% 0.72/1.11  95 (wt=8) [] prop_bt3(A) = notb(btour(A,dodeca7(three))).
% 0.72/1.11  12 (wt=9) [] or2(cons5(A,B)) = orb(A,or2(B)).
% 0.72/1.11  21 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B).
% 0.72/1.11  30 (wt=9) [] last(A,cons3(B,C)) = last(B,C).
% 0.72/1.11  31 (wt=9) [flip(30)] last(A,B) = last(C,cons3(A,B)).
% 0.72/1.11  43 (wt=9) [flip(1)] aux3(A,evenNat(suc(A))) = bin(suc(A)).
% 0.72/1.11  51 (wt=9) [] beq(cons6(i,A),cons6(o,B)) = bfalse.
% 0.72/1.11  53 (wt=9) [] beq(cons6(o,A),cons6(i,B)) = bfalse.
% 0.72/1.11  72 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B).
% 0.72/1.11  100 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B).
% 0.72/1.11  106 (wt=9) [demod([95])] -(eq2(notb(btour(A,dodeca7(three))),bfalse) = btrue).
% 0.72/1.11  5 (wt=10) [flip(1)] cons6(o,bin(halfNat(suc(A)))) = aux3(A,btrue).
% 0.72/1.11  6 (wt=10) [flip(1)] cons6(i,bin(halfNat(suc(A)))) = aux3(A,bfalse).
% 0.72/1.11  22 (wt=10) [] maxNat(A,B) = aux(A,B,lt(A,B)).
% 0.72/1.11  38 (wt=10) [flip(1)] aux2(A,B,lt(B,A)) = enumFromToNat(A,B).
% 0.72/1.11  4 (wt=11) [flip(1)] cons4(A,enumFromToNat(suc(A),B)) = aux2(A,B,bfalse).
% 0.72/1.11  50 (wt=11) [] beq(cons6(i,A),cons6(i,B)) = beq(A,B).
% 0.72/1.11  54 (wt=11) [] beq(cons6(o,A),cons6(o,B)) = beq(A,B).
% 0.72/1.11  59 (wt=11) [flip(1)] cons2(A,append(B,C)) = append(cons2(A,B),C).
% 0.72/1.11  40 (wt=12) [] dodeca(cons4(A,B)) = cons2(pair22(A,suc(A)),dodeca(B)).
% 0.72/1.11  41 (wt=12) [flip(40)] cons2(pair22(A,suc(A)),dodeca(B)) = dodeca(cons4(A,B)).
% 0.72/1.11  70 (wt=12) [flip(1)] andb(notb(belem2(A,B)),bunique(B)) = bunique(cons3(A,B)).
% 0.72/1.11  56 (wt=13) [flip(1)] cons5(beq(A,B),belem(A,C)) = belem(A,cons3(B,C)).
% 0.72/1.11  45 (wt=15) [] bgraph(cons2(pair22(A,B),C)) = cons(pair2(bin(A),bin(B)),bgraph(C)).
% 0.72/1.11  46 (wt=15) [flip(45)] cons(pair2(bin(A),bin(B)),bgraph(C)) = bgraph(cons2(pair22(A,B),C)).
% 0.72/1.11  79 (wt=16) [] dodeca2(A,cons4(B,C)) = cons2(pair22(B,add(suc(A),B)),dodeca2(A,C)).
% 0.72/1.11  80 (wt=16) [flip(79)] cons2(pair22(A,add(suc(B),A)),dodeca2(B,C)) = dodeca2(B,cons4(A,C)).
% 0.72/1.11  67 (wt=19) [] bpath2(cons3(A,cons3(B,C)),D) = andb(or2(bpath(A,B,D)),bpath2(cons3(B,C),D)).
% 0.72/1.11  68 (wt=19) [flip(67)] andb(or2(bpath(A,B,C)),bpath2(cons3(B,D),C)) = bpath2(cons3(A,cons3(B,D)),C).
% 0.72/1.11  82 (wt=22) [] dodeca3(A,cons4(B,C)) = cons2(pair22(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)).
% 0.72/1.11  83 (wt=22) [flip(82)] cons2(pair22(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)) = dodeca3(A,cons4(B,C)).
% 0.72/1.11  85 (wt=23) [] dodeca4(A,cons4(B,C)) = cons2(pair22(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)).
% 0.72/1.11  86 (wt=23) [flip(85)] cons2(pair22(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)) = dodeca4(A,cons4(B,C)).
% 0.72/1.11  24 (wt=26) [demod([22,22])] maximum(A,cons2(pair22(B,C),D)) = maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D).
% 0.72/1.11  25 (wt=26) [flip(24)] maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D) = maximum(A,cons2(pair22(B,C),D)).
% 0.72/1.11  88 (wt=28) [] dodeca5(A,cons4(B,C)) = cons2(pair22(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)).
% 0.72/1.11  89 (wt=28) [flip(88)] cons2(pair22(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)) = dodeca5(A,cons4(B,C)).
% 0.72/1.11  63 (wt=29) [] bpath(A,B,cons(pair2(C,D),E)) = cons5(orb(andb(beq(C,A),beq(D,B)),andb(beq(C,B),beq(D,A))),bpath(A,B,E)).
% 0.72/1.11  64 (wt=29) [flip(63)] cons5(orb(andb(beq(A,B),beq(C,D)),andb(beq(A,D),beq(C,B))),bpath(B,D,E)) = bpath(B,D,cons(pair2(A,C),E)).
% 0.72/1.11  91 (wt=32) [] dodeca6(A,cons4(B,C)) = cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),suc(B))),dodeca6(A,C)).
% 0.72/1.11  92 (wt=32) [flip(91)] cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),suc(B))),dodeca6(A,C)) = dodeca6(A,cons4(B,C)).
% 0.72/1.11  76 (wt=45) [demod([22])] btour(cons3(A,B),cons2(pair22(C,D),E)) = andb(beq(A,last(A,B)),andb(bpath2(cons3(A,B),bgraph(cons2(pair22(C,D),E))),andb(bunique(B),eq(len(cons3(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))).
% 0.72/1.11  77 (wt=45) [flip(76)] andb(beq(A,last(A,B)),andb(bpath2(cons3(A,B),bgraph(cons2(pair22(C,D),E))),andb(bunique(B),eq(len(cons3(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))) = btour(cons3(A,B),cons2(pair22(C,D),E)).
% 0.72/1.11  94 (wt=78) [] dodeca7(suc(A)) = append(cons2(pair22(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons2(pair22(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),A),add(add(add(suc(A),suc(A)),suc(A)),zero)),dodeca6(A,enumFromToNat(zero,A)))))))).
% 0.72/1.11  end_of_list.
% 0.72/1.11  
% 0.72/1.11  Demodulators:
% 0.72/1.11  1 (wt=6) [] aux(A,B,btrue) = B.
% 0.72/1.11  2 (wt=6) [] aux(A,B,bfalse) = A.
% 0.72/1.11  3 (wt=6) [] aux2(A,B,btrue) = nil4.
% 0.72/1.11  4 (wt=11) [flip(1)] cons4(A,enumFromToNat(suc(A),B)) = aux2(A,B,bfalse).
% 0.72/1.11  5 (wt=10) [flip(1)] cons6(o,bin(halfNat(suc(A)))) = aux3(A,btrue).
% 0.72/1.11  6 (wt=10) [flip(1)] cons6(i,bin(halfNat(suc(A)))) = aux3(A,bfalse).
% 0.72/1.11  7 (wt=4) [] predNat(zero) = zero.
% 0.72/1.11  8 (wt=5) [] predNat(suc(A)) = A.
% 0.72/1.11  9 (wt=5) [] orb(btrue,A) = btrue.
% 0.72/1.11  10 (wt=5) [] orb(bfalse,A) = A.
% 0.72/1.11  11 (wt=4) [] or2(nil5) = bfalse.
% 0.72/1.11  12 (wt=9) [] or2(cons5(A,B)) = orb(A,or2(B)).
% 0.72/1.11  13 (wt=4) [flip(1)] suc(zero) = one.
% 0.72/1.11  14 (wt=4) [flip(1)] suc(one) = two.
% 0.72/1.11  15 (wt=4) [flip(1)] suc(two) = three.
% 0.72/1.11  16 (wt=4) [] notb(btrue) = bfalse.
% 0.72/1.11  17 (wt=4) [] notb(bfalse) = btrue.
% 0.72/1.11  18 (wt=5) [] lt(zero,zero) = bfalse.
% 0.72/1.11  19 (wt=6) [] lt(zero,suc(A)) = btrue.
% 0.72/1.11  20 (wt=6) [] lt(suc(A),zero) = bfalse.
% 0.72/1.11  21 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B).
% 0.72/1.11  22 (wt=10) [] maxNat(A,B) = aux(A,B,lt(A,B)).
% 0.72/1.11  23 (wt=5) [] maximum(A,nil2) = A.
% 0.72/1.11  26 (wt=4) [] len(nil3) = zero.
% 7.13/7.52  29 (wt=5) [] last(A,nil3) = A.
% 7.13/7.52  32 (wt=4) [] halfNat(zero) = zero.
% 7.13/7.52  33 (wt=4) [demod([13])] halfNat(one) = zero.
% 7.13/7.52  34 (wt=8) [] halfNat(suc(suc(A))) = suc(halfNat(A)).
% 7.13/7.52  35 (wt=4) [] evenNat(zero) = btrue.
% 7.13/7.52  36 (wt=4) [demod([13])] evenNat(one) = bfalse.
% 7.13/7.52  37 (wt=7) [] evenNat(suc(suc(A))) = evenNat(A).
% 7.13/7.52  38 (wt=10) [flip(1)] aux2(A,B,lt(B,A)) = enumFromToNat(A,B).
% 7.13/7.52  39 (wt=4) [] dodeca(nil4) = nil2.
% 7.13/7.52  42 (wt=4) [] bin(zero) = nil6.
% 7.13/7.52  43 (wt=9) [flip(1)] aux3(A,evenNat(suc(A))) = bin(suc(A)).
% 7.13/7.52  44 (wt=4) [] bgraph(nil2) = nil.
% 7.13/7.52  47 (wt=5) [] beq(nil6,nil6) = btrue.
% 7.13/7.52  48 (wt=7) [] beq(nil6,cons6(A,B)) = bfalse.
% 7.13/7.52  49 (wt=7) [] beq(cons6(i,A),nil6) = bfalse.
% 7.13/7.52  50 (wt=11) [] beq(cons6(i,A),cons6(i,B)) = beq(A,B).
% 7.13/7.52  51 (wt=9) [] beq(cons6(i,A),cons6(o,B)) = bfalse.
% 7.13/7.52  52 (wt=7) [] beq(cons6(o,A),nil6) = bfalse.
% 7.13/7.52  53 (wt=9) [] beq(cons6(o,A),cons6(i,B)) = bfalse.
% 7.13/7.52  54 (wt=11) [] beq(cons6(o,A),cons6(o,B)) = beq(A,B).
% 7.13/7.52  55 (wt=5) [] belem(A,nil3) = nil5.
% 7.13/7.52  56 (wt=13) [flip(1)] cons5(beq(A,B),belem(A,C)) = belem(A,cons3(B,C)).
% 7.13/7.52  57 (wt=8) [flip(1)] or2(belem(A,B)) = belem2(A,B).
% 7.13/7.52  58 (wt=5) [] append(nil2,A) = A.
% 7.13/7.52  59 (wt=11) [flip(1)] cons2(A,append(B,C)) = append(cons2(A,B),C).
% 7.13/7.52  60 (wt=5) [] andb(btrue,A) = A.
% 7.13/7.52  61 (wt=5) [] andb(bfalse,A) = bfalse.
% 7.13/7.52  62 (wt=6) [] bpath(A,B,nil) = nil5.
% 7.13/7.52  65 (wt=5) [] bpath2(nil3,A) = btrue.
% 7.13/7.52  66 (wt=7) [] bpath2(cons3(A,nil3),B) = btrue.
% 7.13/7.52  69 (wt=4) [] bunique(nil3) = btrue.
% 7.13/7.52  70 (wt=12) [flip(1)] andb(notb(belem2(A,B)),bunique(B)) = bunique(cons3(A,B)).
% 7.13/7.52  71 (wt=5) [] add(zero,A) = A.
% 7.13/7.52  72 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B).
% 7.13/7.52  73 (wt=5) [] btour(nil3,nil2) = btrue.
% 7.13/7.52  74 (wt=7) [] btour(nil3,cons2(A,B)) = bfalse.
% 7.13/7.52  75 (wt=7) [] btour(cons3(A,B),nil2) = bfalse.
% 7.13/7.52  78 (wt=5) [] dodeca2(A,nil4) = nil2.
% 7.13/7.52  81 (wt=5) [] dodeca3(A,nil4) = nil2.
% 7.13/7.52  84 (wt=5) [] dodeca4(A,nil4) = nil2.
% 7.13/7.52  87 (wt=5) [] dodeca5(A,nil4) = nil2.
% 7.13/7.52  90 (wt=5) [] dodeca6(A,nil4) = nil2.
% 7.13/7.52  93 (wt=4) [] dodeca7(zero) = nil2.
% 7.13/7.52  94 (wt=78) [] dodeca7(suc(A)) = append(cons2(pair22(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons2(pair22(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons2(pair22(add(add(add(suc(A),suc(A)),suc(A)),A),add(add(add(suc(A),suc(A)),suc(A)),zero)),dodeca6(A,enumFromToNat(zero,A)))))))).
% 7.13/7.52  95 (wt=8) [] prop_bt3(A) = notb(btour(A,dodeca7(three))).
% 7.13/7.52  96 (wt=5) [] eq2(bfalse,btrue) = bfalse.
% 7.13/7.52  97 (wt=5) [] eq2(btrue,bfalse) = bfalse.
% 7.13/7.52  98 (wt=5) [] eq3(i,o) = bfalse.
% 7.13/7.52  99 (wt=5) [] eq3(o,i) = bfalse.
% 7.13/7.52  100 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B).
% 7.13/7.52  101 (wt=6) [] eq(zero,suc(A)) = bfalse.
% 7.13/7.52  102 (wt=6) [] eq(suc(A),zero) = bfalse.
% 7.13/7.52  103 (wt=5) [] eq(A,A) = btrue.
% 7.13/7.52  104 (wt=5) [] eq2(A,A) = btrue.
% 7.13/7.52  105 (wt=5) [] eq3(A,A) = btrue.
% 7.13/7.52  end_of_list.
% 7.13/7.52  
% 7.13/7.52  Passive:
% 7.13/7.52  end_of_list.
% 7.13/7.52  
% 7.13/7.52  ------------- memory usage ------------
% 7.13/7.52  Memory dynamically allocated (tp_alloc): 63964.
% 7.13/7.52    type (bytes each)        gets      frees     in use      avail      bytes
% 7.13/7.52  sym_ent (  96)              126          0        126          0     11.8 K
% 7.13/7.52  term (  16)             2107153    1217200     889953        297  17313.6 K
% 7.13/7.52  gen_ptr (   8)          4892972     140178    4752794          0  37131.2 K
% 7.13/7.52  context ( 808)         10721422   10721419          3          7      7.9 K
% 7.13/7.52  trail (  12)               6898       6898          0         15      0.2 K
% 7.13/7.52  bt_node (  68)          4907824    4907815          9        219     15.1 K
% 7.13/7.52  ac_position (285432)          0          0          0          0      0.0 K
% 7.13/7.52  ac_match_pos (14044)          0          0          0          0      0.0 K
% 7.13/7.52  ac_match_free_vars_pos (4020)
% 7.13/7.52                                0          0          0          0      0.0 K
% 7.13/7.52  discrim (  12)           582425      22202     560223          0   6565.1 K
% 7.13/7.52  flat (  40)             4840598    4840598          0       3864    150.9 K
% 7.13/7.52  discrim_pos (  12)        51981      51981          0          1      0.0 K
% 7.13/7.52  fpa_head (  12)           30553          0      30553          0    358.0 K
% 7.13/7.52  fpa_tree (  28)           16692      16692          0         49      1.3 K
% 7.13/7.52  fpa_pos (  36)            21331      21331          0          1      0.0 K
% 7.13/7.52  literal (  12)            73239      54266      18973          1    222.4 K
% 7.13/7.52  clause (  24)             73239      54266      18973          1    444.7 K
% 7.13/7.52  list (  12)                2418       2362         56          4      0.7 K
% 7.13/7.52  list_pos (  20)           62343       6686      55657          0   1087.1 K
% 7.13/7.52  pair_index (   40)              2          0          2          0      0.1 K
% 7.13/7.52  
% 7.13/7.52  -------------- statistics -------------
% 7.13/7.52  Clauses input                 93
% 7.13/7.52    Usable input                   0
% 7.13/7.52    S
% 7.13/7.52  
% 7.13/7.52  ********** ABNORMAL END **********
% 7.13/7.52  ********** in tp_alloc, max_mem parameter exceeded.
% 7.13/7.52  os input                     93
% 7.13/7.52    Demodulators input             0
% 7.13/7.52    Passive input                  0
% 7.13/7.52  
% 7.13/7.52  Processed BS (before search) 119
% 7.13/7.52  Forward subsumed BS           13
% 7.13/7.52  Kept BS                      106
% 7.13/7.52  New demodulators BS           79
% 7.13/7.52  Back demodulated BS            0
% 7.13/7.52  
% 7.13/7.52  Clauses or pairs given    716905
% 7.13/7.52  Clauses generated          38206
% 7.13/7.52  Forward subsumed           19339
% 7.13/7.52  Deleted by weight              0
% 7.13/7.52  Deleted by variable count      0
% 7.13/7.52  Kept                       18866
% 7.13/7.52  New demodulators            2280
% 7.13/7.52  Back demodulated            1453
% 7.13/7.52  Ordered paramod prunes         0
% 7.13/7.52  Basic paramod prunes     3250950
% 7.13/7.52  Prime paramod prunes          12
% 7.13/7.52  Semantic prunes                0
% 7.13/7.52  
% 7.13/7.52  Rewrite attmepts         1227277
% 7.13/7.52  Rewrites                   38309
% 7.13/7.52  
% 7.13/7.52  FPA overloads                  0
% 7.13/7.52  FPA underloads                 0
% 7.13/7.52  
% 7.13/7.52  Usable size                    0
% 7.13/7.52  Sos size                   17519
% 7.13/7.52  Demodulators size           1647
% 7.13/7.52  Passive size                   0
% 7.13/7.52  Disabled size               1453
% 7.13/7.52  
% 7.13/7.52  Proofs found                   0
% 7.13/7.52  
% 7.13/7.52  ----------- times (seconds) ----------- Tue May  5 12:57:37 2026
% 7.13/7.52  
% 7.13/7.52  user CPU time             4.25   (0 hr, 0 min, 4 sec)
% 7.13/7.52  system CPU time           2.16   (0 hr, 0 min, 2 sec)
% 7.13/7.52  wall-clock time           6      (0 hr, 0 min, 6 sec)
% 7.13/7.52  input time                0.00
% 7.13/7.52  paramodulation time       0.61
% 7.13/7.52  demodulation time         0.17
% 7.13/7.52  orient time               0.09
% 7.13/7.52  weigh time                0.02
% 7.13/7.52  forward subsume time      0.07
% 7.13/7.52  back demod find time      0.03
% 7.13/7.52  conflict time             0.01
% 7.13/7.52  LRPO time                 0.07
% 7.13/7.52  store clause time         2.46
% 7.13/7.52  disable clause time       0.10
% 7.13/7.52  prime paramod time        0.01
% 7.13/7.52  semantics time            0.00
% 7.13/7.52  
% 7.13/7.52  EQP interrupted
%------------------------------------------------------------------------------