0.00/0.06 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.06 % Command : tptp2X_and_run_prover9 %d %s 0.03/0.36 % Computer : n163.star.cs.uiowa.edu 0.03/0.36 % Model : x86_64 x86_64 0.03/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.36 % Memory : 32218.625MB 0.03/0.36 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.36 % CPULimit : 300 0.03/0.36 % DateTime : Sat Jul 14 05:36:25 CDT 2018 0.03/0.36 % CPUTime : 0.27/0.65 ============================== Prover9 =============================== 0.27/0.65 Prover9 (32) version 2009-11A, November 2009. 0.27/0.65 Process 51975 was started by sandbox on n163.star.cs.uiowa.edu, 0.27/0.65 Sat Jul 14 05:36:25 2018 0.27/0.65 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_51866_n163.star.cs.uiowa.edu". 0.27/0.65 ============================== end of head =========================== 0.27/0.65 0.27/0.65 ============================== INPUT ================================= 0.27/0.65 0.27/0.65 % Reading from file /tmp/Prover9_51866_n163.star.cs.uiowa.edu 0.27/0.65 0.27/0.65 set(prolog_style_variables). 0.27/0.65 set(auto2). 0.27/0.65 % set(auto2) -> set(auto). 0.27/0.65 % set(auto) -> set(auto_inference). 0.27/0.65 % set(auto) -> set(auto_setup). 0.27/0.65 % set(auto_setup) -> set(predicate_elim). 0.27/0.65 % set(auto_setup) -> assign(eq_defs, unfold). 0.27/0.65 % set(auto) -> set(auto_limits). 0.27/0.65 % set(auto_limits) -> assign(max_weight, "100.000"). 0.27/0.65 % set(auto_limits) -> assign(sos_limit, 20000). 0.27/0.65 % set(auto) -> set(auto_denials). 0.27/0.65 % set(auto) -> set(auto_process). 0.27/0.65 % set(auto2) -> assign(new_constants, 1). 0.27/0.65 % set(auto2) -> assign(fold_denial_max, 3). 0.27/0.65 % set(auto2) -> assign(max_weight, "200.000"). 0.27/0.65 % set(auto2) -> assign(max_hours, 1). 0.27/0.65 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.27/0.65 % set(auto2) -> assign(max_seconds, 0). 0.27/0.65 % set(auto2) -> assign(max_minutes, 5). 0.27/0.65 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.27/0.65 % set(auto2) -> set(sort_initial_sos). 0.27/0.65 % set(auto2) -> assign(sos_limit, -1). 0.27/0.65 % set(auto2) -> assign(lrs_ticks, 3000). 0.27/0.65 % set(auto2) -> assign(max_megs, 400). 0.27/0.65 % set(auto2) -> assign(stats, some). 0.27/0.65 % set(auto2) -> clear(echo_input). 0.27/0.65 % set(auto2) -> set(quiet). 0.27/0.65 % set(auto2) -> clear(print_initial_clauses). 0.27/0.65 % set(auto2) -> clear(print_given). 0.27/0.65 assign(lrs_ticks,-1). 0.27/0.65 assign(sos_limit,10000). 0.27/0.65 assign(order,kbo). 0.27/0.65 set(lex_order_vars). 0.27/0.65 clear(print_given). 0.27/0.65 0.27/0.65 % formulas(sos). % not echoed (96 formulas) 0.27/0.65 0.27/0.65 ============================== end of input ========================== 0.27/0.65 0.27/0.65 % From the command line: assign(max_seconds, 300). 0.27/0.65 0.27/0.65 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.27/0.65 0.27/0.65 % Formulas that are not ordinary clauses: 0.27/0.65 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.27/0.65 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.27/0.65 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.27/0.65 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.27/0.65 5 (all U (ssList(U) -> (all V (ssItem(V) -> U = tl(cons(V,U)))))) # label(ax25) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 6 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 8 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(V,U) <-> gt(U,V)))))) # label(ax35) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 9 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 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.27/0.65 12 (all U (ssList(U) -> (segmentP(nil,U) <-> U = nil))) # label(ax58) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 13 (all U (ssItem(U) -> (all V (ssItem(V) -> (V != U <-> neq(U,V)))))) # label(ax1) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 15 (all U (ssList(U) -> (nil = U <-> frontsegP(nil,U)))) # label(ax46) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 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.27/0.65 18 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 20 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 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.27/0.65 23 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(V,U) <-> geq(U,V)))))) # label(ax32) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 24 (all U (ssList(U) -> (U != nil -> cons(hd(U),tl(U)) = U))) # label(ax78) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 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.27/0.65 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.27/0.65 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.27/0.65 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.27/0.65 30 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 31 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 33 (all U (ssList(U) -> (singletonP(U) <-> (exists V (cons(V,nil) = U & ssItem(V)))))) # label(ax4) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 34 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause). [assumption]. 0.27/0.65 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.27/0.65 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.27/0.65 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.27/0.66 38 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 39 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 40 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 41 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 42 (all U (ssList(U) -> (all V (ssList(V) -> (V != U <-> neq(U,V)))))) # label(ax15) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 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.27/0.66 45 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 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.27/0.66 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.27/0.66 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.27/0.66 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.27/0.66 51 (all U (ssList(U) -> (U != nil -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 52 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 53 (all U (ssList(U) -> (U != nil -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 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.27/0.66 56 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 57 (all U (ssList(U) -> (U != nil -> (exists V (tl(U) = V & ssList(V)))))) # label(ax76) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 59 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 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.27/0.66 62 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 63 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != nil)))) # label(ax21) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 64 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 65 (exists U ((exists V (U != V & ssItem(V))) & ssItem(U))) # label(ax2) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 66 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 68 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 70 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 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.27/0.66 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.27/0.66 74 (all U (ssList(U) -> (U = nil <-> rearsegP(nil,U)))) # label(ax52) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 76 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 78 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 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.27/0.66 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.27/0.66 82 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 83 (all U (ssList(U) -> (U != nil -> (exists V (hd(U) = V & ssItem(V)))))) # label(ax75) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 84 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 85 (all U (ssList(U) -> (all V (ssItem(V) -> U != cons(V,U))))) # label(ax18) # label(axiom) # label(non_clause). [assumption]. 0.27/0.66 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.27/0.66 87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> nil != V | W != U | U = nil | (all Y (ssList(Y) -> X != app(W,Y) | -strictorderedP(W) | (exists Z ((exists X1 (ssList(X1) & (exists X2 ((exists X3 (ssList(X3) & W = app(X3,cons(X2,nil)) & lt(X2,Z))) & ssItem(X2))) & app(cons(Z,nil),X1) = Y)) & ssItem(Z))))) | X != nil & W = nil | X != V)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.27/0.66 0.27/0.66 ============================== end of process non-clausal formulas === 0.27/0.66 0.27/0.66 ============================== PROCESS INITIAL CLAUSES =============== 0.27/0.66 0.27/0.66 ============================== PREDICATE ELIMINATION ================= 0.27/0.66 88 -ssItem(A) | -ssItem(B) | B != A | -neq(A,B) # label(ax1) # label(axiom). [clausify(13)]. 0.34/0.68 89 -ssItem(A) | -ssItem(B) | B = A | neq(A,B) # label(ax1) # label(axiom). [clausify(13)]. 0.34/0.68 90 -ssList(A) | -ssList(B) | B = A | neq(A,B) # label(ax15) # label(axiom). [clausify(42)]. 0.34/0.68 91 -ssList(A) | -ssList(B) | B != A | -neq(A,B) # label(ax15) # label(axiom). [clausify(42)]. 0.34/0.68 92 -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.34/0.68 93 -ssList(A) | ssItem(f7(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.34/0.68 94 -ssList(A) | ssItem(f8(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.34/0.68 95 -ssList(A) | ssList(f9(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.34/0.68 96 -ssList(A) | ssList(f10(A)) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.34/0.68 97 -ssList(A) | app(f9(A),cons(f7(A),cons(f8(A),f10(A)))) = A | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.34/0.68 98 -ssList(A) | f8(A) != f7(A) | equalelemsP(A) # label(ax14) # label(axiom). [clausify(14)]. 0.34/0.68 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(92,h,93,c)]. 0.34/0.68 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(92,h,94,c)]. 0.34/0.68 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(92,h,95,c)]. 0.34/0.68 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(92,h,96,c)]. 0.34/0.68 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(92,h,97,c)]. 0.34/0.68 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(92,h,98,c)]. 0.34/0.68 99 equalelemsP(nil) # label(ax74) # label(axiom). [assumption]. 0.34/0.68 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A. [resolve(99,a,92,h)]. 0.34/0.68 100 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom). [clausify(62)]. 0.34/0.68 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(100,b,92,h)]. 0.34/0.68 101 -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.34/0.68 102 -ssList(A) | ssItem(f11(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.34/0.68 103 -ssList(A) | ssItem(f12(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.34/0.68 104 -ssList(A) | ssList(f13(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.34/0.68 105 -ssList(A) | ssList(f14(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.34/0.68 106 -ssList(A) | ssList(f15(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.34/0.68 107 -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.34/0.68 108 -ssList(A) | leq(f12(A),f11(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.34/0.68 109 -ssList(A) | leq(f11(A),f12(A)) | cyclefreeP(A) # label(ax8) # label(axiom). [clausify(16)]. 0.34/0.68 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(101,j,102,c)]. 0.34/0.68 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(101,j,103,c)]. 0.34/0.68 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(101,j,104,c)]. 0.34/0.75 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(101,j,105,c)]. 0.34/0.75 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(101,j,106,c)]. 0.34/0.75 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(101,j,107,c)]. 0.34/0.75 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(101,j,108,c)]. 0.34/0.75 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(101,j,109,c)]. 0.34/0.75 110 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom). [clausify(70)]. 0.34/0.75 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(110,b,101,j)]. 0.34/0.75 111 cyclefreeP(nil) # label(ax60) # label(axiom). [assumption]. 0.34/0.75 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(111,a,101,j)]. 0.34/0.75 112 -ssList(A) | duplicatefreeP(A) | ssItem(f16(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.34/0.75 113 -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.34/0.75 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(112,b,113,b)]. 0.34/0.75 114 -ssList(A) | duplicatefreeP(A) | ssItem(f17(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.34/0.75 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(114,b,113,b)]. 0.34/0.75 115 -ssList(A) | duplicatefreeP(A) | ssList(f18(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.34/0.75 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(115,b,113,b)]. 0.34/0.75 116 -ssList(A) | duplicatefreeP(A) | ssList(f19(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.34/0.75 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(116,b,113,b)]. 0.34/0.75 117 -ssList(A) | duplicatefreeP(A) | ssList(f20(A)) # label(ax13) # label(axiom). [clausify(19)]. 0.34/0.75 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(117,b,113,b)]. 0.34/0.75 118 -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.34/0.75 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(118,b,113,b)]. 0.34/0.75 119 -ssList(A) | duplicatefreeP(A) | f17(A) = f16(A) # label(ax13) # label(axiom). [clausify(19)]. 0.34/0.75 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(119,b,113,b)]. 0.34/0.75 120 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom). [clausify(68)]. 0.34/0.83 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(120,b,113,b)]. 0.34/0.83 121 duplicatefreeP(nil) # label(ax72) # label(axiom). [assumption]. 0.34/0.83 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(121,a,113,b)]. 0.34/0.83 122 -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.34/0.83 123 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom). [clausify(31)]. 0.34/0.83 124 strictorderP(nil) # label(ax64) # label(axiom). [assumption]. 0.34/0.83 125 -ssList(A) | ssItem(f30(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.34/0.83 126 -ssList(A) | ssItem(f31(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.34/0.83 127 -ssList(A) | ssList(f32(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.34/0.83 128 -ssList(A) | ssList(f33(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.34/0.83 129 -ssList(A) | ssList(f34(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.34/0.83 130 -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.34/0.83 131 -ssList(A) | -lt(f31(A),f30(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.34/0.83 132 -ssList(A) | -lt(f30(A),f31(A)) | strictorderP(A) # label(ax10) # label(axiom). [clausify(61)]. 0.34/0.83 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(122,j,123,b)]. 0.34/0.83 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(122,j,124,a)]. 0.34/0.83 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(122,j,125,c)]. 0.34/0.83 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(122,j,126,c)]. 0.34/0.83 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(122,j,127,c)]. 0.34/0.83 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(122,j,128,c)]. 0.34/0.83 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(122,j,129,c)]. 0.34/0.83 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(122,j,130,c)]. 0.34/0.83 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(122,j,131,c)]. 0.34/0.83 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(122,j,132,c)]. 0.34/0.83 133 -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.34/0.83 134 totalorderP(nil) # label(ax62) # label(axiom). [assumption]. 0.34/0.83 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(133,b,134,a)]. 2.83/3.19 135 -ssList(A) | totalorderP(A) | ssItem(f40(A)) # label(ax9) # label(axiom). [clausify(72)]. 2.83/3.19 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(135,b,133,b)]. 2.83/3.19 136 -ssList(A) | totalorderP(A) | ssItem(f41(A)) # label(ax9) # label(axiom). [clausify(72)]. 2.83/3.19 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(136,b,133,b)]. 2.83/3.19 137 -ssList(A) | totalorderP(A) | ssList(f42(A)) # label(ax9) # label(axiom). [clausify(72)]. 2.83/3.19 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(137,b,133,b)]. 2.83/3.19 138 -ssList(A) | totalorderP(A) | ssList(f43(A)) # label(ax9) # label(axiom). [clausify(72)]. 2.83/3.19 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(138,b,133,b)]. 2.83/3.19 139 -ssList(A) | totalorderP(A) | ssList(f44(A)) # label(ax9) # label(axiom). [clausify(72)]. 2.83/3.19 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(139,b,133,b)]. 2.83/3.19 140 -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)]. 2.83/3.19 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(140,b,133,b)]. 2.83/3.19 141 -ssList(A) | totalorderP(A) | -leq(f40(A),f41(A)) # label(ax9) # label(axiom). [clausify(72)]. 2.83/3.19 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(141,b,133,b)]. 2.83/3.19 142 -ssList(A) | totalorderP(A) | -leq(f41(A),f40(A)) # label(ax9) # label(axiom). [clausify(72)]. 2.83/3.19 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(142,b,133,b)]. 2.83/3.19 143 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom). [clausify(76)]. 2.83/3.19 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(143,b,133,b)]. 2.83/3.19 2.83/3.19 ============================== end predicate elimination ============= 2.83/3.19 2.83/3.19 Auto_denials: (non-Horn, no changes). 2.83/3.19 2.83/3.19 Term ordering decisions: 2.83/3.19 Function symbol KB weights: nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=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. 2.83/3.19 2.83/3.19 ============================== end of process initial clauses ======== 2.83/3.19 2.83/3.19 ============================== CLAUSES FOR SEARCH ==================== 2.83/3.19 2.83/3.19 ============================== end of clauses for search ============= 2.83/3.19 2.83/3.19 ============================== SEARCH ================================ 2.83/3.19 2.83/3.19 % Starting search at 0.66 seconds. 2.83/3.19 2.83/3.19 Low Water (keep): wt=38.000, iters=3489 2.83/3.19 2.83/3.19 Low Water (keep): wt=35.000, iters=3372 2.83/3.19 2.83/3.19 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 53 (0.00 of 1.49 sec). 2.83/3.19 2.83/3.19 Low Water (keep): wt=34.000, iters=3400 2.83/3.19 2.83/3.19 Low Water (keep): wt=33.000, iters=3344 2.83/3.19 2.83/3.19 Low Water (keep): wt=32.000, iters=3363 2.83/3.19 2.83/3.19 Low Water (keep): wt=31.000, iters=3466 2.83/3.19 2.83/3.19 Low Water (keep): wt=30.000, iters=3497 2.83/3.19 2.83/3.19 Low Water (keep): wt=29.000, iters=3444 2.83/3.19 2.83/3.19 Low Water (keep): wt=28.000, iters=3528 2.87/3.22 2.87/3.22 ============================== PROOF ================================= 2.87/3.22 % SZS status Theorem 2.87/3.22 % SZS output start Refutation 2.87/3.22 2.87/3.22 % Proof 1 at 2.55 (+ 0.02) seconds. 2.87/3.22 % Length of proof is 17. 2.87/3.22 % Level of proof is 5. 2.87/3.22 % Maximum clause weight is 12.000. 2.87/3.22 % Given clauses 1401. 2.87/3.22 2.87/3.22 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]. 2.87/3.22 87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> nil != V | W != U | U = nil | (all Y (ssList(Y) -> X != app(W,Y) | -strictorderedP(W) | (exists Z ((exists X1 (ssList(X1) & (exists X2 ((exists X3 (ssList(X3) & W = app(X3,cons(X2,nil)) & lt(X2,Z))) & ssItem(X2))) & app(cons(Z,nil),X1) = Y)) & ssItem(Z))))) | X != nil & W = nil | X != V)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption]. 2.87/3.22 266 -ssList(A) | -ssList(B) | app(A,B) != nil | nil = A # label(ax83) # label(axiom). [clausify(80)]. 2.87/3.22 279 ssList(c3) # label(co1) # label(negated_conjecture). [clausify(87)]. 2.87/3.22 283 nil = c4 # label(co1) # label(negated_conjecture). [clausify(87)]. 2.87/3.22 284 c4 = nil. [copy(283),flip(a)]. 2.87/3.22 285 c5 = c3 # label(co1) # label(negated_conjecture). [clausify(87)]. 2.87/3.22 286 nil != c3 # label(co1) # label(negated_conjecture). [clausify(87)]. 2.87/3.22 287 c3 != nil. [copy(286),flip(a)]. 2.87/3.22 288 ssList(c7) # label(co1) # label(negated_conjecture). [clausify(87)]. 2.87/3.22 289 app(c5,c7) = c6 # label(co1) # label(negated_conjecture). [clausify(87)]. 2.87/3.22 290 app(c3,c7) = c6. [copy(289),rewrite([285(1)])]. 2.87/3.22 296 c6 = c4 # label(co1) # label(negated_conjecture). [clausify(87)]. 2.87/3.22 297 c6 = nil. [copy(296),rewrite([284(2)])]. 2.87/3.22 463 app(c3,c7) = nil. [back_rewrite(290),rewrite([297(4)])]. 2.87/3.22 1703 -ssList(A) | app(c3,A) != nil. [resolve(279,a,266,a),flip(c),unit_del(c,287)]. 2.87/3.22 7038 $F. [resolve(1703,a,288,a),rewrite([463(3)]),xx(a)]. 2.87/3.22 2.87/3.22 % SZS output end Refutation 2.87/3.22 ============================== end of proof ========================== 2.87/3.22 2.87/3.22 ============================== STATISTICS ============================ 2.87/3.22 2.87/3.22 Given=1401. Generated=22809. Kept=6836. proofs=1. 2.87/3.22 Usable=1401. Sos=5347. Demods=38. Limbo=2, Disabled=334. Hints=0. 2.87/3.22 Megabytes=11.13. 2.87/3.22 User_CPU=2.55, System_CPU=0.02, Wall_clock=2. 2.87/3.22 2.87/3.22 ============================== end of statistics ===================== 2.87/3.22 2.87/3.22 ============================== end of search ========================= 2.87/3.22 2.87/3.22 THEOREM PROVED 2.87/3.22 % SZS status Theorem 2.87/3.22 2.87/3.22 Exiting with 1 proof. 2.87/3.22 2.87/3.22 Process 51975 exit (max_proofs) Sat Jul 14 05:36:27 2018 2.87/3.22 Prover9 interrupted 2.87/3.22 EOF