0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.03/0.23 % Computer : n172.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.23 % CPULimit : 300 0.03/0.23 % DateTime : Sat Jul 14 06:57:57 CDT 2018 0.03/0.23 % CPUTime : 0.07/0.52 ============================== Prover9 =============================== 0.07/0.52 Prover9 (32) version 2009-11A, November 2009. 0.07/0.52 Process 46226 was started by sandbox2 on n172.star.cs.uiowa.edu, 0.07/0.52 Sat Jul 14 06:57:57 2018 0.07/0.52 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_46194_n172.star.cs.uiowa.edu". 0.07/0.52 ============================== end of head =========================== 0.07/0.52 0.07/0.52 ============================== INPUT ================================= 0.07/0.52 0.07/0.52 % Reading from file /tmp/Prover9_46194_n172.star.cs.uiowa.edu 0.07/0.52 0.07/0.52 set(prolog_style_variables). 0.07/0.52 set(auto2). 0.07/0.52 % set(auto2) -> set(auto). 0.07/0.52 % set(auto) -> set(auto_inference). 0.07/0.52 % set(auto) -> set(auto_setup). 0.07/0.52 % set(auto_setup) -> set(predicate_elim). 0.07/0.52 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.52 % set(auto) -> set(auto_limits). 0.07/0.52 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.52 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.52 % set(auto) -> set(auto_denials). 0.07/0.52 % set(auto) -> set(auto_process). 0.07/0.52 % set(auto2) -> assign(new_constants, 1). 0.07/0.52 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.52 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.52 % set(auto2) -> assign(max_hours, 1). 0.07/0.52 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.52 % set(auto2) -> assign(max_seconds, 0). 0.07/0.52 % set(auto2) -> assign(max_minutes, 5). 0.07/0.52 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.52 % set(auto2) -> set(sort_initial_sos). 0.07/0.52 % set(auto2) -> assign(sos_limit, -1). 0.07/0.52 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.52 % set(auto2) -> assign(max_megs, 400). 0.07/0.52 % set(auto2) -> assign(stats, some). 0.07/0.52 % set(auto2) -> clear(echo_input). 0.07/0.52 % set(auto2) -> set(quiet). 0.07/0.52 % set(auto2) -> clear(print_initial_clauses). 0.07/0.52 % set(auto2) -> clear(print_given). 0.07/0.52 assign(lrs_ticks,-1). 0.07/0.52 assign(sos_limit,10000). 0.07/0.52 assign(order,kbo). 0.07/0.52 set(lex_order_vars). 0.07/0.52 clear(print_given). 0.07/0.52 0.07/0.52 % formulas(sos). % not echoed (96 formulas) 0.07/0.52 0.07/0.52 ============================== end of input ========================== 0.07/0.52 0.07/0.52 % From the command line: assign(max_seconds, 300). 0.07/0.52 0.07/0.52 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.52 0.07/0.52 % Formulas that are not ordinary clauses: 0.07/0.52 1 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (rearsegP(V,W) & rearsegP(U,V) -> rearsegP(U,W)))))))) # label(ax47) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 2 (all U (ssList(U) -> (all V (ssList(V) -> (nil != U -> tl(app(U,V)) = app(tl(U),V)))))) # label(ax86) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 3 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(V,U) & segmentP(U,V) -> V = U))))) # label(ax54) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 4 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) -> lt(U,V) | U = V))))) # label(ax92) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 5 (all U (ssList(U) -> (all V (ssItem(V) -> U = tl(cons(V,U)))))) # label(ax25) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 6 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 7 (all U (ssList(U) -> (all V (ssList(V) -> (frontsegP(U,V) <-> (exists W (app(V,W) = U & ssList(W)))))))) # label(ax5) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 8 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(V,U) <-> gt(U,V)))))) # label(ax35) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 9 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 10 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (U = app(app(X,cons(V,Y)),cons(W,Z)) -> lt(V,W)))))))))))) <-> strictorderedP(U)))) # label(ax12) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 11 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> (segmentP(U,V) -> segmentP(app(app(W,U),X),V)))))))))) # label(ax56) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 12 (all U (ssList(U) -> (segmentP(nil,U) <-> U = nil))) # label(ax58) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 13 (all U (ssItem(U) -> (all V (ssItem(V) -> (V != U <-> neq(U,V)))))) # label(ax1) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 14 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (U = app(X,cons(V,cons(W,Y))) -> W = V))))))))) <-> equalelemsP(U)))) # label(ax14) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 15 (all U (ssList(U) -> (nil = U <-> frontsegP(nil,U)))) # label(ax46) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 16 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> -(leq(W,V) & leq(V,W))))))))))))) <-> cyclefreeP(U)))) # label(ax8) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 17 (all U (ssList(U) -> (all V (ssList(V) -> (nil != U & tl(V) = tl(U) & hd(U) = hd(V) & nil != V -> V = U))))) # label(ax77) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 18 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 19 (all U (ssList(U) -> (duplicatefreeP(U) <-> (all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (U = app(app(X,cons(V,Y)),cons(W,Z)) -> V != W)))))))))))))) # label(ax13) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 20 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 21 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) = app(cons(V,nil),U))))) # label(ax81) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 22 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (memberP(W,U) | V = U <-> memberP(cons(V,W),U)))))))) # label(ax37) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 23 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(V,U) <-> geq(U,V)))))) # label(ax32) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 24 (all U (ssList(U) -> (U != nil -> cons(hd(U),tl(U)) = U))) # label(ax78) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 25 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (geq(V,W) & geq(U,V) -> geq(U,W)))))))) # label(ax88) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 26 (all U (ssList(U) -> (all V (ssItem(V) -> (memberP(U,V) <-> (exists W (ssList(W) & (exists X (ssList(X) & U = app(W,cons(V,X))))))))))) # label(ax3) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 27 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(V,W) = app(V,U) -> U = W))))))) # label(ax80) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 28 (all U (ssList(U) -> (all V (ssList(V) -> ((exists W (ssList(W) & (exists X (ssList(X) & app(app(W,V),X) = U)))) <-> segmentP(U,V)))))) # label(ax7) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 29 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (all X (ssList(X) -> (frontsegP(cons(U,W),cons(V,X)) <-> V = U & frontsegP(W,X)))))))))) # label(ax44) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 30 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 31 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 32 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (segmentP(V,W) & segmentP(U,V) -> segmentP(U,W)))))))) # label(ax53) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 33 (all U (ssList(U) -> (singletonP(U) <-> (exists V (cons(V,nil) = U & ssItem(V)))))) # label(ax4) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 34 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 35 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(U,V) <-> (exists W (ssList(W) & app(W,V) = U))))))) # label(ax6) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 36 (all U (ssList(U) -> (all V (ssList(V) -> (nil != U -> hd(U) = hd(app(U,V))))))) # label(ax85) # label(axiom) # label(non_clause). [assumption]. 0.07/0.52 37 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> (all X (ssItem(X) -> (cons(X,V) = cons(W,U) -> V = U & X = W))))))))) # label(ax19) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 38 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 39 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 40 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 41 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 42 (all U (ssList(U) -> (all V (ssList(V) -> (V != U <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 43 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (rearsegP(U,V) -> rearsegP(app(W,U),V)))))))) # label(ax50) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 44 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(V,U) & rearsegP(U,V) -> V = U))))) # label(ax48) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 45 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 46 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (lt(V,W) & leq(U,V) -> lt(U,W)))))))) # label(ax91) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 47 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> app(app(U,V),W) = app(U,app(V,W)))))))) # label(ax82) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 48 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (frontsegP(U,V) -> frontsegP(app(U,W),V)))))))) # label(ax43) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 49 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (frontsegP(U,V) & frontsegP(V,W) -> frontsegP(U,W)))))))) # label(ax40) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 50 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) & leq(V,U) -> V = U))))) # label(ax29) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 51 (all U (ssList(U) -> (U != nil -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 52 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 53 (all U (ssList(U) -> (U != nil -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 54 (all U (ssList(U) -> U = nil | (exists V (ssList(V) & (exists W (ssItem(W) & cons(W,V) = U)))))) # label(ax20) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 55 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(W,V) = app(U,V) -> W = U))))))) # label(ax79) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 56 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 57 (all U (ssList(U) -> (U != nil -> (exists V (tl(U) = V & ssList(V)))))) # label(ax76) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 58 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (gt(V,W) & gt(U,V) -> gt(U,W)))))))) # label(ax95) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 59 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 60 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(V,U) & geq(U,V) -> V = U))))) # label(ax87) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 61 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> lt(W,V) | lt(V,W)))))))))))) <-> strictorderP(U)))) # label(ax10) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 62 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 63 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != nil)))) # label(ax21) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 64 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 65 (exists U ((exists V (U != V & ssItem(V))) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 66 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 67 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) <-> leq(U,V) & V != U))))) # label(ax93) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 68 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 69 (all U (ssList(U) -> ((all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> leq(V,W)))))))))))) <-> totalorderedP(U)))) # label(ax11) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 70 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 71 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (lt(U,V) & lt(V,W) -> lt(U,W)))))))) # label(ax34) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 72 (all U (ssList(U) -> (totalorderP(U) <-> (all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (all Z (ssList(Z) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> leq(V,W) | leq(W,V))))))))))))))) # label(ax9) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 73 (all U (ssItem(U) -> (all V (ssList(V) -> (strictorderedP(cons(U,V)) <-> V != nil & lt(U,hd(V)) & strictorderedP(V) | V = nil))))) # label(ax70) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 74 (all U (ssList(U) -> (U = nil <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 75 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> app(cons(W,V),U) = cons(W,app(V,U)))))))) # label(ax27) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 76 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 77 (all U (ssItem(U) -> (all V (ssList(V) -> (nil = V | nil != V & leq(U,hd(V)) & totalorderedP(V) <-> totalorderedP(cons(U,V))))))) # label(ax67) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 78 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 79 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (leq(V,W) & leq(U,V) -> leq(U,W)))))))) # label(ax30) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 80 (all U (ssList(U) -> (all V (ssList(V) -> (nil = app(U,V) <-> U = nil & nil = V))))) # label(ax83) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 81 (all U (ssList(U) -> (all V (ssList(V) -> (frontsegP(U,V) & frontsegP(V,U) -> U = V))))) # label(ax41) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 82 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 83 (all U (ssList(U) -> (U != nil -> (exists V (hd(U) = V & ssItem(V)))))) # label(ax75) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 84 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 85 (all U (ssList(U) -> (all V (ssItem(V) -> U != cons(V,U))))) # label(ax18) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 86 (all U (ssItem(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (memberP(W,U) | memberP(V,U) <-> memberP(app(V,W),U)))))))) # label(ax36) # label(axiom) # label(non_clause). [assumption]. 0.07/0.53 87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> -neq(V,nil) | (exists Y (neq(W,Y) & segmentP(X,Y) & strictorderedP(Y) & segmentP(Y,W) & ssList(Y))) | segmentP(V,U) & neq(U,nil) | -strictorderedP(W) | -segmentP(X,W) | U != W | X != V)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.07/0.53 0.07/0.53 ============================== end of process non-clausal formulas === 0.07/0.53 0.07/0.53 ============================== PROCESS INITIAL CLAUSES =============== 0.07/0.53 0.07/0.53 ============================== PREDICATE ELIMINATION ================= 0.07/0.53 88 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.07/0.55 89 -ssList(A) | ssItem(f7(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.07/0.55 90 -ssList(A) | ssItem(f8(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.07/0.55 91 -ssList(A) | ssList(f9(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.07/0.55 92 -ssList(A) | ssList(f10(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.07/0.55 93 -ssList(A) | app(f9(A),cons(f7(A),cons(f8(A),f10(A)))) = A | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.07/0.55 94 -ssList(A) | f8(A) != f7(A) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssItem(f7(A)). [resolve(88,h,89,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssItem(f8(A)). [resolve(88,h,90,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssList(f9(A)). [resolve(88,h,91,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | ssList(f10(A)). [resolve(88,h,92,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | app(f9(A),cons(f7(A),cons(f8(A),f10(A)))) = A. [resolve(88,h,93,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B | -ssList(A) | f8(A) != f7(A). [resolve(88,h,94,c)]. 0.07/0.55 95 equalelemsP(nil) # label(ax74) # label(axiom). [assumption]. 0.07/0.55 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A. [resolve(95,a,88,h)]. 0.07/0.55 96 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom). [clausify(62)]. 0.07/0.55 Derived: -ssItem(A) | -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != cons(A,nil) | C = B. [resolve(96,b,88,h)]. 0.07/0.55 97 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 98 -ssList(A) | ssItem(f11(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 99 -ssList(A) | ssItem(f12(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 100 -ssList(A) | ssList(f13(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 101 -ssList(A) | ssList(f14(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 102 -ssList(A) | ssList(f15(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 103 -ssList(A) | app(app(f13(A),cons(f11(A),f14(A))),cons(f12(A),f15(A))) = A | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 104 -ssList(A) | leq(f12(A),f11(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 105 -ssList(A) | leq(f11(A),f12(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssItem(f11(A)). [resolve(97,j,98,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssItem(f12(A)). [resolve(97,j,99,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssList(f13(A)). [resolve(97,j,100,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssList(f14(A)). [resolve(97,j,101,c)]. 0.07/0.55 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | ssList(f15(A)). [resolve(97,j,102,c)]. 0.43/0.63 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | app(app(f13(A),cons(f11(A),f14(A))),cons(f12(A),f15(A))) = A. [resolve(97,j,103,c)]. 0.43/0.63 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | leq(f12(A),f11(A)). [resolve(97,j,104,c)]. 0.43/0.63 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | -leq(C,B) | -leq(B,C) | -ssList(A) | leq(f11(A),f12(A)). [resolve(97,j,105,c)]. 0.43/0.63 106 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom). [clausify(70)]. 0.43/0.63 Derived: -ssItem(A) | -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != cons(A,nil) | -leq(C,B) | -leq(B,C). [resolve(106,b,97,j)]. 0.43/0.63 107 cyclefreeP(nil) # label(ax60) # label(axiom). [assumption]. 0.43/0.63 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | -leq(B,A) | -leq(A,B). [resolve(107,a,97,j)]. 0.43/0.63 108 -ssList(A) | duplicatefreeP(A) | ssItem(f16(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 109 -ssList(A) | -duplicatefreeP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 Derived: -ssList(A) | ssItem(f16(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B. [resolve(108,b,109,b)]. 0.43/0.63 110 -ssList(A) | duplicatefreeP(A) | ssItem(f17(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 Derived: -ssList(A) | ssItem(f17(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B. [resolve(110,b,109,b)]. 0.43/0.63 111 -ssList(A) | duplicatefreeP(A) | ssList(f18(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 Derived: -ssList(A) | ssList(f18(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B. [resolve(111,b,109,b)]. 0.43/0.63 112 -ssList(A) | duplicatefreeP(A) | ssList(f19(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 Derived: -ssList(A) | ssList(f19(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B. [resolve(112,b,109,b)]. 0.43/0.63 113 -ssList(A) | duplicatefreeP(A) | ssList(f20(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 Derived: -ssList(A) | ssList(f20(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B. [resolve(113,b,109,b)]. 0.43/0.63 114 -ssList(A) | duplicatefreeP(A) | app(app(f18(A),cons(f16(A),f19(A))),cons(f17(A),f20(A))) = A # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 Derived: -ssList(A) | app(app(f18(A),cons(f16(A),f19(A))),cons(f17(A),f20(A))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B. [resolve(114,b,109,b)]. 0.43/0.63 115 -ssList(A) | duplicatefreeP(A) | f17(A) = f16(A) # label(ax13) # label(axiom). [clausify(19)]. 0.43/0.63 Derived: -ssList(A) | f17(A) = f16(A) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | C != B. [resolve(115,b,109,b)]. 0.43/0.63 116 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom). [clausify(68)]. 0.43/0.63 Derived: -ssItem(A) | -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != cons(A,nil) | C != B. [resolve(116,b,109,b)]. 0.43/0.63 117 duplicatefreeP(nil) # label(ax72) # label(axiom). [assumption]. 0.43/0.63 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | B != A. [resolve(117,a,109,b)]. 0.43/0.63 118 -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 119 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom). [clausify(31)]. 0.47/0.71 120 strictorderP(nil) # label(ax64) # label(axiom). [assumption]. 0.47/0.71 121 -ssList(A) | ssItem(f30(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 122 -ssList(A) | ssItem(f31(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 123 -ssList(A) | ssList(f32(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 124 -ssList(A) | ssList(f33(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 125 -ssList(A) | ssList(f34(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 126 -ssList(A) | app(app(f32(A),cons(f30(A),f33(A))),cons(f31(A),f34(A))) = A | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 127 -ssList(A) | -lt(f31(A),f30(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 128 -ssList(A) | -lt(f30(A),f31(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.47/0.71 Derived: -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != cons(A,nil) | lt(C,B) | lt(B,C) | -ssItem(A). [resolve(118,j,119,b)]. 0.47/0.71 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | lt(B,A) | lt(A,B). [resolve(118,j,120,a)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssItem(f30(A)). [resolve(118,j,121,c)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssItem(f31(A)). [resolve(118,j,122,c)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssList(f32(A)). [resolve(118,j,123,c)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssList(f33(A)). [resolve(118,j,124,c)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | ssList(f34(A)). [resolve(118,j,125,c)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | app(app(f32(A),cons(f30(A),f33(A))),cons(f31(A),f34(A))) = A. [resolve(118,j,126,c)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | -lt(f31(A),f30(A)). [resolve(118,j,127,c)]. 0.47/0.71 Derived: -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(C,B) | lt(B,C) | -ssList(A) | -lt(f30(A),f31(A)). [resolve(118,j,128,c)]. 0.47/0.71 129 -ssList(A) | -totalorderP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B) # label(ax9) # label(axiom). [clausify(72)]. 0.47/0.71 130 totalorderP(nil) # label(ax62) # label(axiom). [assumption]. 0.47/0.71 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | leq(A,B) | leq(B,A). [resolve(129,b,130,a)]. 0.47/0.71 131 -ssList(A) | totalorderP(A) | ssItem(f40(A)) # label(ax9) # label(axiom). [clausify(72)]. 0.47/0.71 Derived: -ssList(A) | ssItem(f40(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(131,b,129,b)]. 0.47/0.71 132 -ssList(A) | totalorderP(A) | ssItem(f41(A)) # label(ax9) # label(axiom). [clausify(72)]. 0.47/0.71 Derived: -ssList(A) | ssItem(f41(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(132,b,129,b)]. 4.94/5.14 133 -ssList(A) | totalorderP(A) | ssList(f42(A)) # label(ax9) # label(axiom). [clausify(72)]. 4.94/5.14 Derived: -ssList(A) | ssList(f42(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(133,b,129,b)]. 4.94/5.14 134 -ssList(A) | totalorderP(A) | ssList(f43(A)) # label(ax9) # label(axiom). [clausify(72)]. 4.94/5.14 Derived: -ssList(A) | ssList(f43(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(134,b,129,b)]. 4.94/5.14 135 -ssList(A) | totalorderP(A) | ssList(f44(A)) # label(ax9) # label(axiom). [clausify(72)]. 4.94/5.14 Derived: -ssList(A) | ssList(f44(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(135,b,129,b)]. 4.94/5.14 136 -ssList(A) | totalorderP(A) | app(app(f42(A),cons(f40(A),f43(A))),cons(f41(A),f44(A))) = A # label(ax9) # label(axiom). [clausify(72)]. 4.94/5.14 Derived: -ssList(A) | app(app(f42(A),cons(f40(A),f43(A))),cons(f41(A),f44(A))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(136,b,129,b)]. 4.94/5.14 137 -ssList(A) | totalorderP(A) | -leq(f40(A),f41(A)) # label(ax9) # label(axiom). [clausify(72)]. 4.94/5.14 Derived: -ssList(A) | -leq(f40(A),f41(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(137,b,129,b)]. 4.94/5.14 138 -ssList(A) | totalorderP(A) | -leq(f41(A),f40(A)) # label(ax9) # label(axiom). [clausify(72)]. 4.94/5.14 Derived: -ssList(A) | -leq(f41(A),f40(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | leq(B,C) | leq(C,B). [resolve(138,b,129,b)]. 4.94/5.14 139 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom). [clausify(76)]. 4.94/5.14 Derived: -ssItem(A) | -ssList(cons(A,nil)) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != cons(A,nil) | leq(B,C) | leq(C,B). [resolve(139,b,129,b)]. 4.94/5.14 4.94/5.14 ============================== end predicate elimination ============= 4.94/5.14 4.94/5.14 Auto_denials: (non-Horn, no changes). 4.94/5.14 4.94/5.14 Term ordering decisions: 4.94/5.14 Function symbol KB weights: nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. cons=1. app=1. f1=1. f21=1. f22=1. f23=1. f24=1. f26=1. hd=1. tl=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f25=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. f42=1. f43=1. f44=1. f45=1. 4.94/5.14 4.94/5.14 ============================== end of process initial clauses ======== 4.94/5.14 4.94/5.14 ============================== CLAUSES FOR SEARCH ==================== 4.94/5.14 4.94/5.14 ============================== end of clauses for search ============= 4.94/5.14 4.94/5.14 ============================== SEARCH ================================ 4.94/5.14 4.94/5.14 % Starting search at 0.65 seconds. 4.94/5.14 4.94/5.14 Low Water (keep): wt=38.000, iters=3516 4.94/5.14 4.94/5.14 Low Water (keep): wt=35.000, iters=3399 4.94/5.14 4.94/5.14 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 50 (0.00 of 1.44 sec). 4.94/5.14 4.94/5.14 Low Water (keep): wt=33.000, iters=3355 4.94/5.14 4.94/5.14 Low Water (keep): wt=32.000, iters=3458 4.94/5.14 4.94/5.14 Low Water (keep): wt=31.000, iters=3420 4.94/5.14 4.94/5.14 Low Water (keep): wt=30.000, iters=3602 4.94/5.14 4.94/5.14 Low Water (keep): wt=29.000, iters=3549 4.94/5.14 4.94/5.14 Low Water (keep): wt=28.000, iters=3634 4.94/5.14 4.94/5.14 Low Water (keep): wt=25.000, iters=3773 4.94/5.14 4.94/5.14 Low Water (keep): wt=23.000, iters=3339 4.94/5.14 4.94/5.14 Low Water (keep): wt=22.000, iters=3409 4.94/5.14 4.94/5.14 Low Water (keep): wt=21.000, iters=3425 4.94/5.14 4.94/5.14 Low Water (keep): wt=20.000, iters=3426 4.94/5.14 4.94/5.14 Low Water (keep): wt=19.000, iters=3354 4.94/5.14 4.94/5.14 Low Water (keep): wt=18.000, iters=3367 4.94/5.14 4.94/5.14 Low Water (keep): wt=17.000, iters=3425 4.94/5.14 4.94/5.14 Low Water (keep): wt=16.000, iters=3386 4.94/5.14 4.94/5.14 Low Water (displace): id=6147, wt=46.000 4.94/5.14 4.94/5.14 Low Water (displace): id=5863, wt=44.000 4.94/5.14 4.94/5.14 Low Water (displace): id=3732, wt=43.000 4.94/5.14 4.94/5.14 Low Water (displace): iCputime limit exceeded (core dumped) 300.08/300.33 EOF