TSTP Solution File: SWC271-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC271-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:01:13 EDT 2024
% Result : Unsatisfiable 1.45s 1.63s
% Output : Proof 1.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SWC271-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.15 % Command : do_cvc5 %s %d
% 0.16/0.36 % Computer : n006.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 26 15:54:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.45/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.5gyzn0L6ex/cvc5---1.0.5_15366.smt2
% 1.45/1.63 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.5gyzn0L6ex/cvc5---1.0.5_15366.smt2
% 1.45/1.65 (assume a0 (tptp.equalelemsP tptp.nil))
% 1.45/1.65 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 1.45/1.65 (assume a2 (tptp.strictorderedP tptp.nil))
% 1.45/1.65 (assume a3 (tptp.totalorderedP tptp.nil))
% 1.45/1.65 (assume a4 (tptp.strictorderP tptp.nil))
% 1.45/1.65 (assume a5 (tptp.totalorderP tptp.nil))
% 1.45/1.65 (assume a6 (tptp.cyclefreeP tptp.nil))
% 1.45/1.65 (assume a7 (tptp.ssList tptp.nil))
% 1.45/1.65 (assume a8 (tptp.ssItem tptp.skac3))
% 1.45/1.65 (assume a9 (tptp.ssItem tptp.skac2))
% 1.45/1.65 (assume a10 (not (tptp.singletonP tptp.nil)))
% 1.45/1.65 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 1.45/1.65 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 1.45/1.65 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 1.45/1.65 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 1.45/1.65 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 1.45/1.65 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 1.45/1.65 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 1.45/1.65 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 1.45/1.65 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 1.45/1.65 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 1.45/1.65 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 1.45/1.65 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 1.45/1.65 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 1.45/1.65 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 1.45/1.65 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 1.45/1.65 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 1.45/1.65 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 1.45/1.65 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 1.45/1.65 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 1.45/1.65 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 1.45/1.65 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 1.45/1.65 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 1.45/1.65 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 1.45/1.65 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 1.45/1.65 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 1.45/1.65 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 1.45/1.65 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 1.45/1.65 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 1.45/1.65 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 1.45/1.65 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 1.45/1.65 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 1.45/1.65 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 1.45/1.65 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 1.45/1.65 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 1.45/1.65 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 1.45/1.65 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 1.45/1.65 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 1.45/1.65 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 1.45/1.65 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 1.45/1.65 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 1.45/1.65 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 1.45/1.65 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 1.45/1.65 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 1.45/1.65 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 1.45/1.65 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 1.45/1.65 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 1.45/1.65 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 1.45/1.65 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 1.45/1.65 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 1.45/1.65 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 1.45/1.65 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 1.45/1.65 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 1.45/1.65 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 1.45/1.65 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 1.45/1.65 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 1.45/1.65 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 1.45/1.65 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 1.45/1.65 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 1.45/1.65 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 1.45/1.65 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 1.45/1.65 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 1.45/1.65 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 1.45/1.65 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 1.45/1.65 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.45/1.65 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.45/1.65 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.45/1.65 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.45/1.65 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 1.45/1.65 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.45/1.65 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 1.45/1.65 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.45/1.65 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 1.45/1.65 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.45/1.65 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 1.45/1.65 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.45/1.65 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 1.45/1.65 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 1.45/1.65 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 1.45/1.65 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 1.45/1.65 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 1.45/1.65 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.45/1.65 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.45/1.65 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.45/1.65 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.45/1.65 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 1.45/1.65 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 1.45/1.65 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.45/1.65 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.45/1.65 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 1.45/1.65 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 1.45/1.65 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 1.45/1.65 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 1.45/1.65 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 1.45/1.65 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 1.45/1.65 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 1.45/1.65 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 1.45/1.65 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 1.45/1.65 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 1.45/1.65 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 1.45/1.65 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.45/1.65 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 1.45/1.65 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 1.45/1.65 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 1.45/1.65 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 1.45/1.65 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 1.45/1.65 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.45/1.65 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.45/1.65 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 1.45/1.65 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 1.45/1.65 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 1.45/1.65 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 1.45/1.65 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 1.45/1.65 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 1.45/1.65 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 1.45/1.65 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 1.45/1.65 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.45/1.65 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.45/1.65 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.45/1.65 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 1.45/1.65 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 1.45/1.65 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 1.45/1.65 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 1.45/1.65 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 1.45/1.65 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 1.45/1.65 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 1.45/1.65 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 1.45/1.65 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 1.45/1.65 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 1.45/1.65 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 1.45/1.65 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 1.45/1.65 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 1.45/1.65 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 1.45/1.65 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 1.45/1.65 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 1.45/1.65 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 1.45/1.65 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 1.45/1.65 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 1.45/1.65 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 1.45/1.65 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 1.45/1.65 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 1.45/1.65 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 1.45/1.65 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 1.45/1.65 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 1.45/1.65 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 1.45/1.65 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 1.45/1.65 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 1.45/1.65 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 1.45/1.65 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 1.45/1.65 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 1.45/1.65 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 1.45/1.65 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 1.45/1.65 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 1.45/1.65 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 1.45/1.65 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 1.45/1.65 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 1.45/1.65 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 1.45/1.65 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 1.45/1.65 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 1.45/1.65 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 1.45/1.65 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 1.45/1.65 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 1.45/1.65 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 1.45/1.65 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 1.45/1.65 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 1.45/1.65 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 1.45/1.65 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 1.45/1.65 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 1.45/1.65 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 1.45/1.65 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 1.45/1.65 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 1.45/1.65 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 1.45/1.65 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 1.45/1.65 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 1.45/1.65 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 1.45/1.65 (assume a185 (tptp.ssList tptp.sk1))
% 1.45/1.65 (assume a186 (tptp.ssList tptp.sk2))
% 1.45/1.65 (assume a187 (tptp.ssList tptp.sk3))
% 1.45/1.65 (assume a188 (tptp.ssList tptp.sk4))
% 1.45/1.65 (assume a189 (= tptp.sk2 tptp.sk4))
% 1.45/1.65 (assume a190 (= tptp.sk1 tptp.sk3))
% 1.45/1.65 (assume a191 (tptp.frontsegP tptp.sk4 tptp.sk3))
% 1.45/1.65 (assume a192 (tptp.strictorderedP tptp.sk3))
% 1.45/1.65 (assume a193 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.strictorderedP A)))))
% 1.45/1.65 (assume a194 (not (tptp.totalorderedP tptp.sk1)))
% 1.45/1.65 (step t1 (cl (not (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) :rule or_pos)
% 1.45/1.65 (step t2 (cl (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule reordering :premises (t1))
% 1.45/1.65 (step t3 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule and_neg)
% 1.45/1.65 (step t4 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t5)
% 1.45/1.65 (assume t5.a0 (tptp.ssList tptp.sk1))
% 1.45/1.65 (assume t5.a1 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))
% 1.45/1.65 (step t5.t1 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t5.t2)
% 1.45/1.65 (assume t5.t2.a0 (tptp.ssList tptp.sk1))
% 1.45/1.65 (assume t5.t2.a1 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))
% 1.45/1.65 (step t5.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) true) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule equiv_simplify)
% 1.45/1.65 (step t5.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) true)) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule equiv1 :premises (t5.t2.t1))
% 1.45/1.65 (step t5.t2.t3 (cl (= (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))) tptp.sk1)) :rule symm :premises (t5.t2.a1))
% 1.45/1.65 (step t5.t2.t4 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) (tptp.ssList tptp.sk1))) :rule cong :premises (t5.t2.t3))
% 1.45/1.65 (step t5.t2.t5 (cl (= (= (tptp.ssList tptp.sk1) true) (tptp.ssList tptp.sk1))) :rule equiv_simplify)
% 1.45/1.65 (step t5.t2.t6 (cl (= (tptp.ssList tptp.sk1) true) (not (tptp.ssList tptp.sk1))) :rule equiv2 :premises (t5.t2.t5))
% 1.45/1.65 (step t5.t2.t7 (cl (= (tptp.ssList tptp.sk1) true)) :rule resolution :premises (t5.t2.t6 t5.t2.a0))
% 1.45/1.65 (step t5.t2.t8 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) true)) :rule trans :premises (t5.t2.t4 t5.t2.t7))
% 1.45/1.65 (step t5.t2.t9 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t5.t2.t2 t5.t2.t8))
% 1.45/1.65 (step t5.t2 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule subproof :discharge (t5.t2.a0 t5.t2.a1))
% 1.45/1.65 (step t5.t3 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList tptp.sk1)) :rule and_pos)
% 1.45/1.65 (step t5.t4 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule and_pos)
% 1.45/1.65 (step t5.t5 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule resolution :premises (t5.t2 t5.t3 t5.t4))
% 1.45/1.65 (step t5.t6 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule reordering :premises (t5.t5))
% 1.45/1.65 (step t5.t7 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule contraction :premises (t5.t6))
% 1.45/1.65 (step t5.t8 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t5.t1 t5.t7))
% 1.45/1.65 (step t5.t9 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg2)
% 1.45/1.65 (step t5.t10 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t5.t8 t5.t9))
% 1.45/1.65 (step t5.t11 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule contraction :premises (t5.t10))
% 1.45/1.65 (step t5.t12 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule implies :premises (t5.t11))
% 1.45/1.65 (step t5.t13 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule and_neg)
% 1.45/1.65 (step t5.t14 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t5.t13 t5.a0 t5.a1))
% 1.45/1.65 (step t5.t15 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t5.t12 t5.t14))
% 1.45/1.65 (step t5 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule subproof :discharge (t5.a0 t5.a1))
% 1.45/1.65 (step t6 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList tptp.sk1)) :rule and_pos)
% 1.45/1.65 (step t7 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule and_pos)
% 1.45/1.65 (step t8 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule resolution :premises (t5 t6 t7))
% 1.45/1.65 (step t9 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule reordering :premises (t8))
% 1.45/1.65 (step t10 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule contraction :premises (t9))
% 1.45/1.65 (step t11 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t4 t10))
% 1.45/1.65 (step t12 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg2)
% 1.45/1.65 (step t13 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t11 t12))
% 1.45/1.65 (step t14 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule contraction :premises (t13))
% 1.45/1.65 (step t15 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule implies :premises (t14))
% 1.45/1.65 (step t16 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t3 t15))
% 1.45/1.65 (step t17 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule or_pos)
% 1.45/1.65 (step t18 (cl (tptp.totalorderedP tptp.sk1) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule reordering :premises (t17))
% 1.45/1.65 (step t19 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t20)
% 1.45/1.65 (assume t20.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))))
% 1.45/1.65 (step t20.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.45/1.65 (step t20.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule or :premises (t20.t1))
% 1.45/1.65 (step t20.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t20.t2 t20.a0))
% 1.45/1.65 (step t20 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule subproof :discharge (t20.a0))
% 1.45/1.65 (step t21 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t19 t20))
% 1.45/1.65 (step t22 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule implies_neg2)
% 1.45/1.65 (step t23 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule resolution :premises (t21 t22))
% 1.45/1.65 (step t24 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule contraction :premises (t23))
% 1.45/1.65 (step t25 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies :premises (t24))
% 1.45/1.65 (step t26 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) :rule equiv_pos2)
% 1.45/1.65 (anchor :step t27 :args ((U $$unsorted) (:= U U)))
% 1.45/1.65 (step t27.t1 (cl (= U U)) :rule refl)
% 1.45/1.65 (step t27.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.45/1.65 (step t27.t3 (cl (= (tptp.totalorderedP U) (tptp.totalorderedP U))) :rule refl)
% 1.45/1.65 (step t27.t4 (cl (= (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))) :rule all_simplify)
% 1.45/1.65 (step t27.t5 (cl (= (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) :rule cong :premises (t27.t2 t27.t3 t27.t4))
% 1.45/1.65 (step t27 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U)))))))) :rule bind)
% 1.45/1.65 (step t28 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= U (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))))))) :rule resolution :premises (t26 t27 a163))
% 1.45/1.65 (step t29 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t25 t28))
% 1.45/1.65 (step t30 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t18 a194 a185 t29))
% 1.45/1.65 (step t31 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t16 a185 t30))
% 1.45/1.65 (step t32 (cl (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule and_neg)
% 1.45/1.65 (step t33 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t34)
% 1.45/1.65 (assume t34.a0 (= tptp.sk1 tptp.sk3))
% 1.45/1.65 (assume t34.a1 (tptp.strictorderedP tptp.sk3))
% 1.45/1.65 (assume t34.a2 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))
% 1.45/1.65 (step t34.t1 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t34.t2)
% 1.45/1.65 (assume t34.t2.a0 (tptp.strictorderedP tptp.sk3))
% 1.45/1.65 (assume t34.t2.a1 (= tptp.sk1 tptp.sk3))
% 1.45/1.65 (assume t34.t2.a2 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))
% 1.45/1.65 (step t34.t2.t1 (cl (= (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) true) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule equiv_simplify)
% 1.45/1.65 (step t34.t2.t2 (cl (not (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) true)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule equiv1 :premises (t34.t2.t1))
% 1.45/1.65 (step t34.t2.t3 (cl (= (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))) tptp.sk1)) :rule symm :premises (t34.t2.a2))
% 1.45/1.65 (step t34.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t34.t2.a1))
% 1.45/1.65 (step t34.t2.t5 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t34.t2.t4))
% 1.45/1.65 (step t34.t2.t6 (cl (= (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))) tptp.sk3)) :rule trans :premises (t34.t2.t3 t34.t2.t5))
% 1.45/1.65 (step t34.t2.t7 (cl (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t34.t2.t6))
% 1.45/1.65 (step t34.t2.t8 (cl (= (= (tptp.strictorderedP tptp.sk3) true) (tptp.strictorderedP tptp.sk3))) :rule equiv_simplify)
% 1.45/1.65 (step t34.t2.t9 (cl (= (tptp.strictorderedP tptp.sk3) true) (not (tptp.strictorderedP tptp.sk3))) :rule equiv2 :premises (t34.t2.t8))
% 1.45/1.65 (step t34.t2.t10 (cl (= (tptp.strictorderedP tptp.sk3) true)) :rule resolution :premises (t34.t2.t9 t34.t2.a0))
% 1.45/1.65 (step t34.t2.t11 (cl (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) true)) :rule trans :premises (t34.t2.t7 t34.t2.t10))
% 1.45/1.65 (step t34.t2.t12 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t34.t2.t2 t34.t2.t11))
% 1.45/1.65 (step t34.t2 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule subproof :discharge (t34.t2.a0 t34.t2.a1 t34.t2.a2))
% 1.45/1.65 (step t34.t3 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP tptp.sk3)) :rule and_pos)
% 1.45/1.65 (step t34.t4 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.45/1.65 (step t34.t5 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule and_pos)
% 1.45/1.65 (step t34.t6 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule resolution :premises (t34.t2 t34.t3 t34.t4 t34.t5))
% 1.45/1.65 (step t34.t7 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule reordering :premises (t34.t6))
% 1.45/1.65 (step t34.t8 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule contraction :premises (t34.t7))
% 1.45/1.65 (step t34.t9 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t34.t1 t34.t8))
% 1.45/1.65 (step t34.t10 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg2)
% 1.45/1.65 (step t34.t11 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t34.t9 t34.t10))
% 1.45/1.65 (step t34.t12 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule contraction :premises (t34.t11))
% 1.45/1.65 (step t34.t13 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule implies :premises (t34.t12))
% 1.45/1.65 (step t34.t14 (cl (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule and_neg)
% 1.45/1.65 (step t34.t15 (cl (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t34.t14 t34.a1 t34.a0 t34.a2))
% 1.45/1.65 (step t34.t16 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t34.t13 t34.t15))
% 1.45/1.65 (step t34 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule subproof :discharge (t34.a0 t34.a1 t34.a2))
% 1.45/1.65 (step t35 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.45/1.65 (step t36 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP tptp.sk3)) :rule and_pos)
% 1.45/1.65 (step t37 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule and_pos)
% 1.45/1.65 (step t38 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))))) :rule resolution :premises (t34 t35 t36 t37))
% 1.45/1.65 (step t39 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule reordering :premises (t38))
% 1.45/1.65 (step t40 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule contraction :premises (t39))
% 1.45/1.65 (step t41 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t33 t40))
% 1.45/1.65 (step t42 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule implies_neg2)
% 1.45/1.65 (step t43 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule resolution :premises (t41 t42))
% 1.45/1.65 (step t44 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) :rule contraction :premises (t43))
% 1.45/1.65 (step t45 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule implies :premises (t44))
% 1.45/1.65 (step t46 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t32 t45))
% 1.45/1.65 (step t47 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) :rule resolution :premises (t46 a190 a192 t30))
% 1.45/1.65 (step t48 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))) (tptp.ssList (tptp.skaf66 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t49)
% 1.45/1.65 (assume t49.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 1.45/1.65 (step t49.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U)))) (tptp.ssList (tptp.skaf66 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.45/1.65 (step t49.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U)))) (tptp.ssList (tptp.skaf66 tptp.sk1))) :rule or :premises (t49.t1))
% 1.45/1.65 (step t49.t3 (cl (tptp.ssList (tptp.skaf66 tptp.sk1))) :rule resolution :premises (t49.t2 t49.a0))
% 1.45/1.65 (step t49 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U)))) (tptp.ssList (tptp.skaf66 tptp.sk1))) :rule subproof :discharge (t49.a0))
% 1.45/1.65 (step t50 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))) (tptp.ssList (tptp.skaf66 tptp.sk1))) (tptp.ssList (tptp.skaf66 tptp.sk1))) :rule resolution :premises (t48 t49))
% 1.45/1.65 (step t51 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))) (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1)))) :rule implies_neg2)
% 1.45/1.65 (step t52 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))) (tptp.ssList (tptp.skaf66 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))) (tptp.ssList (tptp.skaf66 tptp.sk1)))) :rule resolution :premises (t50 t51))
% 1.45/1.65 (step t53 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))) (tptp.ssList (tptp.skaf66 tptp.sk1)))) :rule contraction :premises (t52))
% 1.45/1.65 (step t54 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U)))) (tptp.ssList (tptp.skaf66 tptp.sk1))) :rule implies :premises (t53))
% 1.45/1.65 (step t55 (cl (tptp.ssList (tptp.skaf66 tptp.sk1))) :rule resolution :premises (t54 a28))
% 1.45/1.65 (step t56 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t57)
% 1.45/1.65 (assume t57.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 1.45/1.65 (step t57.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U)))) (tptp.ssItem (tptp.skaf65 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.45/1.65 (step t57.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U)))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) :rule or :premises (t57.t1))
% 1.45/1.65 (step t57.t3 (cl (tptp.ssItem (tptp.skaf65 tptp.sk1))) :rule resolution :premises (t57.t2 t57.a0))
% 1.45/1.65 (step t57 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U)))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) :rule subproof :discharge (t57.a0))
% 1.45/1.65 (step t58 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) :rule resolution :premises (t56 t57))
% 1.45/1.65 (step t59 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1)))) :rule implies_neg2)
% 1.45/1.65 (step t60 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))) (tptp.ssItem (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t58 t59))
% 1.45/1.65 (step t61 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))) (tptp.ssItem (tptp.skaf65 tptp.sk1)))) :rule contraction :premises (t60))
% 1.45/1.65 (step t62 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U)))) (tptp.ssItem (tptp.skaf65 tptp.sk1))) :rule implies :premises (t61))
% 1.45/1.65 (step t63 (cl (tptp.ssItem (tptp.skaf65 tptp.sk1))) :rule resolution :premises (t62 a29))
% 1.45/1.65 (step t64 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t65)
% 1.45/1.65 (assume t65.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 1.45/1.65 (step t65.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U)))) (tptp.ssItem (tptp.skaf64 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.45/1.65 (step t65.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U)))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) :rule or :premises (t65.t1))
% 1.45/1.65 (step t65.t3 (cl (tptp.ssItem (tptp.skaf64 tptp.sk1))) :rule resolution :premises (t65.t2 t65.a0))
% 1.45/1.65 (step t65 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U)))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) :rule subproof :discharge (t65.a0))
% 1.45/1.65 (step t66 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) :rule resolution :premises (t64 t65))
% 1.45/1.65 (step t67 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1)))) :rule implies_neg2)
% 1.45/1.65 (step t68 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))) (tptp.ssItem (tptp.skaf64 tptp.sk1)))) :rule resolution :premises (t66 t67))
% 1.45/1.65 (step t69 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))) (tptp.ssItem (tptp.skaf64 tptp.sk1)))) :rule contraction :premises (t68))
% 1.45/1.65 (step t70 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U)))) (tptp.ssItem (tptp.skaf64 tptp.sk1))) :rule implies :premises (t69))
% 1.45/1.65 (step t71 (cl (tptp.ssItem (tptp.skaf64 tptp.sk1))) :rule resolution :premises (t70 a30))
% 1.45/1.65 (step t72 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))) (tptp.ssList (tptp.skaf68 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t73)
% 1.45/1.65 (assume t73.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 1.45/1.65 (step t73.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U)))) (tptp.ssList (tptp.skaf68 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.45/1.65 (step t73.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U)))) (tptp.ssList (tptp.skaf68 tptp.sk1))) :rule or :premises (t73.t1))
% 1.45/1.65 (step t73.t3 (cl (tptp.ssList (tptp.skaf68 tptp.sk1))) :rule resolution :premises (t73.t2 t73.a0))
% 1.45/1.65 (step t73 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U)))) (tptp.ssList (tptp.skaf68 tptp.sk1))) :rule subproof :discharge (t73.a0))
% 1.45/1.65 (step t74 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))) (tptp.ssList (tptp.skaf68 tptp.sk1))) (tptp.ssList (tptp.skaf68 tptp.sk1))) :rule resolution :premises (t72 t73))
% 1.45/1.65 (step t75 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))) (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf68 tptp.sk1)))) :rule implies_neg2)
% 1.45/1.65 (step t76 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))) (tptp.ssList (tptp.skaf68 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))) (tptp.ssList (tptp.skaf68 tptp.sk1)))) :rule resolution :premises (t74 t75))
% 1.45/1.65 (step t77 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))) (tptp.ssList (tptp.skaf68 tptp.sk1)))) :rule contraction :premises (t76))
% 1.45/1.65 (step t78 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U)))) (tptp.ssList (tptp.skaf68 tptp.sk1))) :rule implies :premises (t77))
% 1.45/1.65 (step t79 (cl (tptp.ssList (tptp.skaf68 tptp.sk1))) :rule resolution :premises (t78 a26))
% 1.45/1.65 (step t80 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t81)
% 1.45/1.65 (assume t81.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))
% 1.45/1.65 (step t81.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule forall_inst :args ((:= U (tptp.skaf66 tptp.sk1)) (:= V (tptp.skaf64 tptp.sk1)) (:= W (tptp.skaf67 tptp.sk1)) (:= X (tptp.skaf65 tptp.sk1)) (:= Y (tptp.skaf68 tptp.sk1))))
% 1.45/1.65 (step t81.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule or :premises (t81.t1))
% 1.45/1.65 (step t81.t3 (cl (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t81.t2 t81.a0))
% 1.45/1.65 (step t81 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule subproof :discharge (t81.a0))
% 1.45/1.65 (step t82 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t80 t81))
% 1.45/1.65 (step t83 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (not (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule implies_neg2)
% 1.45/1.65 (step t84 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule resolution :premises (t82 t83))
% 1.45/1.65 (step t85 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule contraction :premises (t84))
% 1.45/1.65 (step t86 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule implies :premises (t85))
% 1.45/1.65 (step t87 (cl (not (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule equiv_pos2)
% 1.45/1.65 (anchor :step t88 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y) (Z $$unsorted) (:= Z Z)))
% 1.45/1.65 (step t88.t1 (cl (= U U)) :rule refl)
% 1.45/1.65 (step t88.t2 (cl (= V V)) :rule refl)
% 1.45/1.65 (step t88.t3 (cl (= W W)) :rule refl)
% 1.45/1.65 (step t88.t4 (cl (= X X)) :rule refl)
% 1.45/1.65 (step t88.t5 (cl (= Y Y)) :rule refl)
% 1.45/1.65 (step t88.t6 (cl (= Z Z)) :rule refl)
% 1.45/1.65 (step t88.t7 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z) (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y))))) :rule all_simplify)
% 1.45/1.65 (step t88.t8 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule cong :premises (t88.t7))
% 1.45/1.65 (step t88.t9 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 1.45/1.65 (step t88.t10 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 1.45/1.65 (step t88.t11 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.45/1.65 (step t88.t12 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 1.45/1.65 (step t88.t13 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 1.45/1.65 (step t88.t14 (cl (= (not (tptp.strictorderedP Z)) (not (tptp.strictorderedP Z)))) :rule refl)
% 1.45/1.65 (step t88.t15 (cl (= (not (tptp.ssList Z)) (not (tptp.ssList Z)))) :rule refl)
% 1.45/1.65 (step t88.t16 (cl (= (tptp.lt V X) (tptp.lt V X))) :rule refl)
% 1.45/1.65 (step t88.t17 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X)))) :rule cong :premises (t88.t8 t88.t9 t88.t10 t88.t11 t88.t12 t88.t13 t88.t14 t88.t15 t88.t16))
% 1.45/1.65 (step t88 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))) :rule bind)
% 1.45/1.65 (step t89 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule all_simplify)
% 1.45/1.65 (anchor :step t90 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 1.45/1.65 (step t90.t1 (cl (= U U)) :rule refl)
% 1.45/1.65 (step t90.t2 (cl (= V V)) :rule refl)
% 1.45/1.65 (step t90.t3 (cl (= W W)) :rule refl)
% 1.45/1.65 (step t90.t4 (cl (= X X)) :rule refl)
% 1.45/1.65 (step t90.t5 (cl (= Y Y)) :rule refl)
% 1.45/1.65 (step t90.t6 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y))) true)) :rule all_simplify)
% 1.45/1.65 (step t90.t7 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not true))) :rule cong :premises (t90.t6))
% 1.45/1.65 (step t90.t8 (cl (= (not true) false)) :rule all_simplify)
% 1.45/1.65 (step t90.t9 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) false)) :rule trans :premises (t90.t7 t90.t8))
% 1.45/1.65 (step t90.t10 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 1.45/1.65 (step t90.t11 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 1.45/1.65 (step t90.t12 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.45/1.65 (step t90.t13 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 1.45/1.65 (step t90.t14 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 1.45/1.65 (step t90.t15 (cl (= (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule refl)
% 1.45/1.65 (step t90.t16 (cl (= (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))))) :rule refl)
% 1.45/1.65 (step t90.t17 (cl (= (tptp.lt V X) (tptp.lt V X))) :rule refl)
% 1.45/1.65 (step t90.t18 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)) (or false (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule cong :premises (t90.t9 t90.t10 t90.t11 t90.t12 t90.t13 t90.t14 t90.t15 t90.t16 t90.t17))
% 1.45/1.65 (step t90.t19 (cl (= (or false (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule all_simplify)
% 1.45/1.65 (step t90.t20 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule trans :premises (t90.t18 t90.t19))
% 1.45/1.65 (step t90 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule bind)
% 1.45/1.65 (step t91 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= Z (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule trans :premises (t89 t90))
% 1.45/1.65 (step t92 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X))))) :rule trans :premises (t88 t91))
% 1.45/1.65 (step t93 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)))) (tptp.lt V X)))) :rule resolution :premises (t87 t92 a180))
% 1.45/1.65 (step t94 (cl (or (not (tptp.ssList (tptp.skaf68 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf66 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf66 tptp.sk1) (tptp.cons (tptp.skaf64 tptp.sk1) (tptp.skaf67 tptp.sk1))) (tptp.cons (tptp.skaf65 tptp.sk1) (tptp.skaf68 tptp.sk1))))) (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t86 t93))
% 1.45/1.65 (step t95 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))) (tptp.ssList (tptp.skaf67 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t96)
% 1.45/1.65 (assume t96.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 1.45/1.65 (step t96.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U)))) (tptp.ssList (tptp.skaf67 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.45/1.65 (step t96.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U)))) (tptp.ssList (tptp.skaf67 tptp.sk1))) :rule or :premises (t96.t1))
% 1.45/1.65 (step t96.t3 (cl (tptp.ssList (tptp.skaf67 tptp.sk1))) :rule resolution :premises (t96.t2 t96.a0))
% 1.45/1.65 (step t96 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U)))) (tptp.ssList (tptp.skaf67 tptp.sk1))) :rule subproof :discharge (t96.a0))
% 1.45/1.65 (step t97 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))) (tptp.ssList (tptp.skaf67 tptp.sk1))) (tptp.ssList (tptp.skaf67 tptp.sk1))) :rule resolution :premises (t95 t96))
% 1.45/1.65 (step t98 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))) (tptp.ssList (tptp.skaf67 tptp.sk1))) (not (tptp.ssList (tptp.skaf67 tptp.sk1)))) :rule implies_neg2)
% 1.45/1.65 (step t99 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))) (tptp.ssList (tptp.skaf67 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))) (tptp.ssList (tptp.skaf67 tptp.sk1)))) :rule resolution :premises (t97 t98))
% 1.45/1.65 (step t100 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))) (tptp.ssList (tptp.skaf67 tptp.sk1)))) :rule contraction :premises (t99))
% 1.45/1.65 (step t101 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U)))) (tptp.ssList (tptp.skaf67 tptp.sk1))) :rule implies :premises (t100))
% 1.45/1.65 (step t102 (cl (tptp.ssList (tptp.skaf67 tptp.sk1))) :rule resolution :premises (t101 a27))
% 1.45/1.65 (step t103 (cl (not (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) :rule or_pos)
% 1.45/1.65 (step t104 (cl (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule reordering :premises (t103))
% 1.45/1.65 (step t105 (cl (not (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1)) :rule or_pos)
% 1.45/1.65 (step t106 (cl (tptp.totalorderedP tptp.sk1) (not (tptp.ssList tptp.sk1)) (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1)))) :rule reordering :premises (t105))
% 1.45/1.65 (step t107 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t108)
% 1.45/1.65 (assume t108.a0 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 1.45/1.65 (step t108.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U)))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.45/1.65 (step t108.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U)))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) :rule or :premises (t108.t1))
% 1.45/1.65 (step t108.t3 (cl (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) :rule resolution :premises (t108.t2 t108.a0))
% 1.45/1.65 (step t108 (cl (not (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U)))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) :rule subproof :discharge (t108.a0))
% 1.45/1.65 (step t109 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) :rule resolution :premises (t107 t108))
% 1.45/1.65 (step t110 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) (not (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1)))) :rule implies_neg2)
% 1.45/1.65 (step t111 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1)))) :rule resolution :premises (t109 t110))
% 1.45/1.65 (step t112 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1)))) :rule contraction :premises (t111))
% 1.45/1.65 (step t113 (cl (not (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U)))) (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) :rule implies :premises (t112))
% 1.45/1.65 (step t114 (cl (or (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.totalorderedP tptp.sk1))) :rule resolution :premises (t113 a90))
% 1.45/1.65 (step t115 (cl (not (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t106 a194 a185 t114))
% 1.45/1.65 (step t116 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) :rule implies_neg1)
% 1.45/1.65 (anchor :step t117)
% 1.45/1.65 (assume t117.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 1.45/1.65 (step t117.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule forall_inst :args ((:= U (tptp.skaf64 tptp.sk1)) (:= V (tptp.skaf65 tptp.sk1))))
% 1.45/1.65 (step t117.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule or :premises (t117.t1))
% 1.45/1.65 (step t117.t3 (cl (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t117.t2 t117.a0))
% 1.45/1.65 (step t117 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule subproof :discharge (t117.a0))
% 1.45/1.65 (step t118 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t116 t117))
% 1.45/1.65 (step t119 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (not (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule implies_neg2)
% 1.45/1.65 (step t120 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule resolution :premises (t118 t119))
% 1.45/1.65 (step t121 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))))) :rule contraction :premises (t120))
% 1.45/1.65 (step t122 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V)))) (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule implies :premises (t121))
% 1.45/1.65 (step t123 (cl (or (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf65 tptp.sk1))) (not (tptp.ssItem (tptp.skaf64 tptp.sk1))) (tptp.leq (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t122 a102))
% 1.45/1.65 (step t124 (cl (not (tptp.lt (tptp.skaf64 tptp.sk1) (tptp.skaf65 tptp.sk1)))) :rule resolution :premises (t104 t115 t71 t63 t123))
% 1.45/1.65 (step t125 (cl) :rule resolution :premises (t2 t31 t47 t55 t63 t71 t79 t94 t102 t124))
% 1.45/1.65
% 1.45/1.66 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.5gyzn0L6ex/cvc5---1.0.5_15366.smt2
% 1.45/1.66 % cvc5---1.0.5 exiting
% 1.45/1.66 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------