%------------------------------------------------------------------------------ % File : EQP---0.9e % Problem : SWX231-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_eqp %s % Computer : n016.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 27.67s 28.03s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX231-1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.12 % Command : tptp2X_and_run_eqp %s % 0.18/0.34 % Computer : n016.cluster.edu % 0.18/0.34 % Model : x86_64 x86_64 % 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.34 % Memory : 8042.1875MB % 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.34 % CPULimit : 300 % 0.18/0.34 % WCLimit : 300 % 0.18/0.34 % DateTime : Tue May 5 13:02:21 EDT 2026 % 0.18/0.34 % CPUTime : % 0.70/1.10 ----- EQP 0.9e, May 2009 ----- % 0.70/1.10 The job began on n016.cluster.edu, Tue May 5 13:02:21 2026 % 0.70/1.10 The command was "./eqp09e". % 0.70/1.10 % 0.70/1.10 set(prolog_style_variables). % 0.70/1.10 set(lrpo). % 0.70/1.10 set(basic_paramod). % 0.70/1.10 set(functional_subsume). % 0.70/1.10 set(ordered_paramod). % 0.70/1.10 set(prime_paramod). % 0.70/1.10 set(para_pairs). % 0.70/1.10 assign(pick_given_ratio,4). % 0.70/1.10 clear(print_kept). % 0.70/1.10 clear(print_new_demod). % 0.70/1.10 clear(print_back_demod). % 0.70/1.10 clear(print_given). % 0.70/1.10 assign(max_mem,64000). % 0.70/1.10 end_of_commands. % 0.70/1.10 % 0.70/1.10 Usable: % 0.70/1.10 end_of_list. % 0.70/1.10 % 0.70/1.10 Sos: % 0.70/1.10 0 (wt=-1) [] aux(A,B,btrue) = nil3. % 0.70/1.10 0 (wt=-1) [] aux(A,B,bfalse) = cons3(A,enumFromToNat(suc(A),B)). % 0.70/1.10 0 (wt=-1) [] aux2(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 0.70/1.10 0 (wt=-1) [] aux2(A,B,C,D,just(E)) = cons4(notb(eq(D,E)),colouring(A,B)). % 0.70/1.10 0 (wt=-1) [] aux3(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 0.70/1.10 0 (wt=-1) [] aux3(A,B,C,D,just(E)) = aux2(A,B,D,E,index(A,D)). % 0.70/1.10 0 (wt=-1) [] ten = suc(suc(suc(suc(suc(suc(suc(suc(suc(suc(zero)))))))))). % 0.70/1.10 0 (wt=-1) [] predNat(zero) = zero. % 0.70/1.10 0 (wt=-1) [] predNat(suc(A)) = A. % 0.70/1.10 0 (wt=-1) [] petersen2(nil3) = nil. % 0.70/1.10 0 (wt=-1) [] petersen2(cons3(A,B)) = cons(pair2(A,suc(A)),petersen2(B)). % 0.70/1.10 0 (wt=-1) [] one = suc(zero). % 0.70/1.10 0 (wt=-1) [] two = suc(one). % 0.70/1.10 0 (wt=-1) [] three = suc(two). % 0.70/1.10 0 (wt=-1) [] notb(btrue) = bfalse. % 0.70/1.10 0 (wt=-1) [] notb(bfalse) = btrue. % 0.70/1.10 0 (wt=-1) [] lt(zero,zero) = bfalse. % 0.70/1.10 0 (wt=-1) [] lt(zero,suc(A)) = btrue. % 0.70/1.10 0 (wt=-1) [] lt(suc(A),zero) = bfalse. % 0.70/1.10 0 (wt=-1) [] lt(suc(A),suc(B)) = lt(A,B). % 0.70/1.10 0 (wt=-1) [] prop_p31(nil3) = nil4. % 0.70/1.10 0 (wt=-1) [] prop_p31(cons3(A,B)) = cons4(lt(A,three),prop_p31(B)). % 0.70/1.10 0 (wt=-1) [] index(nil3,A) = nothing. % 0.70/1.10 0 (wt=-1) [] index(cons3(A,B),zero) = just(A). % 0.70/1.10 0 (wt=-1) [] index(cons3(A,B),suc(C)) = index(B,C). % 0.70/1.10 0 (wt=-1) [] four = suc(three). % 0.70/1.10 0 (wt=-1) [] five = suc(four). % 0.70/1.10 0 (wt=-1) [] seven = suc(suc(five)). % 0.70/1.10 0 (wt=-1) [] nine = suc(suc(seven)). % 0.70/1.10 0 (wt=-1) [] enumFromToNat(A,B) = aux(A,B,lt(B,A)). % 0.70/1.10 0 (wt=-1) [] eleven = suc(suc(nine)). % 0.70/1.10 0 (wt=-1) [] colouring(A,nil) = nil4. % 0.70/1.10 0 (wt=-1) [] colouring(A,cons(pair2(B,C),D)) = aux3(A,D,B,C,index(A,B)). % 0.70/1.10 0 (wt=-1) [] append(nil,A) = A. % 0.70/1.10 0 (wt=-1) [] append(cons(A,B),C) = cons(A,append(B,C)). % 0.70/1.10 0 (wt=-1) [] concat(nil2) = nil. % 0.70/1.10 0 (wt=-1) [] concat(cons2(A,B)) = append(A,concat(B)). % 0.70/1.10 0 (wt=-1) [] andb(btrue,A) = A. % 0.70/1.10 0 (wt=-1) [] andb(bfalse,A) = bfalse. % 0.70/1.10 0 (wt=-1) [] and2(nil4) = btrue. % 0.70/1.10 0 (wt=-1) [] and2(cons4(A,B)) = andb(A,and2(B)). % 0.70/1.10 0 (wt=-1) [] colouring2(A,B) = and2(colouring(B,A)). % 0.70/1.10 0 (wt=-1) [] add(zero,A) = A. % 0.70/1.10 0 (wt=-1) [] add(suc(A),B) = suc(add(A,B)). % 0.70/1.10 0 (wt=-1) [] petersen(A,nil) = nil2. % 0.70/1.10 0 (wt=-1) [] petersen(A,cons(pair2(B,C),D)) = cons2(cons(pair2(B,C),cons(pair2(add(suc(A),B),add(suc(A),C)),nil)),petersen(A,D)). % 0.70/1.10 0 (wt=-1) [] petersen3(A,nil3) = nil. % 0.70/1.10 0 (wt=-1) [] petersen3(A,cons3(B,C)) = cons(pair2(B,add(suc(A),B)),petersen3(A,C)). % 0.70/1.10 0 (wt=-1) [] petersen4(zero) = nil. % 0.70/1.10 0 (wt=-1) [] petersen4(suc(A)) = append(concat(petersen(A,cons(pair2(A,zero),petersen2(enumFromToNat(zero,A))))),petersen3(A,enumFromToNat(zero,suc(A)))). % 0.70/1.10 0 (wt=-1) [] twentyOne = add(ten,eleven). % 0.70/1.10 0 (wt=-1) [] thirtyOne = add(twentyOne,ten). % 0.70/1.10 0 (wt=-1) [] prop_p312(A) = notb(andb(colouring2(petersen4(thirtyOne),A),and2(prop_p31(A)))). % 0.70/1.10 0 (wt=-1) [] eq2(bfalse,btrue) = bfalse. % 0.70/1.10 0 (wt=-1) [] eq2(btrue,bfalse) = bfalse. % 0.70/1.10 0 (wt=-1) [] eq(suc(A),suc(B)) = eq(A,B). % 0.70/1.10 0 (wt=-1) [] eq(zero,suc(A)) = bfalse. % 0.70/1.10 0 (wt=-1) [] eq(suc(A),zero) = bfalse. % 0.70/1.10 0 (wt=-1) [] eq(A,A) = btrue. % 0.70/1.10 0 (wt=-1) [] eq2(A,A) = btrue. % 0.70/1.10 0 (wt=-1) [] -(eq2(prop_p312(A),bfalse) = btrue). % 0.70/1.10 end_of_list. % 0.70/1.10 % 0.70/1.10 Demodulators: % 0.70/1.10 end_of_list. % 0.70/1.10 % 0.70/1.10 Passive: % 0.70/1.10 end_of_list. % 0.70/1.10 % 0.70/1.10 Starting to process input. % 0.70/1.10 % 0.70/1.10 ** KEPT: 1 (wt=6) [] aux(A,B,btrue) = nil3. % 0.70/1.10 1 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 2 (wt=11) [flip(1)] cons3(A,enumFromToNat(suc(A),B)) = aux(A,B,bfalse). % 0.70/1.10 2 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 3 (wt=12) [] aux2(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 4 (wt=12) [flip(3)] cons4(bfalse,colouring(A,B)) = aux2(A,B,C,D,nothing). % 0.70/1.10 clause forward subsumed: 0 (wt=12) [flip(4)] aux2(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 5 (wt=16) [] aux2(A,B,C,D,just(E)) = cons4(notb(eq(D,E)),colouring(A,B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 6 (wt=16) [flip(5)] cons4(notb(eq(A,B)),colouring(C,D)) = aux2(C,D,E,A,just(B)). % 0.70/1.10 clause forward subsumed: 0 (wt=16) [flip(6)] aux2(C,D,E,A,just(B)) = cons4(notb(eq(A,B)),colouring(C,D)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 7 (wt=12) [] aux3(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 8 (wt=12) [flip(7)] cons4(bfalse,colouring(A,B)) = aux3(A,B,C,D,nothing). % 0.70/1.10 clause forward subsumed: 0 (wt=12) [flip(8)] aux3(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 9 (wt=16) [] aux3(A,B,C,D,just(E)) = aux2(A,B,D,E,index(A,D)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 10 (wt=16) [flip(9)] aux2(A,B,C,D,index(A,C)) = aux3(A,B,E,C,just(D)). % 0.70/1.10 clause forward subsumed: 0 (wt=16) [flip(10)] aux3(A,B,E,C,just(D)) = aux2(A,B,C,D,index(A,C)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 11 (wt=13) [flip(1)] suc(suc(suc(suc(suc(suc(suc(suc(suc(suc(zero)))))))))) = ten. % 0.70/1.10 11 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 12 (wt=4) [] predNat(zero) = zero. % 0.70/1.10 12 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 13 (wt=5) [] predNat(suc(A)) = A. % 0.70/1.10 13 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 14 (wt=4) [] petersen2(nil3) = nil. % 0.70/1.10 14 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 15 (wt=12) [] petersen2(cons3(A,B)) = cons(pair2(A,suc(A)),petersen2(B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 16 (wt=12) [flip(15)] cons(pair2(A,suc(A)),petersen2(B)) = petersen2(cons3(A,B)). % 0.70/1.10 clause forward subsumed: 0 (wt=12) [flip(16)] petersen2(cons3(A,B)) = cons(pair2(A,suc(A)),petersen2(B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 17 (wt=4) [flip(1)] suc(zero) = one. % 0.70/1.10 17 is a new demodulator. % 0.70/1.10 -> 17 back demodulating 11. % 0.70/1.10 % 0.70/1.10 ** KEPT: 18 (wt=12) [back_demod(11),demod([17])] suc(suc(suc(suc(suc(suc(suc(suc(suc(one))))))))) = ten. % 0.70/1.10 18 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 19 (wt=4) [flip(1)] suc(one) = two. % 0.70/1.10 19 is a new demodulator. % 0.70/1.10 -> 19 back demodulating 18. % 0.70/1.10 % 0.70/1.10 ** KEPT: 20 (wt=11) [back_demod(18),demod([19])] suc(suc(suc(suc(suc(suc(suc(suc(two)))))))) = ten. % 0.70/1.10 20 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 21 (wt=4) [flip(1)] suc(two) = three. % 0.70/1.10 21 is a new demodulator. % 0.70/1.10 -> 21 back demodulating 20. % 0.70/1.10 % 0.70/1.10 ** KEPT: 22 (wt=10) [back_demod(20),demod([21])] suc(suc(suc(suc(suc(suc(suc(three))))))) = ten. % 0.70/1.10 22 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 23 (wt=4) [] notb(btrue) = bfalse. % 0.70/1.10 23 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 24 (wt=4) [] notb(bfalse) = btrue. % 0.70/1.10 24 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 25 (wt=5) [] lt(zero,zero) = bfalse. % 0.70/1.10 25 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 26 (wt=6) [] lt(zero,suc(A)) = btrue. % 0.70/1.10 26 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 27 (wt=6) [] lt(suc(A),zero) = bfalse. % 0.70/1.10 27 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 28 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B). % 0.70/1.10 28 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 29 (wt=4) [] prop_p31(nil3) = nil4. % 0.70/1.10 29 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 30 (wt=11) [] prop_p31(cons3(A,B)) = cons4(lt(A,three),prop_p31(B)). % 0.70/1.10 30 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 31 (wt=5) [] index(nil3,A) = nothing. % 0.70/1.10 31 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 32 (wt=8) [] index(cons3(A,B),zero) = just(A). % 0.70/1.10 % 0.70/1.10 ** KEPT: 33 (wt=8) [flip(32)] just(A) = index(cons3(A,B),zero). % 0.70/1.10 clause forward subsumed: 0 (wt=8) [flip(33)] index(cons3(A,B),zero) = just(A). % 0.70/1.10 % 0.70/1.10 ** KEPT: 34 (wt=10) [] index(cons3(A,B),suc(C)) = index(B,C). % 0.70/1.10 34 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 35 (wt=4) [flip(1)] suc(three) = four. % 0.70/1.10 35 is a new demodulator. % 0.70/1.10 -> 35 back demodulating 22. % 0.70/1.10 % 0.70/1.10 ** KEPT: 36 (wt=9) [back_demod(22),demod([35])] suc(suc(suc(suc(suc(suc(four)))))) = ten. % 0.70/1.10 36 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 37 (wt=4) [flip(1)] suc(four) = five. % 0.70/1.10 37 is a new demodulator. % 0.70/1.10 -> 37 back demodulating 36. % 0.70/1.10 % 0.70/1.10 ** KEPT: 38 (wt=8) [back_demod(36),demod([37])] suc(suc(suc(suc(suc(five))))) = ten. % 0.70/1.10 38 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 39 (wt=5) [flip(1)] suc(suc(five)) = seven. % 0.70/1.10 39 is a new demodulator. % 0.70/1.10 -> 39 back demodulating 38. % 0.70/1.10 % 0.70/1.10 ** KEPT: 40 (wt=6) [back_demod(38),demod([39])] suc(suc(suc(seven))) = ten. % 0.70/1.10 40 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 41 (wt=5) [flip(1)] suc(suc(seven)) = nine. % 0.70/1.10 41 is a new demodulator. % 0.70/1.10 -> 41 back demodulating 40. % 0.70/1.10 % 0.70/1.10 ** KEPT: 42 (wt=4) [back_demod(40),demod([41])] suc(nine) = ten. % 0.70/1.10 42 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 43 (wt=10) [flip(1)] aux(A,B,lt(B,A)) = enumFromToNat(A,B). % 0.70/1.10 43 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 44 (wt=4) [demod([42]),flip(1)] suc(ten) = eleven. % 0.70/1.10 44 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 45 (wt=5) [] colouring(A,nil) = nil4. % 0.70/1.10 45 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 46 (wt=16) [] colouring(A,cons(pair2(B,C),D)) = aux3(A,D,B,C,index(A,B)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 47 (wt=16) [flip(46)] aux3(A,B,C,D,index(A,C)) = colouring(A,cons(pair2(C,D),B)). % 0.70/1.10 clause forward subsumed: 0 (wt=16) [flip(47)] colouring(A,cons(pair2(C,D),B)) = aux3(A,B,C,D,index(A,C)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 48 (wt=5) [] append(nil,A) = A. % 0.70/1.10 48 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 49 (wt=11) [flip(1)] cons(A,append(B,C)) = append(cons(A,B),C). % 0.70/1.10 49 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 50 (wt=4) [] concat(nil2) = nil. % 0.70/1.10 50 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 51 (wt=9) [] concat(cons2(A,B)) = append(A,concat(B)). % 0.70/1.10 51 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 52 (wt=5) [] andb(btrue,A) = A. % 0.70/1.10 52 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 53 (wt=5) [] andb(bfalse,A) = bfalse. % 0.70/1.10 53 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 54 (wt=4) [] and2(nil4) = btrue. % 0.70/1.10 54 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 55 (wt=9) [] and2(cons4(A,B)) = andb(A,and2(B)). % 0.70/1.10 55 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 56 (wt=8) [flip(1)] and2(colouring(A,B)) = colouring2(B,A). % 0.70/1.10 56 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 57 (wt=5) [] add(zero,A) = A. % 0.70/1.10 57 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 58 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B). % 0.70/1.10 58 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 59 (wt=5) [] petersen(A,nil) = nil2. % 0.70/1.10 59 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 60 (wt=27) [] petersen(A,cons(pair2(B,C),D)) = cons2(cons(pair2(B,C),cons(pair2(add(suc(A),B),add(suc(A),C)),nil)),petersen(A,D)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 61 (wt=27) [flip(60)] cons2(cons(pair2(A,B),cons(pair2(add(suc(C),A),add(suc(C),B)),nil)),petersen(C,D)) = petersen(C,cons(pair2(A,B),D)). % 0.70/1.10 clause forward subsumed: 0 (wt=27) [flip(61)] petersen(C,cons(pair2(A,B),D)) = cons2(cons(pair2(A,B),cons(pair2(add(suc(C),A),add(suc(C),B)),nil)),petersen(C,D)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 62 (wt=5) [] petersen3(A,nil3) = nil. % 0.70/1.10 62 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 63 (wt=16) [] petersen3(A,cons3(B,C)) = cons(pair2(B,add(suc(A),B)),petersen3(A,C)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 64 (wt=16) [flip(63)] cons(pair2(A,add(suc(B),A)),petersen3(B,C)) = petersen3(B,cons3(A,C)). % 0.70/1.10 clause forward subsumed: 0 (wt=16) [flip(64)] petersen3(B,cons3(A,C)) = cons(pair2(A,add(suc(B),A)),petersen3(B,C)). % 0.70/1.10 % 0.70/1.10 ** KEPT: 65 (wt=4) [] petersen4(zero) = nil. % 0.70/1.10 65 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 66 (wt=22) [] petersen4(suc(A)) = append(concat(petersen(A,cons(pair2(A,zero),petersen2(enumFromToNat(zero,A))))),petersen3(A,enumFromToNat(zero,suc(A)))). % 0.70/1.10 66 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 67 (wt=5) [flip(1)] add(ten,eleven) = twentyOne. % 0.70/1.10 67 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 68 (wt=5) [flip(1)] add(twentyOne,ten) = thirtyOne. % 0.70/1.10 68 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 69 (wt=12) [] prop_p312(A) = notb(andb(colouring2(petersen4(thirtyOne),A),and2(prop_p31(A)))). % 0.70/1.10 69 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 70 (wt=5) [] eq2(bfalse,btrue) = bfalse. % 0.70/1.10 70 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 71 (wt=5) [] eq2(btrue,bfalse) = bfalse. % 0.70/1.10 71 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 72 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B). % 0.70/1.10 72 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 73 (wt=6) [] eq(zero,suc(A)) = bfalse. % 0.70/1.10 73 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 74 (wt=6) [] eq(suc(A),zero) = bfalse. % 0.70/1.10 74 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 75 (wt=5) [] eq(A,A) = btrue. % 0.70/1.10 75 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 76 (wt=5) [] eq2(A,A) = btrue. % 0.70/1.10 76 is a new demodulator. % 0.70/1.10 % 0.70/1.10 ** KEPT: 77 (wt=13) [demod([69])] -(eq2(notb(andb(colouring2(petersen4(thirtyOne),A),and2(prop_p31(A)))),bfalse) = btrue). % 0.70/1.10 % 0.70/1.10 After processing input: % 0.70/1.10 % 0.70/1.10 Usable: % 0.70/1.10 end_of_list. % 0.70/1.10 % 0.70/1.10 Sos: % 0.70/1.10 12 (wt=4) [] predNat(zero) = zero. % 0.70/1.10 14 (wt=4) [] petersen2(nil3) = nil. % 0.70/1.10 17 (wt=4) [flip(1)] suc(zero) = one. % 0.70/1.10 19 (wt=4) [flip(1)] suc(one) = two. % 0.70/1.10 21 (wt=4) [flip(1)] suc(two) = three. % 0.70/1.10 23 (wt=4) [] notb(btrue) = bfalse. % 0.70/1.10 24 (wt=4) [] notb(bfalse) = btrue. % 0.70/1.10 29 (wt=4) [] prop_p31(nil3) = nil4. % 0.70/1.10 35 (wt=4) [flip(1)] suc(three) = four. % 0.70/1.10 37 (wt=4) [flip(1)] suc(four) = five. % 0.70/1.10 42 (wt=4) [back_demod(40),demod([41])] suc(nine) = ten. % 0.70/1.10 44 (wt=4) [demod([42]),flip(1)] suc(ten) = eleven. % 0.70/1.10 50 (wt=4) [] concat(nil2) = nil. % 0.70/1.10 54 (wt=4) [] and2(nil4) = btrue. % 0.70/1.10 65 (wt=4) [] petersen4(zero) = nil. % 0.70/1.10 13 (wt=5) [] predNat(suc(A)) = A. % 0.70/1.10 25 (wt=5) [] lt(zero,zero) = bfalse. % 0.70/1.10 31 (wt=5) [] index(nil3,A) = nothing. % 0.70/1.10 39 (wt=5) [flip(1)] suc(suc(five)) = seven. % 0.70/1.10 41 (wt=5) [flip(1)] suc(suc(seven)) = nine. % 0.70/1.10 45 (wt=5) [] colouring(A,nil) = nil4. % 0.70/1.10 48 (wt=5) [] append(nil,A) = A. % 0.70/1.10 52 (wt=5) [] andb(btrue,A) = A. % 0.70/1.10 53 (wt=5) [] andb(bfalse,A) = bfalse. % 27.67/28.03 57 (wt=5) [] add(zero,A) = A. % 27.67/28.03 59 (wt=5) [] petersen(A,nil) = nil2. % 27.67/28.03 62 (wt=5) [] petersen3(A,nil3) = nil. % 27.67/28.03 67 (wt=5) [flip(1)] add(ten,eleven) = twentyOne. % 27.67/28.03 68 (wt=5) [flip(1)] add(twentyOne,ten) = thirtyOne. % 27.67/28.03 70 (wt=5) [] eq2(bfalse,btrue) = bfalse. % 27.67/28.03 71 (wt=5) [] eq2(btrue,bfalse) = bfalse. % 27.67/28.03 75 (wt=5) [] eq(A,A) = btrue. % 27.67/28.03 76 (wt=5) [] eq2(A,A) = btrue. % 27.67/28.03 1 (wt=6) [] aux(A,B,btrue) = nil3. % 27.67/28.03 26 (wt=6) [] lt(zero,suc(A)) = btrue. % 27.67/28.03 27 (wt=6) [] lt(suc(A),zero) = bfalse. % 27.67/28.03 73 (wt=6) [] eq(zero,suc(A)) = bfalse. % 27.67/28.03 74 (wt=6) [] eq(suc(A),zero) = bfalse. % 27.67/28.03 32 (wt=8) [] index(cons3(A,B),zero) = just(A). % 27.67/28.03 33 (wt=8) [flip(32)] just(A) = index(cons3(A,B),zero). % 27.67/28.03 56 (wt=8) [flip(1)] and2(colouring(A,B)) = colouring2(B,A). % 27.67/28.03 28 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B). % 27.67/28.03 51 (wt=9) [] concat(cons2(A,B)) = append(A,concat(B)). % 27.67/28.03 55 (wt=9) [] and2(cons4(A,B)) = andb(A,and2(B)). % 27.67/28.03 58 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B). % 27.67/28.03 72 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B). % 27.67/28.03 34 (wt=10) [] index(cons3(A,B),suc(C)) = index(B,C). % 27.67/28.03 43 (wt=10) [flip(1)] aux(A,B,lt(B,A)) = enumFromToNat(A,B). % 27.67/28.03 2 (wt=11) [flip(1)] cons3(A,enumFromToNat(suc(A),B)) = aux(A,B,bfalse). % 27.67/28.03 30 (wt=11) [] prop_p31(cons3(A,B)) = cons4(lt(A,three),prop_p31(B)). % 27.67/28.03 49 (wt=11) [flip(1)] cons(A,append(B,C)) = append(cons(A,B),C). % 27.67/28.03 3 (wt=12) [] aux2(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 27.67/28.03 4 (wt=12) [flip(3)] cons4(bfalse,colouring(A,B)) = aux2(A,B,C,D,nothing). % 27.67/28.03 7 (wt=12) [] aux3(A,B,C,D,nothing) = cons4(bfalse,colouring(A,B)). % 27.67/28.03 8 (wt=12) [flip(7)] cons4(bfalse,colouring(A,B)) = aux3(A,B,C,D,nothing). % 27.67/28.03 15 (wt=12) [] petersen2(cons3(A,B)) = cons(pair2(A,suc(A)),petersen2(B)). % 27.67/28.03 16 (wt=12) [flip(15)] cons(pair2(A,suc(A)),petersen2(B)) = petersen2(cons3(A,B)). % 27.67/28.03 69 (wt=12) [] prop_p312(A) = notb(andb(colouring2(petersen4(thirtyOne),A),and2(prop_p31(A)))). % 27.67/28.03 77 (wt=13) [demod([69])] -(eq2(notb(andb(colouring2(petersen4(thirtyOne),A),and2(prop_p31(A)))),bfalse) = btrue). % 27.67/28.03 5 (wt=16) [] aux2(A,B,C,D,just(E)) = cons4(notb(eq(D,E)),colouring(A,B)). % 27.67/28.03 6 (wt=16) [flip(5)] cons4(notb(eq(A,B)),colouring(C,D)) = aux2(C,D,E,A,just(B)). % 27.67/28.03 9 (wt=16) [] aux3(A,B,C,D,just(E)) = aux2(A,B,D,E,index(A,D)). % 27.67/28.03 10 (wt=16) [flip(9)] aux2(A,B,C,D,index(A,C)) = aux3(A,B,E,C,just(D)). % 27.67/28.03 46 (wt=16) [] colouring(A,cons(pair2(B,C),D)) = aux3(A,D,B,C,index(A,B)). % 27.67/28.03 47 (wt=16) [flip(46)] aux3(A,B,C,D,index(A,C)) = colouring(A,cons(pair2(C,D),B)). % 27.67/28.03 63 (wt=16) [] petersen3(A,cons3(B,C)) = cons(pair2(B,add(suc(A),B)),petersen3(A,C)). % 27.67/28.03 64 (wt=16) [flip(63)] cons(pair2(A,add(suc(B),A)),petersen3(B,C)) = petersen3(B,cons3(A,C)). % 27.67/28.03 66 (wt=22) [] petersen4(suc(A)) = append(concat(petersen(A,cons(pair2(A,zero),petersen2(enumFromToNat(zero,A))))),petersen3(A,enumFromToNat(zero,suc(A)))). % 27.67/28.03 60 (wt=27) [] petersen(A,cons(pair2(B,C),D)) = cons2(cons(pair2(B,C),cons(pair2(add(suc(A),B),add(suc(A),C)),nil)),petersen(A,D)). % 27.67/28.03 61 (wt=27) [flip(60)] cons2(cons(pair2(A,B),cons(pair2(add(suc(C),A),add(suc(C),B)),nil)),petersen(C,D)) = petersen(C,cons(pair2(A,B),D)). % 27.67/28.03 end_of_list. % 27.67/28.03 % 27.67/28.03 Demodulators: % 27.67/28.03 1 (wt=6) [] aux(A,B,btrue) = nil3. % 27.67/28.03 2 (wt=11) [flip(1)] cons3(A,enumFromToNat(suc(A),B)) = aux(A,B,bfalse). % 27.67/28.03 12 (wt=4) [] predNat(zero) = zero. % 27.67/28.03 13 (wt=5) [] predNat(suc(A)) = A. % 27.67/28.03 14 (wt=4) [] petersen2(nil3) = nil. % 27.67/28.03 17 (wt=4) [flip(1)] suc(zero) = one. % 27.67/28.03 19 (wt=4) [flip(1)] suc(one) = two. % 27.67/28.03 21 (wt=4) [flip(1)] suc(two) = three. % 27.67/28.03 23 (wt=4) [] notb(btrue) = bfalse. % 27.67/28.03 24 (wt=4) [] notb(bfalse) = btrue. % 27.67/28.03 25 (wt=5) [] lt(zero,zero) = bfalse. % 27.67/28.03 26 (wt=6) [] lt(zero,suc(A)) = btrue. % 27.67/28.03 27 (wt=6) [] lt(suc(A),zero) = bfalse. % 27.67/28.03 28 (wt=9) [] lt(suc(A),suc(B)) = lt(A,B). % 27.67/28.03 29 (wt=4) [] prop_p31(nil3) = nil4. % 27.67/28.03 30 (wt=11) [] prop_p31(cons3(A,B)) = cons4(lt(A,three),prop_p31(B)). % 27.67/28.03 31 (wt=5) [] index(nil3,A) = nothing. % 27.67/28.03 34 (wt=10) [] index(cons3(A,B),suc(C)) = index(B,C). % 27.67/28.03 35 (wt=4) [flip(1)] suc(three) = four. % 27.67/28.03 37 (wt=4) [flip(1)] suc(four) = five. % 27.67/28.03 39 (wt=5) [flip(1)] suc(suc(five)) = seven. % 27.67/28.03 41 (wt=5) [flip(1)] suc(suc(seven)) = nine. % 27.67/28.03 42 (wt=4) [back_demod(40),demod([41])] suc(nine) = ten. % 27.67/28.03 43 (wt=10) [flip(1)] aux(A,B,lt(B,A)) = enumFromToNat(A,B). % 27.67/28.03 44 (wt=4) [demod([42]),flip(1)] suc(ten) = eleven. % 27.67/28.03 45 (wt=5) [] colouring(A,nil) = nil4. % 27.67/28.03 48 (wt=5) [] append(nil,A) = A. % 27.67/28.03 49 (wt=11) [flip(1)] cons(A,append(B,C)) = append(cons(A,B),C). % 27.67/28.03 50 (wt=4) [] concat(nil2) = nil. % 27.67/28.03 51 (wt=9) [] concat(cons2(A,B)) = append(A,concat(B)). % 27.67/28.03 52 (wt=5) [] andb(btrue,A) = A. % 27.67/28.03 53 (wt=5) [] andb(bfalse,A) = bfalse. % 27.67/28.03 54 (wt=4) [] and2(nil4) = btrue. % 27.67/28.03 55 (wt=9) [] and2(cons4(A,B)) = andb(A,and2(B)). % 27.67/28.03 56 (wt=8) [flip(1)] and2(colouring(A,B)) = colouring2(B,A). % 27.67/28.03 57 (wt=5) [] add(zero,A) = A. % 27.67/28.03 58 (wt=9) [flip(1)] suc(add(A,B)) = add(suc(A),B). % 27.67/28.03 59 (wt=5) [] petersen(A,nil) = nil2. % 27.67/28.03 62 (wt=5) [] petersen3(A,nil3) = nil. % 27.67/28.03 65 (wt=4) [] petersen4(zero) = nil. % 27.67/28.03 66 (wt=22) [] petersen4(suc(A)) = append(concat(petersen(A,cons(pair2(A,zero),petersen2(enumFromToNat(zero,A))))),petersen3(A,enumFromToNat(zero,suc(A)))). % 27.67/28.03 67 (wt=5) [flip(1)] add(ten,eleven) = twentyOne. % 27.67/28.03 68 (wt=5) [flip(1)] add(twentyOne,ten) = thirtyOne. % 27.67/28.03 69 (wt=12) [] prop_p312(A) = notb(andb(colouring2(petersen4(thirtyOne),A),and2(prop_p31(A)))). % 27.67/28.03 70 (wt=5) [] eq2(bfalse,btrue) = bfalse. % 27.67/28.03 71 (wt=5) [] eq2(btrue,bfalse) = bfalse. % 27.67/28.03 72 (wt=9) [] eq(suc(A),suc(B)) = eq(A,B). % 27.67/28.03 73 (wt=6) [] eq(zero,suc(A)) = bfalse. % 27.67/28.03 74 (wt=6) [] eq(suc(A),zero) = bfalse. % 27.67/28.03 75 (wt=5) [] eq(A,A) = btrue. % 27.67/28.03 76 (wt=5) [] eq2(A,A) = btrue. % 27.67/28.03 end_of_list. % 27.67/28.03 % 27.67/28.03 Passive: % 27.67/28.03 end_of_list. % 27.67/28.03 % 27.67/28.03 ------------- memory usage ------------ % 27.67/28.03 Memory dynamically allocated (tp_alloc): 63964. % 27.67/28.03 type (bytes each) gets frees in use avail bytes % 27.67/28.03 sym_ent ( 96) 110 0 110 0 10.3 K % 27.67/28.03 term ( 16) 3202070 2079131 1122939 6 21773.0 K % 27.67/28.03 gen_ptr ( 8) 4638443 403097 4235346 0 33088.6 K % 27.67/28.03 context ( 808) 53958877 53958875 2 8 7.9 K % 27.67/28.03 trail ( 12) 13220 13220 0 7 0.1 K % 27.67/28.03 bt_node ( 68) 29542564 29542561 3 27 2.0 K % 27.67/28.03 ac_position (285432) 0 0 0 0 0.0 K % 27.67/28.03 ac_match_pos (14044) 0 0 0 0 0.0 K % 27.67/28.03 ac_match_free_vars_pos (4020) % 27.67/28.03 0 0 0 0 0.0 K % 27.67/28.03 discrim ( 12) 454566 58747 395819 0 4638.5 K % 27.67/28.03 flat ( 40) 7518942 7518942 0 55 2.1 K % 27.67/28.03 discrim_pos ( 12) 101774 101774 0 1 0.0 K % 27.67/28.03 fpa_head ( 12) 17454 0 17454 0 204.5 K % 27.67/28.03 fpa_tree ( 28) 49053 49053 0 27 0.7 K % 27.67/28.03 fpa_pos ( 36) 47884 47884 0 1 0.0 K % 27.67/28.03 literal ( 12) 177255 136414 40841 1 478.6 K % 27.67/28.03 clause ( 24) 177255 136414 40841 1 957.2 K % 27.67/28.03 list ( 12) 7102 7046 56 9 0.8 K % 27.67/28.03 list_pos ( 20) 143830 31279 112551 0 2198.3 K % 27.67/28.03 pair_index ( 40) 2 0 2 0 0.1 K % 27.67/28.03 % 27.67/28.03 -------------- statistics ------------- % 27.67/28.03 Clauses input 61 % 27.67/28.03 Usable input 0 % 27.67/28.03 Sos input 61 % 27.67/28.03 Demodulators input % 27.67/28.03 % 27.67/28.03 ********** ABNORMAL END ********** % 27.67/28.03 ********** in tp_alloc, max_mem parameter exceeded. % 27.67/28.03 0 % 27.67/28.03 Passive input 0 % 27.67/28.03 % 27.67/28.03 Processed BS (before search) 86 % 27.67/28.03 Forward subsumed BS 9 % 27.67/28.03 Kept BS 77 % 27.67/28.03 New demodulators BS 58 % 27.67/28.03 Back demodulated BS 7 % 27.67/28.03 % 27.67/28.03 Clauses or pairs given 3981145 % 27.67/28.03 Clauses generated 94615 % 27.67/28.03 Forward subsumed 53851 % 27.67/28.03 Deleted by weight 0 % 27.67/28.03 Deleted by variable count 0 % 27.67/28.03 Kept 40764 % 27.67/28.03 New demodulators 6985 % 27.67/28.03 Back demodulated 6885 % 27.67/28.03 Ordered paramod prunes 0 % 27.67/28.03 Basic paramod prunes 13102136 % 27.67/28.03 Prime paramod prunes 1742 % 27.67/28.03 Semantic prunes 0 % 27.67/28.03 % 27.67/28.03 Rewrite attmepts 1758090 % 27.67/28.03 Rewrites 60575 % 27.67/28.03 % 27.67/28.03 FPA overloads 0 % 27.67/28.03 FPA underloads 0 % 27.67/28.03 % 27.67/28.03 Usable size 0 % 27.67/28.03 Sos size 33948 % 27.67/28.03 Demodulators size 3814 % 27.67/28.03 Passive size 0 % 27.67/28.03 Disabled size 6892 % 27.67/28.03 % 27.67/28.03 Proofs found 0 % 27.67/28.03 % 27.67/28.03 ----------- times (seconds) ----------- Tue May 5 13:02:48 2026 % 27.67/28.03 % 27.67/28.03 user CPU time 16.56 (0 hr, 0 min, 16 sec) % 27.67/28.03 system CPU time 10.37 (0 hr, 0 min, 10 sec) % 27.67/28.03 wall-clock time 27 (0 hr, 0 min, 27 sec) % 27.67/28.03 input time 0.00 % 27.67/28.03 paramodulation time 2.62 % 27.67/28.03 demodulation time 0.23 % 27.67/28.03 orient time 0.18 % 27.67/28.03 weigh time 0.04 % 27.67/28.03 forward subsume time 0.15 % 27.67/28.03 back demod find time 0.37 % 27.67/28.03 conflict time 0.02 % 27.67/28.03 LRPO time 0.10 % 27.67/28.03 store clause time 8.64 % 27.67/28.03 disable clause time 1.45 % 27.67/28.03 prime paramod time 0.05 % 27.67/28.03 semantics time 0.00 % 27.67/28.03 % 27.67/28.03 EQP interrupted %------------------------------------------------------------------------------