TSTP Solution File: SWC131+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC131+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:32 EDT 2022
% Result : Theorem 2.41s 2.72s
% Output : Refutation 2.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC131+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Sun Jun 12 19:42:26 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.61/0.89 ============================== Prover9 ===============================
% 0.61/0.89 Prover9 (32) version 2009-11A, November 2009.
% 0.61/0.89 Process 32462 was started by sandbox on n032.cluster.edu,
% 0.61/0.89 Sun Jun 12 19:42:26 2022
% 0.61/0.89 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32308_n032.cluster.edu".
% 0.61/0.89 ============================== end of head ===========================
% 0.61/0.89
% 0.61/0.89 ============================== INPUT =================================
% 0.61/0.89
% 0.61/0.89 % Reading from file /tmp/Prover9_32308_n032.cluster.edu
% 0.61/0.89
% 0.61/0.89 set(prolog_style_variables).
% 0.61/0.89 set(auto2).
% 0.61/0.89 % set(auto2) -> set(auto).
% 0.61/0.89 % set(auto) -> set(auto_inference).
% 0.61/0.89 % set(auto) -> set(auto_setup).
% 0.61/0.89 % set(auto_setup) -> set(predicate_elim).
% 0.61/0.89 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.61/0.89 % set(auto) -> set(auto_limits).
% 0.61/0.89 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.61/0.89 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.61/0.89 % set(auto) -> set(auto_denials).
% 0.61/0.89 % set(auto) -> set(auto_process).
% 0.61/0.89 % set(auto2) -> assign(new_constants, 1).
% 0.61/0.89 % set(auto2) -> assign(fold_denial_max, 3).
% 0.61/0.89 % set(auto2) -> assign(max_weight, "200.000").
% 0.61/0.89 % set(auto2) -> assign(max_hours, 1).
% 0.61/0.89 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.61/0.89 % set(auto2) -> assign(max_seconds, 0).
% 0.61/0.89 % set(auto2) -> assign(max_minutes, 5).
% 0.61/0.89 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.61/0.89 % set(auto2) -> set(sort_initial_sos).
% 0.61/0.89 % set(auto2) -> assign(sos_limit, -1).
% 0.61/0.89 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.61/0.89 % set(auto2) -> assign(max_megs, 400).
% 0.61/0.89 % set(auto2) -> assign(stats, some).
% 0.61/0.89 % set(auto2) -> clear(echo_input).
% 0.61/0.89 % set(auto2) -> set(quiet).
% 0.61/0.89 % set(auto2) -> clear(print_initial_clauses).
% 0.61/0.89 % set(auto2) -> clear(print_given).
% 0.61/0.89 assign(lrs_ticks,-1).
% 0.61/0.89 assign(sos_limit,10000).
% 0.61/0.89 assign(order,kbo).
% 0.61/0.89 set(lex_order_vars).
% 0.61/0.89 clear(print_given).
% 0.61/0.89
% 0.61/0.89 % formulas(sos). % not echoed (96 formulas)
% 0.61/0.89
% 0.61/0.89 ============================== end of input ==========================
% 0.61/0.89
% 0.61/0.89 % From the command line: assign(max_seconds, 300).
% 0.61/0.89
% 0.61/0.89 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.61/0.89
% 0.61/0.89 % Formulas that are not ordinary clauses:
% 0.61/0.89 1 (all U (ssItem(U) -> (all V (ssItem(V) -> (neq(U,V) <-> U != V))))) # label(ax1) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 2 (exists U (ssItem(U) & (exists V (ssItem(V) & U != V)))) # label(ax2) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 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.61/0.89 4 (all U (ssList(U) -> (singletonP(U) <-> (exists V (ssItem(V) & cons(V,nil) = U))))) # label(ax4) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 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.61/0.89 15 (all U (ssList(U) -> (all V (ssList(V) -> (neq(U,V) <-> U != V))))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 16 (all U (ssList(U) -> (all V (ssItem(V) -> ssList(cons(V,U)))))) # label(ax16) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 17 (all U (ssList(U) -> (all V (ssItem(V) -> cons(V,U) != U)))) # label(ax18) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 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.61/0.89 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.61/0.89 20 (all U (ssList(U) -> (all V (ssItem(V) -> nil != cons(V,U))))) # label(ax21) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 21 (all U (ssList(U) -> (nil != U -> ssItem(hd(U))))) # label(ax22) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 22 (all U (ssList(U) -> (all V (ssItem(V) -> hd(cons(V,U)) = V)))) # label(ax23) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 23 (all U (ssList(U) -> (nil != U -> ssList(tl(U))))) # label(ax24) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 24 (all U (ssList(U) -> (all V (ssItem(V) -> tl(cons(V,U)) = U)))) # label(ax25) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 25 (all U (ssList(U) -> (all V (ssList(V) -> ssList(app(U,V)))))) # label(ax26) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 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.61/0.89 27 (all U (ssList(U) -> app(nil,U) = U)) # label(ax28) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 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.61/0.89 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.61/0.89 30 (all U (ssItem(U) -> leq(U,U))) # label(ax31) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 31 (all U (ssItem(U) -> (all V (ssItem(V) -> (geq(U,V) <-> leq(V,U)))))) # label(ax32) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 32 (all U (ssItem(U) -> (all V (ssItem(V) -> (lt(U,V) -> -lt(V,U)))))) # label(ax33) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 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.61/0.89 34 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) <-> lt(V,U)))))) # label(ax35) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.89 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.61/0.90 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.61/0.90 37 (all U (ssItem(U) -> -memberP(nil,U))) # label(ax38) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 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.61/0.90 40 (all U (ssList(U) -> frontsegP(U,U))) # label(ax42) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 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.61/0.90 43 (all U (ssList(U) -> frontsegP(U,nil))) # label(ax45) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 44 (all U (ssList(U) -> (frontsegP(nil,U) <-> nil = U))) # label(ax46) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 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.61/0.90 47 (all U (ssList(U) -> rearsegP(U,U))) # label(ax49) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 49 (all U (ssList(U) -> rearsegP(U,nil))) # label(ax51) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 50 (all U (ssList(U) -> (rearsegP(nil,U) <-> nil = U))) # label(ax52) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 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.61/0.90 53 (all U (ssList(U) -> segmentP(U,U))) # label(ax55) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 55 (all U (ssList(U) -> segmentP(U,nil))) # label(ax57) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 56 (all U (ssList(U) -> (segmentP(nil,U) <-> nil = U))) # label(ax58) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 57 (all U (ssItem(U) -> cyclefreeP(cons(U,nil)))) # label(ax59) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 58 (all U (ssItem(U) -> totalorderP(cons(U,nil)))) # label(ax61) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 59 (all U (ssItem(U) -> strictorderP(cons(U,nil)))) # label(ax63) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 60 (all U (ssItem(U) -> totalorderedP(cons(U,nil)))) # label(ax65) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 62 (all U (ssItem(U) -> strictorderedP(cons(U,nil)))) # label(ax68) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 64 (all U (ssItem(U) -> duplicatefreeP(cons(U,nil)))) # label(ax71) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 65 (all U (ssItem(U) -> equalelemsP(cons(U,nil)))) # label(ax73) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 66 (all U (ssList(U) -> (nil != U -> (exists V (ssItem(V) & hd(U) = V))))) # label(ax75) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 67 (all U (ssList(U) -> (nil != U -> (exists V (ssList(V) & tl(U) = V))))) # label(ax76) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 69 (all U (ssList(U) -> (nil != U -> cons(hd(U),tl(U)) = U))) # label(ax78) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 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.61/0.90 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.61/0.90 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.61/0.90 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.61/0.90 75 (all U (ssList(U) -> app(U,nil) = U)) # label(ax84) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 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.61/0.90 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.61/0.90 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.61/0.90 80 (all U (ssItem(U) -> geq(U,U))) # label(ax89) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 81 (all U (ssItem(U) -> -lt(U,U))) # label(ax90) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 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.61/0.90 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.61/0.90 85 (all U (ssItem(U) -> (all V (ssItem(V) -> (gt(U,V) -> -gt(V,U)))))) # label(ax94) # label(axiom) # label(non_clause). [assumption].
% 0.61/0.90 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.61/0.90 87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> V != X | U != W | neq(X,nil) | cyclefreeP(V))))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.61/0.90
% 0.61/0.90 ============================== end of process non-clausal formulas ===
% 0.61/0.90
% 0.61/0.90 ============================== PROCESS INITIAL CLAUSES ===============
% 0.61/0.90
% 0.61/0.90 ============================== PREDICATE ELIMINATION =================
% 0.61/0.90 88 -ssList(A) | totalorderP(A) | ssItem(f13(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.61/0.90 89 -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.61/0.90 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(88,b,89,b)].
% 0.61/0.91 90 -ssList(A) | totalorderP(A) | ssItem(f14(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.61/0.91 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(90,b,89,b)].
% 0.61/0.91 91 -ssList(A) | totalorderP(A) | ssList(f15(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.61/0.91 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(91,b,89,b)].
% 0.61/0.91 92 -ssList(A) | totalorderP(A) | ssList(f16(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.61/0.91 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(92,b,89,b)].
% 0.61/0.91 93 -ssList(A) | totalorderP(A) | ssList(f17(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.61/0.91 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(93,b,89,b)].
% 0.61/0.91 94 -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.61/0.91 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(94,b,89,b)].
% 0.61/0.91 95 -ssList(A) | totalorderP(A) | -leq(f13(A),f14(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.61/0.91 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(95,b,89,b)].
% 0.61/0.91 96 -ssList(A) | totalorderP(A) | -leq(f14(A),f13(A)) # label(ax9) # label(axiom). [clausify(9)].
% 0.61/0.91 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(96,b,89,b)].
% 0.61/0.91 97 -ssItem(A) | totalorderP(cons(A,nil)) # label(ax61) # label(axiom). [clausify(58)].
% 0.61/0.91 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.61/0.91 98 totalorderP(nil) # label(ax62) # label(axiom). [assumption].
% 0.61/0.91 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.61/0.91 99 -ssList(A) | strictorderP(A) | ssItem(f18(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.61/0.91 100 -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.61/0.91 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(99,b,100,b)].
% 0.61/0.91 101 -ssList(A) | strictorderP(A) | ssItem(f19(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.61/0.91 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(101,b,100,b)].
% 0.61/0.91 102 -ssList(A) | strictorderP(A) | ssList(f20(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.61/0.91 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(102,b,100,b)].
% 0.61/0.91 103 -ssList(A) | strictorderP(A) | ssList(f21(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.61/0.91 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(103,b,100,b)].
% 0.61/0.92 104 -ssList(A) | strictorderP(A) | ssList(f22(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.61/0.92 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(104,b,100,b)].
% 0.61/0.92 105 -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.61/0.92 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(105,b,100,b)].
% 0.61/0.92 106 -ssList(A) | strictorderP(A) | -lt(f18(A),f19(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.61/0.92 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(106,b,100,b)].
% 0.61/0.92 107 -ssList(A) | strictorderP(A) | -lt(f19(A),f18(A)) # label(ax10) # label(axiom). [clausify(10)].
% 0.61/0.92 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(107,b,100,b)].
% 0.61/0.92 108 -ssItem(A) | strictorderP(cons(A,nil)) # label(ax63) # label(axiom). [clausify(59)].
% 0.61/0.92 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(108,b,100,b)].
% 0.61/0.92 109 strictorderP(nil) # label(ax64) # label(axiom). [assumption].
% 0.61/0.92 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(109,a,100,b)].
% 0.61/0.92 110 -ssList(A) | duplicatefreeP(A) | ssItem(f33(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.61/0.92 111 -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.61/0.92 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(110,b,111,b)].
% 0.61/0.92 112 -ssList(A) | duplicatefreeP(A) | ssItem(f34(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.61/0.92 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(112,b,111,b)].
% 0.61/0.92 113 -ssList(A) | duplicatefreeP(A) | ssList(f35(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.61/0.92 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(113,b,111,b)].
% 0.61/0.92 114 -ssList(A) | duplicatefreeP(A) | ssList(f36(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.61/0.92 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(114,b,111,b)].
% 0.61/0.92 115 -ssList(A) | duplicatefreeP(A) | ssList(f37(A)) # label(ax13) # label(axiom). [clausify(13)].
% 0.61/0.92 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(115,b,111,b)].
% 0.61/0.92 116 -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.61/0.92 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(116,b,111,b)].
% 0.61/0.92 117 -ssList(A) | duplicatefreeP(A) | f34(A) = f33(A) # label(ax13) # label(axiom). [clausify(13)].
% 1.83/2.12 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(117,b,111,b)].
% 1.83/2.12 118 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(ax71) # label(axiom). [clausify(64)].
% 1.83/2.12 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(118,b,111,b)].
% 1.83/2.12 119 duplicatefreeP(nil) # label(ax72) # label(axiom). [assumption].
% 1.83/2.12 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(119,a,111,b)].
% 1.83/2.12 120 -ssList(A) | equalelemsP(A) | ssItem(f38(A)) # label(ax14) # label(axiom). [clausify(14)].
% 1.83/2.12 121 -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)].
% 1.83/2.12 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(120,b,121,b)].
% 1.83/2.12 122 -ssList(A) | equalelemsP(A) | ssItem(f39(A)) # label(ax14) # label(axiom). [clausify(14)].
% 1.83/2.12 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(122,b,121,b)].
% 1.83/2.12 123 -ssList(A) | equalelemsP(A) | ssList(f40(A)) # label(ax14) # label(axiom). [clausify(14)].
% 1.83/2.12 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(123,b,121,b)].
% 1.83/2.12 124 -ssList(A) | equalelemsP(A) | ssList(f41(A)) # label(ax14) # label(axiom). [clausify(14)].
% 1.83/2.12 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(124,b,121,b)].
% 1.83/2.12 125 -ssList(A) | equalelemsP(A) | app(f40(A),cons(f38(A),cons(f39(A),f41(A)))) = A # label(ax14) # label(axiom). [clausify(14)].
% 1.83/2.12 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(125,b,121,b)].
% 1.83/2.12 126 -ssList(A) | equalelemsP(A) | f39(A) != f38(A) # label(ax14) # label(axiom). [clausify(14)].
% 1.83/2.12 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(126,b,121,b)].
% 1.83/2.12 127 -ssItem(A) | equalelemsP(cons(A,nil)) # label(ax73) # label(axiom). [clausify(65)].
% 1.83/2.12 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(127,b,121,b)].
% 1.83/2.12 128 equalelemsP(nil) # label(ax74) # label(axiom). [assumption].
% 1.83/2.12 Derived: -ssList(nil) | -ssItem(A) | -ssItem(B) | -ssList(C) | -ssList(D) | app(C,cons(A,cons(B,D))) != nil | B = A. [resolve(128,a,121,b)].
% 1.83/2.12
% 1.83/2.12 ============================== end predicate elimination =============
% 1.83/2.12
% 1.83/2.12 Auto_denials: (non-Horn, no changes).
% 1.83/2.12
% 1.83/2.12 Term ordering decisions:
% 1.83/2.12 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.
% 1.83/2.12
% 1.83/2.12 ============================== end of process initial clauses ========
% 1.83/2.12
% 1.83/2.12 ============================== CLAUSES FOR SEARCH ====================
% 1.83/2.12
% 1.83/2.12 ============================== end of clauses for search =============
% 1.83/2.12
% 1.83/2.12 ============================== SEARCH ================================
% 1.83/2.12
% 1.83/2.12 % Starting search at 0.29 seconds.
% 1.83/2.12
% 1.83/2.12 Low Water (keep): wt=38.000, iters=3354
% 1.83/2.12
% 1.83/2.12 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 38 (0.00 of 0.89 sec).
% 1.83/2.12
% 1.83/2.12 Low Water (keep): wt=34.000, iters=3348
% 1.83/2.12
% 1.83/2.12 Low Water (keep): wt=33.000, iters=3460
% 1.83/2.12
% 1.83/2.12 Low Water (keep): wt=32.000, iters=3442
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=30.000, iters=3358
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=29.000, iters=3439
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=28.000, iters=3512
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=23.000, iters=3398
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=22.000, iters=3498
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=21.000, iters=3352
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=20.000, iters=3422
% 2.41/2.72
% 2.41/2.72 Low Water (keep): wt=18.000, iters=3416
% 2.41/2.72
% 2.41/2.72 ============================== PROOF =================================
% 2.41/2.72 % SZS status Theorem
% 2.41/2.72 % SZS output start Refutation
% 2.41/2.72
% 2.41/2.72 % Proof 1 at 1.82 (+ 0.02) seconds.
% 2.41/2.72 % Length of proof is 13.
% 2.41/2.72 % Level of proof is 4.
% 2.41/2.72 % Maximum clause weight is 10.000.
% 2.41/2.72 % Given clauses 1258.
% 2.41/2.72
% 2.41/2.72 15 (all U (ssList(U) -> (all V (ssList(V) -> (neq(U,V) <-> U != V))))) # label(ax15) # label(axiom) # label(non_clause). [assumption].
% 2.41/2.72 87 -(all U (ssList(U) -> (all V (ssList(V) -> (all W (ssList(W) -> (all X (ssList(X) -> V != X | U != W | neq(X,nil) | cyclefreeP(V))))))))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption].
% 2.41/2.72 177 -ssList(A) | -ssList(B) | neq(A,B) | B = A # label(ax15) # label(axiom). [clausify(15)].
% 2.41/2.72 179 ssList(nil) # label(ax17) # label(axiom). [assumption].
% 2.41/2.72 236 cyclefreeP(nil) # label(ax60) # label(axiom). [assumption].
% 2.41/2.72 278 ssList(c4) # label(co1) # label(negated_conjecture). [clausify(87)].
% 2.41/2.72 281 c6 = c4 # label(co1) # label(negated_conjecture). [clausify(87)].
% 2.41/2.72 283 -neq(c6,nil) # label(co1) # label(negated_conjecture). [clausify(87)].
% 2.41/2.72 284 -neq(c4,nil). [copy(283),rewrite([281(1)])].
% 2.41/2.72 285 -cyclefreeP(c4) # label(co1) # label(negated_conjecture). [clausify(87)].
% 2.41/2.72 1326 -ssList(A) | neq(A,nil) | nil = A. [resolve(179,a,177,b)].
% 2.41/2.72 10339 c4 = nil. [resolve(1326,a,278,a),flip(b),unit_del(a,284)].
% 2.41/2.72 11451 $F. [back_rewrite(285),rewrite([10339(1)]),unit_del(a,236)].
% 2.41/2.72
% 2.41/2.72 % SZS output end Refutation
% 2.41/2.72 ============================== end of proof ==========================
% 2.41/2.72
% 2.41/2.72 ============================== STATISTICS ============================
% 2.41/2.72
% 2.41/2.72 Given=1258. Generated=30998. Kept=11286. proofs=1.
% 2.41/2.72 Usable=1181. Sos=4265. Demods=95. Limbo=1112, Disabled=4961. Hints=0.
% 2.41/2.72 Megabytes=17.22.
% 2.41/2.72 User_CPU=1.82, System_CPU=0.02, Wall_clock=2.
% 2.41/2.72
% 2.41/2.72 ============================== end of statistics =====================
% 2.41/2.72
% 2.41/2.72 ============================== end of search =========================
% 2.41/2.72
% 2.41/2.72 THEOREM PROVED
% 2.41/2.72 % SZS status Theorem
% 2.41/2.72
% 2.41/2.72 Exiting with 1 proof.
% 2.41/2.72
% 2.41/2.72 Process 32462 exit (max_proofs) Sun Jun 12 19:42:28 2022
% 2.41/2.72 Prover9 interrupted
%------------------------------------------------------------------------------