TSTP Solution File: SWC077+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC077+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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 : 600s
% DateTime : Tue Jul 19 21:45:11 EDT 2022
% Result : Unknown 183.52s 183.88s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC077+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 09:05:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.85/1.09 ============================== Prover9 ===============================
% 0.85/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.85/1.09 Process 11885 was started by sandbox on n025.cluster.edu,
% 0.85/1.09 Sun Jun 12 09:05:08 2022
% 0.85/1.09 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11660_n025.cluster.edu".
% 0.85/1.09 ============================== end of head ===========================
% 0.85/1.09
% 0.85/1.09 ============================== INPUT =================================
% 0.85/1.09
% 0.85/1.09 % Reading from file /tmp/Prover9_11660_n025.cluster.edu
% 0.85/1.09
% 0.85/1.09 set(prolog_style_variables).
% 0.85/1.09 set(auto2).
% 0.85/1.09 % set(auto2) -> set(auto).
% 0.85/1.09 % set(auto) -> set(auto_inference).
% 0.85/1.09 % set(auto) -> set(auto_setup).
% 0.85/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.85/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.85/1.09 % set(auto) -> set(auto_limits).
% 0.85/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.85/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.85/1.09 % set(auto) -> set(auto_denials).
% 0.85/1.09 % set(auto) -> set(auto_process).
% 0.85/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.85/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.85/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.85/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.85/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.85/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.85/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.85/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.85/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.85/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.85/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.85/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.85/1.09 % set(auto2) -> assign(stats, some).
% 0.85/1.09 % set(auto2) -> clear(echo_input).
% 0.85/1.09 % set(auto2) -> set(quiet).
% 0.85/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.85/1.09 % set(auto2) -> clear(print_given).
% 0.85/1.09 assign(lrs_ticks,-1).
% 0.85/1.09 assign(sos_limit,10000).
% 0.85/1.09 assign(order,kbo).
% 0.85/1.09 set(lex_order_vars).
% 0.85/1.09 clear(print_given).
% 0.85/1.09
% 0.85/1.09 % formulas(sos). % not echoed (96 formulas)
% 0.85/1.09
% 0.85/1.09 ============================== end of input ==========================
% 0.85/1.09
% 0.85/1.09 % From the command line: assign(max_seconds, 300).
% 0.85/1.09
% 0.85/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.85/1.09
% 0.85/1.09 % Formulas that are not ordinary clauses:
% 0.85/1.09 1 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 2 (exists U (ssItem(U) & (exists V (ssItem(V) & U != V)))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 3 (all U (ssList(U) -> (all V (ssItem(V) -> (memberP(U,V) <-> (exists W (ssList(W) & (exists X (ssList(X) & app(W,cons(V,X)) = U))))))))) # label(ax3) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 4 (all U (ssList(U) -> (singletonP(U) <-> (exists V (ssItem(V) & cons(V,nil) = U))))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 5 (all U (ssList(U) -> (all V (ssList(V) -> (frontsegP(U,V) <-> (exists W (ssList(W) & app(V,W) = U))))))) # label(ax5) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 6 (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.85/1.09 7 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(U,V) <-> (exists W (ssList(W) & (exists X (ssList(X) & app(app(W,V),X) = U))))))))) # label(ax7) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 8 (all U (ssList(U) -> (cyclefreeP(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(ax8) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 9 (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.85/1.09 10 (all U (ssList(U) -> (strictorderP(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(V,W) | lt(W,V))))))))))))))) # label(ax10) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 11 (all U (ssList(U) -> (totalorderedP(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))))))))))))))) # label(ax11) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 12 (all U (ssList(U) -> (strictorderedP(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(V,W))))))))))))))) # label(ax12) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 13 (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) -> (app(app(X,cons(V,Y)),cons(W,Z)) = U -> V != W)))))))))))))) # label(ax13) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 14 (all U (ssList(U) -> (equalelemsP(U) <-> (all V (ssItem(V) -> (all W (ssItem(W) -> (all X (ssList(X) -> (all Y (ssList(Y) -> (app(X,cons(V,cons(W,Y))) = U -> V = W)))))))))))) # label(ax14) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 15 (all U (ssList(U) -> (all V (ssList(V) -> (neq(U,V) <-> U != V))))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 16 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 17 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != U)))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 18 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> (all X (ssItem(X) -> (cons(W,U) = cons(X,V) -> W = X & V = U))))))))) # label(ax19) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 19 (all U (ssList(U) -> nil = U | (exists V (ssList(V) & (exists W (ssItem(W) & cons(W,V) = U)))))) # label(ax20) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 20 (all U (ssList(U) -> (all V (ssItem(V) -> nil != cons(V,U))))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 21 (all U (ssList(U) -> (nil != U -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 22 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 23 (all U (ssList(U) -> (nil != U -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 24 (all U (ssList(U) -> (all V (ssItem(V) -> tl(cons(V,U)) = U)))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 25 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 26 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssItem(W) -> cons(W,app(V,U)) = app(cons(W,V),U))))))) # label(ax27) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 27 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 28 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) & leq(V,U) -> U = V))))) # label(ax29) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 29 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (leq(U,V) & leq(V,W) -> leq(U,W)))))))) # label(ax30) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 30 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 31 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(U,V) <-> leq(V,U)))))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 32 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 33 (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.85/1.09 34 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) <-> lt(V,U)))))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.09 35 (all U (ssItem(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (memberP(app(V,W),U) <-> memberP(V,U) | memberP(W,U)))))))) # label(ax36) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 36 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (memberP(cons(V,W),U) <-> U = V | memberP(W,U)))))))) # label(ax37) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 37 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 38 (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.85/1.10 39 (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.85/1.10 40 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 41 (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.85/1.10 42 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssList(W) -> (all X (ssList(X) -> (frontsegP(cons(U,W),cons(V,X)) <-> U = V & frontsegP(W,X)))))))))) # label(ax44) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 43 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 44 (all U (ssList(U) -> (frontsegP(nil,U) <-> nil = U))) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 45 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (rearsegP(U,V) & rearsegP(V,W) -> rearsegP(U,W)))))))) # label(ax47) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 46 (all U (ssList(U) -> (all V (ssList(V) -> (rearsegP(U,V) & rearsegP(V,U) -> U = V))))) # label(ax48) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 47 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 48 (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.85/1.10 49 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 50 (all U (ssList(U) -> (rearsegP(nil,U) <-> nil = U))) # label(ax52) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 51 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (segmentP(U,V) & segmentP(V,W) -> segmentP(U,W)))))))) # label(ax53) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 52 (all U (ssList(U) -> (all V (ssList(V) -> (segmentP(U,V) & segmentP(V,U) -> U = V))))) # label(ax54) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 53 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 54 (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.85/1.10 55 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 56 (all U (ssList(U) -> (segmentP(nil,U) <-> nil = U))) # label(ax58) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 57 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 58 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 59 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 60 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 61 (all U (ssItem(U) -> (all V (ssList(V) -> (totalorderedP(cons(U,V)) <-> nil = V | nil != V & totalorderedP(V) & leq(U,hd(V))))))) # label(ax67) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 62 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 63 (all U (ssItem(U) -> (all V (ssList(V) -> (strictorderedP(cons(U,V)) <-> nil = V | nil != V & strictorderedP(V) & lt(U,hd(V))))))) # label(ax70) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 64 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 65 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 66 (all U (ssList(U) -> (nil != U -> (exists V (ssItem(V) & hd(U) = V))))) # label(ax75) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 67 (all U (ssList(U) -> (nil != U -> (exists V (ssList(V) & tl(U) = V))))) # label(ax76) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 68 (all U (ssList(U) -> (all V (ssList(V) -> (nil != V & nil != U & hd(V) = hd(U) & tl(V) = tl(U) -> V = U))))) # label(ax77) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 69 (all U (ssList(U) -> (nil != U -> cons(hd(U),tl(U)) = U))) # label(ax78) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 70 (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.85/1.10 71 (all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (app(V,W) = app(V,U) -> W = U))))))) # label(ax80) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 72 (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.85/1.10 73 (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.85/1.10 74 (all U (ssList(U) -> (all V (ssList(V) -> (nil = app(U,V) <-> nil = V & nil = U))))) # label(ax83) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 75 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 76 (all U (ssList(U) -> (all V (ssList(V) -> (nil != U -> hd(app(U,V)) = hd(U)))))) # label(ax85) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 77 (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.85/1.10 78 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(U,V) & geq(V,U) -> U = V))))) # label(ax87) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 79 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (geq(U,V) & geq(V,W) -> geq(U,W)))))))) # label(ax88) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 80 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 81 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 82 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (leq(U,V) & lt(V,W) -> lt(U,W)))))))) # label(ax91) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 83 (all U (ssItem(U) -> (all V (ssItem(V) -> (leq(U,V) -> U = V | lt(U,V)))))) # label(ax92) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 84 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) <-> U != V & leq(U,V)))))) # label(ax93) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 85 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 86 (all U (ssItem(U) -> (all V (ssItem(V) -> (all W (ssItem(W) -> (gt(U,V) & gt(V,W) -> gt(U,W)))))))) # label(ax95) # label(axiom) # label(non_clause). [assumption].
% 0.85/1.10 87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> V != X | U != W | -frontsegP(X,W) | -strictorderedP(W) | (exists Y (ssList(Y) & neq(Y,nil) & segmentP(V,Y) & segmentP(U,Y))) | (exists Z (ssList(Z) & neq(W,Z) & frontsegP(X,Z) & segmentP(Z,W) & strictorderedP(Z))) | nil = V & nil = U)))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.85/1.10
% 0.85/1.10 ============================== end of process non-clausal formulas ===
% 0.85/1.10
% 0.85/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.85/1.10
% 0.85/1.10 ============================== PREDICATE ELIMINATION =================
% 0.85/1.10 88 -ssList(A) | cyclefreeP(A) | ssItem(f8(A)) # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.10 89 -ssList(A) | -cyclefreeP(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(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | ssItem(f8(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(88,b,89,b)].
% 0.85/1.11 90 -ssList(A) | cyclefreeP(A) | ssItem(f9(A)) # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | ssItem(f9(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(90,b,89,b)].
% 0.85/1.11 91 -ssList(A) | cyclefreeP(A) | ssList(f10(A)) # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | ssList(f10(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(91,b,89,b)].
% 0.85/1.11 92 -ssList(A) | cyclefreeP(A) | ssList(f11(A)) # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | ssList(f11(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(92,b,89,b)].
% 0.85/1.11 93 -ssList(A) | cyclefreeP(A) | ssList(f12(A)) # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | ssList(f12(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(93,b,89,b)].
% 0.85/1.11 94 -ssList(A) | cyclefreeP(A) | app(app(f10(A),cons(f8(A),f11(A))),cons(f9(A),f12(A))) = A # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | app(app(f10(A),cons(f8(A),f11(A))),cons(f9(A),f12(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(94,b,89,b)].
% 0.85/1.11 95 -ssList(A) | cyclefreeP(A) | leq(f8(A),f9(A)) # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | leq(f8(A),f9(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(95,b,89,b)].
% 0.85/1.11 96 -ssList(A) | cyclefreeP(A) | leq(f9(A),f8(A)) # label(ax8) # label(axiom). [clausify(8)].
% 0.85/1.11 Derived: -ssList(A) | leq(f9(A),f8(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(96,b,89,b)].
% 0.85/1.11 97 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(ax59) # label(axiom). [clausify(57)].
% 0.85/1.11 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(97,b,89,b)].
% 0.85/1.11 98 cyclefreeP(nil) # label(ax60) # label(axiom). [assumption].
% 0.85/1.11 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(98,a,89,b)].
% 0.85/1.11 99 -ssList(A) | totalorderP(A) | ssItem(f13(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.11 100 -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(9)].
% 0.85/1.11 Derived: -ssList(A) | ssItem(f13(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(99,b,100,b)].
% 0.85/1.11 101 -ssList(A) | totalorderP(A) | ssItem(f14(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.11 Derived: -ssList(A) | ssItem(f14(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(101,b,100,b)].
% 0.85/1.11 102 -ssList(A) | totalorderP(A) | ssList(f15(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.11 Derived: -ssList(A) | ssList(f15(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(102,b,100,b)].
% 0.85/1.13 103 -ssList(A) | totalorderP(A) | ssList(f16(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.13 Derived: -ssList(A) | ssList(f16(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(103,b,100,b)].
% 0.85/1.13 104 -ssList(A) | totalorderP(A) | ssList(f17(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.13 Derived: -ssList(A) | ssList(f17(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(104,b,100,b)].
% 0.85/1.13 105 -ssList(A) | totalorderP(A) | app(app(f15(A),cons(f13(A),f16(A))),cons(f14(A),f17(A))) = A # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.13 Derived: -ssList(A) | app(app(f15(A),cons(f13(A),f16(A))),cons(f14(A),f17(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(105,b,100,b)].
% 0.85/1.13 106 -ssList(A) | totalorderP(A) | -leq(f13(A),f14(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.13 Derived: -ssList(A) | -leq(f13(A),f14(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(106,b,100,b)].
% 0.85/1.13 107 -ssList(A) | totalorderP(A) | -leq(f14(A),f13(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.85/1.13 Derived: -ssList(A) | -leq(f14(A),f13(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(107,b,100,b)].
% 0.85/1.13 108 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom). [clausify(58)].
% 0.85/1.13 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(108,b,100,b)].
% 0.85/1.13 109 totalorderP(nil) # label(ax62) # label(axiom). [assumption].
% 0.85/1.13 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(109,a,100,b)].
% 0.85/1.13 110 -ssList(A) | strictorderP(A) | ssItem(f18(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.13 111 -ssList(A) | -strictorderP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.13 Derived: -ssList(A) | ssItem(f18(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B). [resolve(110,b,111,b)].
% 0.85/1.13 112 -ssList(A) | strictorderP(A) | ssItem(f19(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.13 Derived: -ssList(A) | ssItem(f19(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B). [resolve(112,b,111,b)].
% 0.85/1.13 113 -ssList(A) | strictorderP(A) | ssList(f20(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.13 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 | lt(B,C) | lt(C,B). [resolve(113,b,111,b)].
% 0.85/1.13 114 -ssList(A) | strictorderP(A) | ssList(f21(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.13 Derived: -ssList(A) | ssList(f21(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B). [resolve(114,b,111,b)].
% 0.85/1.13 115 -ssList(A) | strictorderP(A) | ssList(f22(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.13 Derived: -ssList(A) | ssList(f22(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B). [resolve(115,b,111,b)].
% 0.85/1.13 116 -ssList(A) | strictorderP(A) | app(app(f20(A),cons(f18(A),f21(A))),cons(f19(A),f22(A))) = A # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.13 Derived: -ssList(A) | app(app(f20(A),cons(f18(A),f21(A))),cons(f19(A),f22(A))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B). [resolve(116,b,111,b)].
% 0.85/1.15 117 -ssList(A) | strictorderP(A) | -lt(f18(A),f19(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.15 Derived: -ssList(A) | -lt(f18(A),f19(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B). [resolve(117,b,111,b)].
% 0.85/1.15 118 -ssList(A) | strictorderP(A) | -lt(f19(A),f18(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.85/1.15 Derived: -ssList(A) | -lt(f19(A),f18(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | -ssList(F) | app(app(D,cons(B,E)),cons(C,F)) != A | lt(B,C) | lt(C,B). [resolve(118,b,111,b)].
% 0.85/1.15 119 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom). [clausify(59)].
% 0.85/1.15 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) | lt(B,C) | lt(C,B). [resolve(119,b,111,b)].
% 0.85/1.15 120 strictorderP(nil) # label(ax64) # label(axiom). [assumption].
% 0.85/1.15 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | -ssList(E) | app(app(C,cons(A,D)),cons(B,E)) != nil | lt(A,B) | lt(B,A). [resolve(120,a,111,b)].
% 0.85/1.15 121 -ssList(A) | duplicatefreeP(A) | ssItem(f33(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.85/1.15 122 -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(13)].
% 0.85/1.15 Derived: -ssList(A) | ssItem(f33(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(121,b,122,b)].
% 0.85/1.15 123 -ssList(A) | duplicatefreeP(A) | ssItem(f34(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.85/1.15 Derived: -ssList(A) | ssItem(f34(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(123,b,122,b)].
% 0.85/1.15 124 -ssList(A) | duplicatefreeP(A) | ssList(f35(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.85/1.15 Derived: -ssList(A) | ssList(f35(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(124,b,122,b)].
% 0.85/1.15 125 -ssList(A) | duplicatefreeP(A) | ssList(f36(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.85/1.15 Derived: -ssList(A) | ssList(f36(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(125,b,122,b)].
% 0.85/1.15 126 -ssList(A) | duplicatefreeP(A) | ssList(f37(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.85/1.15 Derived: -ssList(A) | ssList(f37(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(126,b,122,b)].
% 0.85/1.15 127 -ssList(A) | duplicatefreeP(A) | app(app(f35(A),cons(f33(A),f36(A))),cons(f34(A),f37(A))) = A # label(ax13) # label(axiom). [clausify(13)].
% 0.85/1.15 Derived: -ssList(A) | app(app(f35(A),cons(f33(A),f36(A))),cons(f34(A),f37(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(127,b,122,b)].
% 0.85/1.15 128 -ssList(A) | duplicatefreeP(A) | f34(A) = f33(A) # label(ax13) # label(axiom). [clausify(13)].
% 0.85/1.15 Derived: -ssList(A) | f34(A) = f33(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(128,b,122,b)].
% 0.85/1.15 129 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom). [clausify(64)].
% 0.85/1.15 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(129,b,122,b)].
% 0.85/1.15 130 duplicatefreeP(nil) # label(ax72) # label(axiom). [assumption].
% 0.85/1.15 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(130,a,122,b)].
% 4.50/4.81 131 -ssList(A) | equalelemsP(A) | ssItem(f38(A)) # label(ax14) # label(axiom). [clausify(14)].
% 4.50/4.81 132 -ssList(A) | -equalelemsP(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B # label(ax14) # label(axiom). [clausify(14)].
% 4.50/4.81 Derived: -ssList(A) | ssItem(f38(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B. [resolve(131,b,132,b)].
% 4.50/4.81 133 -ssList(A) | equalelemsP(A) | ssItem(f39(A)) # label(ax14) # label(axiom). [clausify(14)].
% 4.50/4.81 Derived: -ssList(A) | ssItem(f39(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B. [resolve(133,b,132,b)].
% 4.50/4.81 134 -ssList(A) | equalelemsP(A) | ssList(f40(A)) # label(ax14) # label(axiom). [clausify(14)].
% 4.50/4.81 Derived: -ssList(A) | ssList(f40(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B. [resolve(134,b,132,b)].
% 4.50/4.81 135 -ssList(A) | equalelemsP(A) | ssList(f41(A)) # label(ax14) # label(axiom). [clausify(14)].
% 4.50/4.81 Derived: -ssList(A) | ssList(f41(A)) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B. [resolve(135,b,132,b)].
% 4.50/4.81 136 -ssList(A) | equalelemsP(A) | app(f40(A),cons(f38(A),cons(f39(A),f41(A)))) = A # label(ax14) # label(axiom). [clausify(14)].
% 4.50/4.81 Derived: -ssList(A) | app(f40(A),cons(f38(A),cons(f39(A),f41(A)))) = A | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B. [resolve(136,b,132,b)].
% 4.50/4.81 137 -ssList(A) | equalelemsP(A) | f39(A) != f38(A) # label(ax14) # label(axiom). [clausify(14)].
% 4.50/4.81 Derived: -ssList(A) | f39(A) != f38(A) | -ssList(A) | -ssItem(B) | -ssItem(C) | -ssList(D) | -ssList(E) | app(D,cons(B,cons(C,E))) != A | C = B. [resolve(137,b,132,b)].
% 4.50/4.81 138 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom). [clausify(65)].
% 4.50/4.81 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(138,b,132,b)].
% 4.50/4.81 139 equalelemsP(nil) # label(ax74) # label(axiom). [assumption].
% 4.50/4.81 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A. [resolve(139,a,132,b)].
% 4.50/4.81
% 4.50/4.81 ============================== end predicate elimination =============
% 4.50/4.81
% 4.50/4.81 Auto_denials: (non-Horn, no changes).
% 4.50/4.81
% 4.50/4.81 Term ordering decisions:
% 4.50/4.81 Function symbol KB weights: nil=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. cons=1. app=1. f1=1. f2=1. f4=1. f5=1. f6=1. f7=1. hd=1. tl=1. f3=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. f21=1. f22=1. f23=1. f24=1. f25=1. f26=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.50/4.81
% 4.50/4.81 ============================== end of process initial clauses ========
% 4.50/4.81
% 4.50/4.81 ============================== CLAUSES FOR SEARCH ====================
% 4.50/4.81
% 4.50/4.81 ============================== end of clauses for search =============
% 4.50/4.81
% 4.50/4.81 ============================== SEARCH ================================
% 4.50/4.81
% 4.50/4.81 % Starting search at 0.41 seconds.
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=41.000, iters=3529
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=38.000, iters=3366
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=35.000, iters=3440
% 4.50/4.81
% 4.50/4.81 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 38 (0.00 of 0.90 sec).
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=32.000, iters=3445
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=29.000, iters=3370
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=23.000, iters=3452
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=22.000, iters=3334
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=21.000, iters=3360
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=20.000, iters=3371
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=19.000, iters=3436
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=18.000, iters=3447
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=17.000, iters=3336
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=16.000, iters=3359
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=15.000, iters=3343
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=14.000, iters=3344
% 4.50/4.81
% 4.50/4.81 Low Water (displace): id=2875, wt=43.000
% 4.50/4.81
% 4.50/4.81 Low Water (keep): wt=13.000, iters=3351
% 4.50/4.81
% 4.50/4.81 Low Water (displace): id=13354, wt=42.000
% 4.50/4.81
% 4.50/4.81 Low Water (displace): id=14857, wt=12.000
% 4.50/4.81
% 4.50/4.81 Low Water (displace): id=14864, wt=11.000
% 4.50/4.81
% 4.50/4.81 Low Water (displace): id=15101, wt=10.000
% 183.52/183.88
% 183.52/183.88 Low Water (keep): wt=12.000, iters=3340
% 183.52/183.88
% 183.52/183.88 Low Water (keep): wt=11.000, iters=3333
% 183.52/183.88
% 183.52/183.88 Low Water (displace): id=18621, wt=8.000
% 183.52/183.88
% 183.52/183.88 Low Water (keep): wt=10.000, iters=3333
% 183.52/183.88
% 183.52/183.88 Low Water (displace): id=25665, wt=7.000
% 183.52/183.88
% 183.52/183.88 Low Water (keep): wt=9.000, iters=3333
% 183.52/183.88
% 183.52/183.88 ============================== STATISTICS ============================
% 183.52/183.88
% 183.52/183.88 Given=25501. Generated=12154125. Kept=652241. proofs=0.
% 183.52/183.88 Usable=14602. Sos=9995. Demods=372. Limbo=28, Disabled=627862. Hints=0.
% 183.52/183.88 Kept_by_rule=0, Deleted_by_rule=0.
% 183.52/183.88 Forward_subsumed=216338. Back_subsumed=111.
% 183.52/183.88 Sos_limit_deleted=11285546. Sos_displaced=605392. Sos_removed=0.
% 183.52/183.88 New_demodulators=1095 (0 lex), Back_demodulated=21298. Back_unit_deleted=815.
% 183.52/183.88 Demod_attempts=287658460. Demod_rewrites=74254.
% 183.52/183.88 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 183.52/183.88 Nonunit_fsub_feature_tests=13993975. Nonunit_bsub_feature_tests=62060.
% 183.52/183.88 Megabytes=419.43.
% 183.52/183.88 User_CPU=176.19, System_CPU=6.56, Wall_clock=183.
% 183.52/183.88
% 183.52/183.88 Megs malloced by palloc(): 400.
% 183.52/183.88 type (bytes each) gets frees in use bytes
% 183.52/183.88 chunk ( 104) 3162 3162 0 0.0 K
% 183.52/183.88 string_buf ( 8) 2839 2839 0 0.0 K
% 183.52/183.88 token ( 20) 7796 7796 0 0.0 K
% 183.52/183.88 pterm ( 16) 3899 3899 0 0.0 K
% 183.52/183.88 hashtab ( 8) 87 87 0 0.0 K
% 183.52/183.88 hashnode ( 8) 788 788 0 0.0 K
% 183.52/183.88 term ( 20) 396131324 384499255 11632069 227188.8 K
% 183.52/183.88 term arg arrays: 44890.9 K
% 183.52/183.88 attribute ( 12) 941 2 939 11.0 K
% 183.52/183.88 ilist ( 8) 555745616 553137108 2608508 20379.0 K
% 183.52/183.88 plist ( 8) 8169266 7490646 678620 5301.7 K
% 183.52/183.88 i2list ( 12) 9415756 9415756 0 0.0 K
% 183.52/183.88 just ( 12) 13901412 13128511 772901 9057.4 K
% 183.52/183.88 parajust ( 16) 975 939 36 0.6 K
% 183.52/183.88 instancejust ( 8) 0 0 0 0.0 K
% 183.52/183.88 ivyjust ( 24) 0 0 0 0.0 K
% 183.52/183.88 formula ( 28) 7504 5616 1888 51.6 K
% 183.52/183.88 formula arg arrays: 6.7 K
% 183.52/183.88 topform ( 52) 12154459 11501884 652575 33138.6 K
% 183.52/183.88 clist_pos ( 20) 1959305 1306446 652859 12751.2 K
% 183.52/183.88 clist ( 16) 8 1 7 0.1 K
% 183.52/183.88 context ( 808) 109757742 109757740 2 1.6 K
% 183.52/183.88 trail ( 12) 113172203 113172202 1 0.0 K
% 183.52/183.88 ac_match_pos (70044) 0 0 0 0.0 K
% 183.52/183.88 ac_match_free_vars_pos (20020)
% 183.52/183.88 0 0 0 0.0 K
% 183.52/183.88 btm_state ( 60) 0 0 0 0.0 K
% 183.52/183.88 btu_state ( 60) 0 0 0 0.0 K
% 183.52/183.88 ac_position (285432) 0 0 0 0.0 K
% 183.52/183.88 fpa_trie ( 20) 1554409 1440803 113606 2218.9 K
% 183.52/183.88 fpa_state ( 28) 4747406 4747405 1 0.0 K
% 183.52/183.88 fpa_index ( 12) 10 0 10 0.1 K
% 183.52/183.88 fpa_chunk ( 20) 2785014 2738844 46170 901.8 K
% 183.52/183.88 fpa_list ( 16) 1467518 0 1467518 22930.0 K
% 183.52/183.88 fpa_list chunks: 3169.0 K
% 183.52/183.88 discrim ( 12) 2593797 2537942 55855 654.6 K
% 183.52/183.88 discrim_pos ( 16) 294012 294012 0 0.0 K
% 183.52/183.88 flat2 ( 32) 201619717 201619717 0 0.0 K
% 183.52/183.88 flat ( 48) 0 0 0 0.0 K
% 183.52/183.88 flatterm ( 32) 332069299 332069299 0 0.0 K
% 183.52/183.88 mindex ( 28) 13 0 13 0.4 K
% 183.52/183.88 mindex_pos ( 56) 58050780 58050779 1 0.1 K
% 183.52/183.88 lindex ( 12) 5 0 5 0.1 K
% 183.52/183.88 clash ( 40) 0 0 0 0.0 K
% 183.52/183.88 di_tree ( 12) 20443589 19469513 974076 11415.0 K
% 183.52/183.88 avl_node ( 20) 1302995 1283005 19990 390.4 K
% 183.52/183.88
% 183.52/183.88 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 183.52/183.88 List 1, length 31, 0.1 K
% 183.52/183.88 List 2, length 252, 2.0 K
% 183.52/183.88 List 3, length 8784, 102.9 K
% 183.52/183.88 List 7, length 828, 22.6 K
% 183.52/183.88 List 8, length 1802, 56.3 K
% 183.52/183.88 List 10, length 1, 0.0 K
% 183.52/183.88 List 11, length 2, 0.1 K
% 183.52/183.88 List 14, length 1, 0.1 K
% 183.52/183.88 List 16, length 1299, 81.2 K
% 183.52/183.88 List 26, length 100, 10.2 K
% 183.52/183.88 List 32, length 706, 88.2 K
% 183.52/183.88 List 64, length 213, 53.2 K
% 183.52/183.88 List 128, length 217, 108.5 K
% 183.52/183.88 List 202, length 2, 1.6 K
% 183.52/183.88 List 256, length 181, 181.0 K
% 183.52/183.88
% 183.52/183.88 ============================== SELECTOR REPORT =======================
% 183.52/183.88 Sos_deleted=11285546, Sos_displaced=605392, Sos_size=9995
% 183.52/183.88 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 183.52/183.88 I 2147483647 high age 0 1348
% 183.52/183.88 H 1 high weight 0 0
% 183.52/183.88 A 1 low age 9995 2684
% 183.52/183.88 F 4 low weight 2351 10736
% 183.52/183.88 T 4 low weight 7644 10733
% 183.52/183.88 ============================== end of selector report ================
% 183.52/183.88
% 183.52/183.88 ============================== end of statistics =====================
% 183.52/183.88
% 183.52/183.88 Exiting with failure.
% 183.52/183.88
% 183.52/183.88 Process 11885 exit (max_megs) Sun Jun 12 09:08:11 2022
% 183.52/183.88 Prover9 interrupted
%------------------------------------------------------------------------------