%------------------------------------------------------------------------------ % File : EQP---0.9e % Problem : SWX232-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_eqp %s % Computer : n001.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 4.53s 4.94s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX232-1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : tptp2X_and_run_eqp %s % 0.15/0.34 % Computer : n001.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue May 5 13:04:48 EDT 2026 % 0.15/0.34 % CPUTime : % 0.72/1.11 ----- EQP 0.9e, May 2009 ----- % 0.72/1.11 The job began on n001.cluster.edu, Tue May 5 13:04:49 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) = nil2. % 0.72/1.11 0 (wt=-1) [] aux2(A,B,bfalse) = cons2(A,enumFromToNat(suc(A),B)). % 0.72/1.11 0 (wt=-1) [] aux3(A,B,btrue) = bfalse. % 0.72/1.11 0 (wt=-1) [] aux3(A,B,bfalse) = unique(B). % 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(nil3) = bfalse. % 0.72/1.11 0 (wt=-1) [] or2(cons3(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,nil) = A. % 0.72/1.11 0 (wt=-1) [] maximum(A,cons(pair2(B,C),D)) = maximum(maxNat(A,maxNat(B,C)),D). % 0.72/1.11 0 (wt=-1) [] len(nil2) = zero. % 0.72/1.11 0 (wt=-1) [] len(cons2(A,B)) = suc(len(B)). % 0.72/1.11 0 (wt=-1) [] last(A,nil2) = A. % 0.72/1.11 0 (wt=-1) [] last(A,cons2(B,C)) = last(B,C). % 0.72/1.11 0 (wt=-1) [] enumFromToNat(A,B) = aux2(A,B,lt(B,A)). % 0.72/1.11 0 (wt=-1) [] elem(A,nil2) = bfalse. % 0.72/1.11 0 (wt=-1) [] elem(A,cons2(B,C)) = orb(eq(B,A),elem(A,C)). % 0.72/1.11 0 (wt=-1) [] unique(nil2) = btrue. % 0.72/1.11 0 (wt=-1) [] unique(cons2(A,B)) = aux3(A,B,elem(A,B)). % 0.72/1.11 0 (wt=-1) [] dodeca(nil2) = nil. % 0.72/1.11 0 (wt=-1) [] dodeca(cons2(A,B)) = cons(pair2(A,suc(A)),dodeca(B)). % 0.72/1.11 0 (wt=-1) [] append(nil,A) = A. % 0.72/1.11 0 (wt=-1) [] append(cons(A,B),C) = cons(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) [] path(A,B,nil) = nil3. % 0.72/1.11 0 (wt=-1) [] path(A,B,cons(pair2(C,D),E)) = cons3(orb(andb(eq(C,A),eq(D,B)),andb(eq(C,B),eq(D,A))),path(A,B,E)). % 0.72/1.11 0 (wt=-1) [] path2(nil2,A) = btrue. % 0.72/1.11 0 (wt=-1) [] path2(cons2(A,nil2),B) = btrue. % 0.72/1.11 0 (wt=-1) [] path2(cons2(A,cons2(B,C)),D) = andb(or2(path(A,B,D)),path2(cons2(B,C),D)). % 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) [] dodeca2(A,nil2) = nil. % 0.72/1.11 0 (wt=-1) [] dodeca2(A,cons2(B,C)) = cons(pair2(B,add(suc(A),B)),dodeca2(A,C)). % 0.72/1.11 0 (wt=-1) [] dodeca3(A,nil2) = nil. % 0.72/1.11 0 (wt=-1) [] dodeca3(A,cons2(B,C)) = cons(pair2(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)). % 0.72/1.11 0 (wt=-1) [] dodeca4(A,nil2) = nil. % 0.72/1.11 0 (wt=-1) [] dodeca4(A,cons2(B,C)) = cons(pair2(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)). % 0.72/1.11 0 (wt=-1) [] dodeca5(A,nil2) = nil. % 0.72/1.11 0 (wt=-1) [] dodeca5(A,cons2(B,C)) = cons(pair2(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,nil2) = nil. % 0.72/1.11 0 (wt=-1) [] dodeca6(A,cons2(B,C)) = cons(pair2(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) = nil. % 0.72/1.11 0 (wt=-1) [] dodeca7(suc(A)) = append(cons(pair2(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons(pair2(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons(pair2(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) [] tour(nil2,nil) = btrue. % 0.72/1.11 0 (wt=-1) [] tour(nil2,cons(A,B)) = bfalse. % 0.72/1.11 0 (wt=-1) [] tour(cons2(A,B),nil) = bfalse. % 0.72/1.11 0 (wt=-1) [] tour(cons2(A,B),cons(pair2(C,D),E)) = andb(eq(A,last(A,B)),andb(path2(cons2(A,B),cons(pair2(C,D),E)),andb(unique(B),eq(len(cons2(A,B)),add(two,maximum(maxNat(C,D),E)))))). % 0.72/1.11 0 (wt=-1) [] prop_t3(A) = notb(tour(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) [] 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) [] -(eq2(prop_t3(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) = nil2. % 0.72/1.11 3 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 4 (wt=11) [flip(1)] cons2(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=6) [] aux3(A,B,btrue) = bfalse. % 0.72/1.11 5 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 6 (wt=7) [] aux3(A,B,bfalse) = unique(B). % 0.72/1.11 % 0.72/1.11 ** KEPT: 7 (wt=7) [flip(6)] unique(A) = aux3(B,A,bfalse). % 0.72/1.11 clause forward subsumed: 0 (wt=7) [flip(7)] aux3(B,A,bfalse) = unique(A). % 0.72/1.11 % 0.72/1.11 ** KEPT: 8 (wt=4) [] predNat(zero) = zero. % 0.72/1.11 8 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 9 (wt=5) [] predNat(suc(A)) = A. % 0.72/1.11 9 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 10 (wt=5) [] orb(btrue,A) = btrue. % 0.72/1.11 10 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 11 (wt=5) [] orb(bfalse,A) = A. % 0.72/1.11 11 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 12 (wt=4) [] or2(nil3) = bfalse. % 0.72/1.11 12 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 13 (wt=9) [] or2(cons3(A,B)) = orb(A,or2(B)). % 0.72/1.11 13 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 14 (wt=4) [flip(1)] suc(zero) = one. % 0.72/1.11 14 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 15 (wt=4) [flip(1)] suc(one) = two. % 0.72/1.11 15 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 16 (wt=4) [flip(1)] suc(two) = three. % 0.72/1.11 16 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 17 (wt=4) [] notb(btrue) = bfalse. % 0.72/1.11 17 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 18 (wt=4) [] notb(bfalse) = btrue. % 0.72/1.11 18 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 19 (wt=5) [] lt(zero,zero) = bfalse. % 0.72/1.11 19 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 20 (wt=6) [] lt(zero,suc(A)) = btrue. % 0.72/1.11 20 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 21 (wt=6) [] lt(suc(A),zero) = bfalse. % 0.72/1.11 21 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 22 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B). % 0.72/1.11 22 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 23 (wt=10) [] maxNat(A,B) = aux(A,B,lt(A,B)). % 0.72/1.11 23 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 24 (wt=5) [] maximum(A,nil) = A. % 0.72/1.11 24 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 25 (wt=26) [demod([23,23])] maximum(A,cons(pair2(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=26) [flip(25)] maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D) = maximum(A,cons(pair2(B,C),D)). % 0.72/1.11 clause forward subsumed: 0 (wt=26) [flip(26)] maximum(A,cons(pair2(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: 27 (wt=4) [] len(nil2) = zero. % 0.72/1.11 27 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 28 (wt=8) [] len(cons2(A,B)) = suc(len(B)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 29 (wt=8) [flip(28)] suc(len(A)) = len(cons2(B,A)). % 0.72/1.11 clause forward subsumed: 0 (wt=8) [flip(29)] len(cons2(B,A)) = suc(len(A)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 30 (wt=5) [] last(A,nil2) = A. % 0.72/1.11 30 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 31 (wt=9) [] last(A,cons2(B,C)) = last(B,C). % 0.72/1.11 % 0.72/1.11 ** KEPT: 32 (wt=9) [flip(31)] last(A,B) = last(C,cons2(A,B)). % 0.72/1.11 clause forward subsumed: 0 (wt=9) [flip(32)] last(C,cons2(A,B)) = last(A,B). % 0.72/1.11 % 0.72/1.11 ** KEPT: 33 (wt=10) [flip(1)] aux2(A,B,lt(B,A)) = enumFromToNat(A,B). % 0.72/1.11 33 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 34 (wt=5) [] elem(A,nil2) = bfalse. % 0.72/1.11 34 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 35 (wt=13) [flip(1)] orb(eq(A,B),elem(B,C)) = elem(B,cons2(A,C)). % 0.72/1.11 35 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 36 (wt=4) [] unique(nil2) = btrue. % 0.72/1.11 36 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 37 (wt=11) [] unique(cons2(A,B)) = aux3(A,B,elem(A,B)). % 0.72/1.11 37 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 38 (wt=4) [] dodeca(nil2) = nil. % 0.72/1.11 38 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 39 (wt=12) [] dodeca(cons2(A,B)) = cons(pair2(A,suc(A)),dodeca(B)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 40 (wt=12) [flip(39)] cons(pair2(A,suc(A)),dodeca(B)) = dodeca(cons2(A,B)). % 0.72/1.11 clause forward subsumed: 0 (wt=12) [flip(40)] dodeca(cons2(A,B)) = cons(pair2(A,suc(A)),dodeca(B)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 41 (wt=5) [] append(nil,A) = A. % 0.72/1.11 41 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 42 (wt=11) [flip(1)] cons(A,append(B,C)) = append(cons(A,B),C). % 0.72/1.11 42 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 43 (wt=5) [] andb(btrue,A) = A. % 0.72/1.11 43 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 44 (wt=5) [] andb(bfalse,A) = bfalse. % 0.72/1.11 44 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 45 (wt=6) [] path(A,B,nil) = nil3. % 0.72/1.11 45 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 46 (wt=29) [] path(A,B,cons(pair2(C,D),E)) = cons3(orb(andb(eq(C,A),eq(D,B)),andb(eq(C,B),eq(D,A))),path(A,B,E)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 47 (wt=29) [flip(46)] cons3(orb(andb(eq(A,B),eq(C,D)),andb(eq(A,D),eq(C,B))),path(B,D,E)) = path(B,D,cons(pair2(A,C),E)). % 0.72/1.11 clause forward subsumed: 0 (wt=29) [flip(47)] path(B,D,cons(pair2(A,C),E)) = cons3(orb(andb(eq(A,B),eq(C,D)),andb(eq(A,D),eq(C,B))),path(B,D,E)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 48 (wt=5) [] path2(nil2,A) = btrue. % 0.72/1.11 48 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 49 (wt=7) [] path2(cons2(A,nil2),B) = btrue. % 0.72/1.11 49 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 50 (wt=19) [] path2(cons2(A,cons2(B,C)),D) = andb(or2(path(A,B,D)),path2(cons2(B,C),D)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 51 (wt=19) [flip(50)] andb(or2(path(A,B,C)),path2(cons2(B,D),C)) = path2(cons2(A,cons2(B,D)),C). % 0.72/1.11 clause forward subsumed: 0 (wt=19) [flip(51)] path2(cons2(A,cons2(B,D)),C) = andb(or2(path(A,B,C)),path2(cons2(B,D),C)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 52 (wt=5) [] add(zero,A) = A. % 0.72/1.11 52 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 53 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B). % 0.72/1.11 53 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 54 (wt=5) [] dodeca2(A,nil2) = nil. % 0.72/1.11 54 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 55 (wt=16) [] dodeca2(A,cons2(B,C)) = cons(pair2(B,add(suc(A),B)),dodeca2(A,C)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 56 (wt=16) [flip(55)] cons(pair2(A,add(suc(B),A)),dodeca2(B,C)) = dodeca2(B,cons2(A,C)). % 0.72/1.11 clause forward subsumed: 0 (wt=16) [flip(56)] dodeca2(B,cons2(A,C)) = cons(pair2(A,add(suc(B),A)),dodeca2(B,C)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 57 (wt=5) [] dodeca3(A,nil2) = nil. % 0.72/1.11 57 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 58 (wt=22) [] dodeca3(A,cons2(B,C)) = cons(pair2(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 59 (wt=22) [flip(58)] cons(pair2(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)) = dodeca3(A,cons2(B,C)). % 0.72/1.11 clause forward subsumed: 0 (wt=22) [flip(59)] dodeca3(A,cons2(B,C)) = cons(pair2(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 60 (wt=5) [] dodeca4(A,nil2) = nil. % 0.72/1.11 60 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 61 (wt=23) [] dodeca4(A,cons2(B,C)) = cons(pair2(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 62 (wt=23) [flip(61)] cons(pair2(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)) = dodeca4(A,cons2(B,C)). % 0.72/1.11 clause forward subsumed: 0 (wt=23) [flip(62)] dodeca4(A,cons2(B,C)) = cons(pair2(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)). % 0.72/1.11 % 0.72/1.11 ** KEPT: 63 (wt=5) [] dodeca5(A,nil2) = nil. % 0.72/1.11 63 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 64 (wt=28) [] dodeca5(A,cons2(B,C)) = cons(pair2(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: 65 (wt=28) [flip(64)] cons(pair2(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)) = dodeca5(A,cons2(B,C)). % 0.72/1.11 clause forward subsumed: 0 (wt=28) [flip(65)] dodeca5(A,cons2(B,C)) = cons(pair2(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: 66 (wt=5) [] dodeca6(A,nil2) = nil. % 0.72/1.11 66 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 67 (wt=32) [] dodeca6(A,cons2(B,C)) = cons(pair2(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: 68 (wt=32) [flip(67)] cons(pair2(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,cons2(B,C)). % 0.72/1.11 clause forward subsumed: 0 (wt=32) [flip(68)] dodeca6(A,cons2(B,C)) = cons(pair2(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: 69 (wt=4) [] dodeca7(zero) = nil. % 0.72/1.11 69 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 70 (wt=78) [] dodeca7(suc(A)) = append(cons(pair2(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons(pair2(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons(pair2(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 70 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 71 (wt=5) [] tour(nil2,nil) = btrue. % 0.72/1.11 71 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 72 (wt=7) [] tour(nil2,cons(A,B)) = bfalse. % 0.72/1.11 72 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 73 (wt=7) [] tour(cons2(A,B),nil) = bfalse. % 0.72/1.11 73 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 74 (wt=44) [demod([23])] tour(cons2(A,B),cons(pair2(C,D),E)) = andb(eq(A,last(A,B)),andb(path2(cons2(A,B),cons(pair2(C,D),E)),andb(unique(B),eq(len(cons2(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))). % 0.72/1.11 % 0.72/1.11 ** KEPT: 75 (wt=44) [flip(74)] andb(eq(A,last(A,B)),andb(path2(cons2(A,B),cons(pair2(C,D),E)),andb(unique(B),eq(len(cons2(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))) = tour(cons2(A,B),cons(pair2(C,D),E)). % 0.72/1.11 clause forward subsumed: 0 (wt=44) [flip(75)] tour(cons2(A,B),cons(pair2(C,D),E)) = andb(eq(A,last(A,B)),andb(path2(cons2(A,B),cons(pair2(C,D),E)),andb(unique(B),eq(len(cons2(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))). % 0.72/1.11 % 0.72/1.11 ** KEPT: 76 (wt=8) [] prop_t3(A) = notb(tour(A,dodeca7(three))). % 0.72/1.11 76 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 77 (wt=5) [] eq2(bfalse,btrue) = bfalse. % 0.72/1.11 77 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 78 (wt=5) [] eq2(btrue,bfalse) = bfalse. % 0.72/1.11 78 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 79 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B). % 0.72/1.11 79 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 80 (wt=6) [] eq(zero,suc(A)) = bfalse. % 0.72/1.11 80 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 81 (wt=6) [] eq(suc(A),zero) = bfalse. % 0.72/1.11 81 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 82 (wt=5) [] eq(A,A) = btrue. % 0.72/1.11 82 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 83 (wt=5) [] eq2(A,A) = btrue. % 0.72/1.11 83 is a new demodulator. % 0.72/1.11 % 0.72/1.11 ** KEPT: 84 (wt=9) [demod([76])] -(eq2(notb(tour(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 8 (wt=4) [] predNat(zero) = zero. % 0.72/1.11 12 (wt=4) [] or2(nil3) = bfalse. % 0.72/1.11 14 (wt=4) [flip(1)] suc(zero) = one. % 0.72/1.11 15 (wt=4) [flip(1)] suc(one) = two. % 0.72/1.11 16 (wt=4) [flip(1)] suc(two) = three. % 0.72/1.11 17 (wt=4) [] notb(btrue) = bfalse. % 0.72/1.11 18 (wt=4) [] notb(bfalse) = btrue. % 0.72/1.11 27 (wt=4) [] len(nil2) = zero. % 0.72/1.11 36 (wt=4) [] unique(nil2) = btrue. % 0.72/1.11 38 (wt=4) [] dodeca(nil2) = nil. % 0.72/1.11 69 (wt=4) [] dodeca7(zero) = nil. % 0.72/1.11 9 (wt=5) [] predNat(suc(A)) = A. % 0.72/1.11 10 (wt=5) [] orb(btrue,A) = btrue. % 0.72/1.11 11 (wt=5) [] orb(bfalse,A) = A. % 0.72/1.11 19 (wt=5) [] lt(zero,zero) = bfalse. % 0.72/1.11 24 (wt=5) [] maximum(A,nil) = A. % 0.72/1.11 30 (wt=5) [] last(A,nil2) = A. % 0.72/1.11 34 (wt=5) [] elem(A,nil2) = bfalse. % 0.72/1.11 41 (wt=5) [] append(nil,A) = A. % 0.72/1.11 43 (wt=5) [] andb(btrue,A) = A. % 0.72/1.11 44 (wt=5) [] andb(bfalse,A) = bfalse. % 0.72/1.11 48 (wt=5) [] path2(nil2,A) = btrue. % 0.72/1.11 52 (wt=5) [] add(zero,A) = A. % 0.72/1.11 54 (wt=5) [] dodeca2(A,nil2) = nil. % 0.72/1.11 57 (wt=5) [] dodeca3(A,nil2) = nil. % 0.72/1.11 60 (wt=5) [] dodeca4(A,nil2) = nil. % 0.72/1.11 63 (wt=5) [] dodeca5(A,nil2) = nil. % 0.72/1.11 66 (wt=5) [] dodeca6(A,nil2) = nil. % 0.72/1.11 71 (wt=5) [] tour(nil2,nil) = btrue. % 0.72/1.11 77 (wt=5) [] eq2(bfalse,btrue) = bfalse. % 0.72/1.11 78 (wt=5) [] eq2(btrue,bfalse) = bfalse. % 0.72/1.11 82 (wt=5) [] eq(A,A) = btrue. % 0.72/1.11 83 (wt=5) [] eq2(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) = nil2. % 0.72/1.11 5 (wt=6) [] aux3(A,B,btrue) = bfalse. % 0.72/1.11 20 (wt=6) [] lt(zero,suc(A)) = btrue. % 0.72/1.11 21 (wt=6) [] lt(suc(A),zero) = bfalse. % 0.72/1.11 45 (wt=6) [] path(A,B,nil) = nil3. % 0.72/1.11 80 (wt=6) [] eq(zero,suc(A)) = bfalse. % 0.72/1.11 81 (wt=6) [] eq(suc(A),zero) = bfalse. % 0.72/1.11 6 (wt=7) [] aux3(A,B,bfalse) = unique(B). % 0.72/1.11 7 (wt=7) [flip(6)] unique(A) = aux3(B,A,bfalse). % 0.72/1.11 49 (wt=7) [] path2(cons2(A,nil2),B) = btrue. % 0.72/1.11 72 (wt=7) [] tour(nil2,cons(A,B)) = bfalse. % 0.72/1.11 73 (wt=7) [] tour(cons2(A,B),nil) = bfalse. % 0.72/1.11 28 (wt=8) [] len(cons2(A,B)) = suc(len(B)). % 0.72/1.11 29 (wt=8) [flip(28)] suc(len(A)) = len(cons2(B,A)). % 0.72/1.11 76 (wt=8) [] prop_t3(A) = notb(tour(A,dodeca7(three))). % 0.72/1.11 13 (wt=9) [] or2(cons3(A,B)) = orb(A,or2(B)). % 0.72/1.11 22 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B). % 0.72/1.11 31 (wt=9) [] last(A,cons2(B,C)) = last(B,C). % 0.72/1.11 32 (wt=9) [flip(31)] last(A,B) = last(C,cons2(A,B)). % 0.72/1.11 53 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B). % 0.72/1.11 79 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B). % 0.72/1.11 84 (wt=9) [demod([76])] -(eq2(notb(tour(A,dodeca7(three))),bfalse) = btrue). % 0.72/1.11 23 (wt=10) [] maxNat(A,B) = aux(A,B,lt(A,B)). % 0.72/1.11 33 (wt=10) [flip(1)] aux2(A,B,lt(B,A)) = enumFromToNat(A,B). % 0.72/1.11 4 (wt=11) [flip(1)] cons2(A,enumFromToNat(suc(A),B)) = aux2(A,B,bfalse). % 0.72/1.11 37 (wt=11) [] unique(cons2(A,B)) = aux3(A,B,elem(A,B)). % 0.72/1.11 42 (wt=11) [flip(1)] cons(A,append(B,C)) = append(cons(A,B),C). % 0.72/1.11 39 (wt=12) [] dodeca(cons2(A,B)) = cons(pair2(A,suc(A)),dodeca(B)). % 0.72/1.11 40 (wt=12) [flip(39)] cons(pair2(A,suc(A)),dodeca(B)) = dodeca(cons2(A,B)). % 4.53/4.93 35 (wt=13) [flip(1)] orb(eq(A,B),elem(B,C)) = elem(B,cons2(A,C)). % 4.53/4.93 55 (wt=16) [] dodeca2(A,cons2(B,C)) = cons(pair2(B,add(suc(A),B)),dodeca2(A,C)). % 4.53/4.93 56 (wt=16) [flip(55)] cons(pair2(A,add(suc(B),A)),dodeca2(B,C)) = dodeca2(B,cons2(A,C)). % 4.53/4.93 50 (wt=19) [] path2(cons2(A,cons2(B,C)),D) = andb(or2(path(A,B,D)),path2(cons2(B,C),D)). % 4.53/4.93 51 (wt=19) [flip(50)] andb(or2(path(A,B,C)),path2(cons2(B,D),C)) = path2(cons2(A,cons2(B,D)),C). % 4.53/4.93 58 (wt=22) [] dodeca3(A,cons2(B,C)) = cons(pair2(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)). % 4.53/4.93 59 (wt=22) [flip(58)] cons(pair2(add(suc(A),B),add(add(suc(A),suc(A)),B)),dodeca3(A,C)) = dodeca3(A,cons2(B,C)). % 4.53/4.93 61 (wt=23) [] dodeca4(A,cons2(B,C)) = cons(pair2(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)). % 4.53/4.93 62 (wt=23) [flip(61)] cons(pair2(add(suc(A),suc(B)),add(add(suc(A),suc(A)),B)),dodeca4(A,C)) = dodeca4(A,cons2(B,C)). % 4.53/4.93 25 (wt=26) [demod([23,23])] maximum(A,cons(pair2(B,C),D)) = maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D). % 4.53/4.93 26 (wt=26) [flip(25)] maximum(aux(A,aux(B,C,lt(B,C)),lt(A,aux(B,C,lt(B,C)))),D) = maximum(A,cons(pair2(B,C),D)). % 4.53/4.93 64 (wt=28) [] dodeca5(A,cons2(B,C)) = cons(pair2(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)). % 4.53/4.93 65 (wt=28) [flip(64)] cons(pair2(add(add(suc(A),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),B)),dodeca5(A,C)) = dodeca5(A,cons2(B,C)). % 4.53/4.93 46 (wt=29) [] path(A,B,cons(pair2(C,D),E)) = cons3(orb(andb(eq(C,A),eq(D,B)),andb(eq(C,B),eq(D,A))),path(A,B,E)). % 4.53/4.93 47 (wt=29) [flip(46)] cons3(orb(andb(eq(A,B),eq(C,D)),andb(eq(A,D),eq(C,B))),path(B,D,E)) = path(B,D,cons(pair2(A,C),E)). % 4.53/4.93 67 (wt=32) [] dodeca6(A,cons2(B,C)) = cons(pair2(add(add(add(suc(A),suc(A)),suc(A)),B),add(add(add(suc(A),suc(A)),suc(A)),suc(B))),dodeca6(A,C)). % 4.53/4.93 68 (wt=32) [flip(67)] cons(pair2(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,cons2(B,C)). % 4.53/4.93 74 (wt=44) [demod([23])] tour(cons2(A,B),cons(pair2(C,D),E)) = andb(eq(A,last(A,B)),andb(path2(cons2(A,B),cons(pair2(C,D),E)),andb(unique(B),eq(len(cons2(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))). % 4.53/4.93 75 (wt=44) [flip(74)] andb(eq(A,last(A,B)),andb(path2(cons2(A,B),cons(pair2(C,D),E)),andb(unique(B),eq(len(cons2(A,B)),add(two,maximum(aux(C,D,lt(C,D)),E)))))) = tour(cons2(A,B),cons(pair2(C,D),E)). % 4.53/4.93 70 (wt=78) [] dodeca7(suc(A)) = append(cons(pair2(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons(pair2(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons(pair2(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)))))))). % 4.53/4.93 end_of_list. % 4.53/4.93 % 4.53/4.93 Demodulators: % 4.53/4.93 1 (wt=6) [] aux(A,B,btrue) = B. % 4.53/4.93 2 (wt=6) [] aux(A,B,bfalse) = A. % 4.53/4.93 3 (wt=6) [] aux2(A,B,btrue) = nil2. % 4.53/4.93 4 (wt=11) [flip(1)] cons2(A,enumFromToNat(suc(A),B)) = aux2(A,B,bfalse). % 4.53/4.93 5 (wt=6) [] aux3(A,B,btrue) = bfalse. % 4.53/4.93 8 (wt=4) [] predNat(zero) = zero. % 4.53/4.93 9 (wt=5) [] predNat(suc(A)) = A. % 4.53/4.93 10 (wt=5) [] orb(btrue,A) = btrue. % 4.53/4.93 11 (wt=5) [] orb(bfalse,A) = A. % 4.53/4.93 12 (wt=4) [] or2(nil3) = bfalse. % 4.53/4.93 13 (wt=9) [] or2(cons3(A,B)) = orb(A,or2(B)). % 4.53/4.93 14 (wt=4) [flip(1)] suc(zero) = one. % 4.53/4.93 15 (wt=4) [flip(1)] suc(one) = two. % 4.53/4.93 16 (wt=4) [flip(1)] suc(two) = three. % 4.53/4.93 17 (wt=4) [] notb(btrue) = bfalse. % 4.53/4.93 18 (wt=4) [] notb(bfalse) = btrue. % 4.53/4.93 19 (wt=5) [] lt(zero,zero) = bfalse. % 4.53/4.93 20 (wt=6) [] lt(zero,suc(A)) = btrue. % 4.53/4.93 21 (wt=6) [] lt(suc(A),zero) = bfalse. % 4.53/4.93 22 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B). % 4.53/4.93 23 (wt=10) [] maxNat(A,B) = aux(A,B,lt(A,B)). % 4.53/4.93 24 (wt=5) [] maximum(A,nil) = A. % 4.53/4.93 27 (wt=4) [] len(nil2) = zero. % 4.53/4.93 30 (wt=5) [] last(A,nil2) = A. % 4.53/4.93 33 (wt=10) [flip(1)] aux2(A,B,lt(B,A)) = enumFromToNat(A,B). % 4.53/4.93 34 (wt=5) [] elem(A,nil2) = bfalse. % 4.53/4.93 35 (wt=13) [flip(1)] orb(eq(A,B),elem(B,C)) = elem(B,cons2(A,C)). % 4.53/4.93 36 (wt=4) [] unique(nil2) = btrue. % 4.53/4.93 37 (wt=11) [] unique(cons2(A,B)) = aux3(A,B,elem(A,B)). % 4.53/4.93 38 (wt=4) [] dodeca(nil2) = nil. % 4.53/4.93 41 (wt=5) [] append(nil,A) = A. % 4.53/4.93 42 (wt=11) [flip(1)] cons(A,append(B,C)) = append(cons(A,B),C). % 4.53/4.93 43 (wt=5) [] andb(btrue,A) = A. % 4.53/4.93 44 (wt=5) [] andb(bfalse,A) = bfalse. % 4.53/4.93 45 (wt=6) [] path(A,B,nil) = nil3. % 4.53/4.93 48 (wt=5) [] path2(nil2,A) = btrue. % 4.53/4.93 49 (wt=7) [] path2(cons2(A,nil2),B) = btrue. % 4.53/4.93 52 (wt=5) [] add(zero,A) = A. % 4.53/4.93 53 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B). % 4.53/4.93 54 (wt=5) [] dodeca2(A,nil2) = nil. % 4.53/4.93 57 (wt=5) [] dodeca3(A,nil2) = nil. % 4.53/4.93 60 (wt=5) [] dodeca4(A,nil2) = nil. % 4.53/4.93 63 (wt=5) [] dodeca5(A,nil2) = nil. % 4.53/4.93 66 (wt=5) [] dodeca6(A,nil2) = nil. % 4.53/4.93 69 (wt=4) [] dodeca7(zero) = nil. % 4.53/4.93 70 (wt=78) [] dodeca7(suc(A)) = append(cons(pair2(A,zero),dodeca(enumFromToNat(zero,A))),append(dodeca2(A,enumFromToNat(zero,suc(A))),append(dodeca3(A,enumFromToNat(zero,suc(A))),append(cons(pair2(suc(A),add(add(suc(A),suc(A)),A)),dodeca4(A,enumFromToNat(zero,A))),append(dodeca5(A,enumFromToNat(zero,suc(A))),cons(pair2(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)))))))). % 4.53/4.93 71 (wt=5) [] tour(nil2,nil) = btrue. % 4.53/4.93 72 (wt=7) [] tour(nil2,cons(A,B)) = bfalse. % 4.53/4.93 73 (wt=7) [] tour(cons2(A,B),nil) = bfalse. % 4.53/4.93 76 (wt=8) [] prop_t3(A) = notb(tour(A,dodeca7(three))). % 4.53/4.93 77 (wt=5) [] eq2(bfalse,btrue) = bfalse. % 4.53/4.93 78 (wt=5) [] eq2(btrue,bfalse) = bfalse. % 4.53/4.93 79 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B). % 4.53/4.93 80 (wt=6) [] eq(zero,suc(A)) = bfalse. % 4.53/4.93 81 (wt=6) [] eq(suc(A),zero) = bfalse. % 4.53/4.93 82 (wt=5) [] eq(A,A) = btrue. % 4.53/4.93 83 (wt=5) [] eq2(A,A) = btrue. % 4.53/4.93 end_of_list. % 4.53/4.93 % 4.53/4.93 Passive: % 4.53/4.93 end_of_list. % 4.53/4.93 % 4.53/4.93 ------------- memory usage % 4.53/4.93 % 4.53/4.93 ********** ABNORMAL END ********** % 4.53/4.93 ********** in tp_alloc, max_mem parameter exceeded. % 4.53/4.93 ------------ % 4.53/4.93 Memory dynamically allocated (tp_alloc): 63964. % 4.53/4.93 type (bytes each) gets frees in use avail bytes % 4.53/4.93 sym_ent ( 96) 108 0 108 0 10.1 K % 4.53/4.93 term ( 16) 1993084 1137527 855557 4 16657.6 K % 4.53/4.93 gen_ptr ( 8) 5366672 261274 5105398 0 39885.9 K % 4.53/4.93 context ( 808) 4748029 4748027 2 8 7.9 K % 4.53/4.93 trail ( 12) 9825 9825 0 15 0.2 K % 4.53/4.93 bt_node ( 68) 1940519 1940516 3 225 15.1 K % 4.53/4.93 ac_position (285432) 0 0 0 0 0.0 K % 4.53/4.93 ac_match_pos (14044) 0 0 0 0 0.0 K % 4.53/4.93 ac_match_free_vars_pos (4020) % 4.53/4.93 0 0 0 0 0.0 K % 4.53/4.93 discrim ( 12) 548353 105836 442517 0 5185.7 K % 4.53/4.93 flat ( 40) 4580368 4580368 0 3864 150.9 K % 4.53/4.93 discrim_pos ( 12) 36948 36948 0 1 0.0 K % 4.53/4.93 fpa_head ( 12) 26193 0 26193 0 306.9 K % 4.53/4.93 fpa_tree ( 28) 11656 11656 0 59 1.6 K % 4.53/4.93 fpa_pos ( 36) 15159 15159 0 1 0.0 K % 4.53/4.93 literal ( 12) 50257 36786 13471 1 157.9 K % 4.53/4.93 clause ( 24) 50257 36786 13471 1 315.8 K % 4.53/4.93 list ( 12) 1747 1691 56 5 0.7 K % 4.53/4.93 list_pos ( 20) 46882 9891 36991 0 722.5 K % 4.53/4.93 pair_index ( 40) 2 0 2 0 0.1 K % 4.53/4.93 % 4.53/4.93 -------------- statistics ------------- % 4.53/4.93 Clauses input 71 % 4.53/4.93 Usable input 0 % 4.53/4.93 Sos input 71 % 4.53/4.93 Demodulators input 0 % 4.53/4.93 Passive input 0 % 4.53/4.93 % 4.53/4.93 Processed BS (before search) 97 % 4.53/4.93 Forward subsumed BS 13 % 4.53/4.93 Kept BS 84 % 4.53/4.93 New demodulators BS 57 % 4.53/4.93 Back demodulated BS 0 % 4.53/4.93 % 4.53/4.93 Clauses or pairs given 286740 % 4.53/4.93 Clauses generated 26541 % 4.53/4.93 Forward subsumed 13154 % 4.53/4.93 Deleted by weight 0 % 4.53/4.93 Deleted by variable count 0 % 4.53/4.93 Kept 13387 % 4.53/4.93 New demodulators 1631 % 4.53/4.93 Back demodulated 2266 % 4.53/4.93 Ordered paramod prunes 0 % 4.53/4.93 Basic paramod prunes 1080210 % 4.53/4.93 Prime paramod prunes 22 % 4.53/4.93 Semantic prunes 0 % 4.53/4.93 % 4.53/4.93 Rewrite attmepts 1027047 % 4.53/4.93 Rewrites 27621 % 4.53/4.93 % 4.53/4.93 FPA overloads 0 % 4.53/4.93 FPA underloads 0 % 4.53/4.93 % 4.53/4.93 Usable size 0 % 4.53/4.93 Sos size 11205 % 4.53/4.93 Demodulators size 1110 % 4.53/4.93 Passive size 0 % 4.53/4.93 Disabled size 2266 % 4.53/4.93 % 4.53/4.93 Proofs found 0 % 4.53/4.93 % 4.53/4.93 ----------- times (seconds) ----------- Tue May 5 13:04:52 2026 % 4.53/4.93 % 4.53/4.93 user CPU time 2.75 (0 hr, 0 min, 2 sec) % 4.53/4.93 system CPU time 1.07 (0 hr, 0 min, 1 sec) % 4.53/4.93 wall-clock time 3 (0 hr, 0 min, 3 sec) % 4.53/4.93 input time 0.00 % 4.53/4.93 paramodulation time 0.27 % 4.53/4.93 demodulation time 0.14 % 4.53/4.93 orient time 0.08 % 4.53/4.93 weigh time 0.02 % 4.53/4.93 forward subsume time 0.06 % 4.53/4.93 back demod find time 0.01 % 4.53/4.93 conflict time 0.01 % 4.53/4.93 LRPO time 0.05 % 4.53/4.93 store clause time 1.64 % 4.53/4.93 disable clause time 0.15 % 4.53/4.93 prime paramod time 0.02 % 4.53/4.93 semantics time 0.00 % 4.53/4.93 % 4.53/4.93 EQP interrupted %------------------------------------------------------------------------------