TSTP Solution File: SWC181-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC181-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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:00:50 EDT 2024
% Result : Unsatisfiable 2.93s 3.11s
% Output : Proof 2.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SWC181-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.15 % Command : do_cvc5 %s %d
% 0.16/0.36 % Computer : n018.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:39:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.54 %----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...
% 2.93/3.11 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.qTI4p2LuXn/cvc5---1.0.5_30398.smt2
% 2.93/3.11 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.qTI4p2LuXn/cvc5---1.0.5_30398.smt2
% 2.95/3.12 (assume a0 (tptp.equalelemsP tptp.nil))
% 2.95/3.12 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 2.95/3.12 (assume a2 (tptp.strictorderedP tptp.nil))
% 2.95/3.12 (assume a3 (tptp.totalorderedP tptp.nil))
% 2.95/3.12 (assume a4 (tptp.strictorderP tptp.nil))
% 2.95/3.12 (assume a5 (tptp.totalorderP tptp.nil))
% 2.95/3.12 (assume a6 (tptp.cyclefreeP tptp.nil))
% 2.95/3.12 (assume a7 (tptp.ssList tptp.nil))
% 2.95/3.12 (assume a8 (tptp.ssItem tptp.skac3))
% 2.95/3.12 (assume a9 (tptp.ssItem tptp.skac2))
% 2.95/3.12 (assume a10 (not (tptp.singletonP tptp.nil)))
% 2.95/3.12 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 2.95/3.12 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 2.95/3.12 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 2.95/3.12 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 2.95/3.12 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 2.95/3.12 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 2.95/3.12 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 2.95/3.12 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 2.95/3.12 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 2.95/3.12 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 2.95/3.12 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 2.95/3.12 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 2.95/3.12 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 2.95/3.12 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 2.95/3.12 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 2.95/3.12 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 2.95/3.12 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 2.95/3.12 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 2.95/3.12 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 2.95/3.12 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 2.95/3.12 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 2.95/3.12 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 2.95/3.12 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 2.95/3.12 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 2.95/3.12 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 2.95/3.12 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 2.95/3.12 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 2.95/3.12 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 2.95/3.12 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 2.95/3.12 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 2.95/3.12 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 2.95/3.12 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 2.95/3.12 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 2.95/3.12 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 2.95/3.12 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 2.95/3.12 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 2.95/3.12 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 2.95/3.12 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 2.95/3.12 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 2.95/3.12 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 2.95/3.12 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 2.95/3.12 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 2.95/3.12 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 2.95/3.12 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 2.95/3.12 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 2.95/3.12 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 2.95/3.12 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 2.95/3.12 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 2.95/3.12 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 2.95/3.12 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 2.95/3.12 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 2.95/3.12 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 2.95/3.12 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 2.95/3.12 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 2.95/3.12 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 2.95/3.12 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 2.95/3.12 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 2.95/3.12 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 2.95/3.12 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 2.95/3.12 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 2.95/3.12 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 2.95/3.12 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 2.95/3.12 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 2.95/3.12 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.95/3.12 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.95/3.12 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.95/3.12 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.95/3.12 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 2.95/3.12 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.95/3.12 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 2.95/3.12 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.95/3.12 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 2.95/3.12 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.95/3.12 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 2.95/3.12 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.95/3.12 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 2.95/3.12 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 2.95/3.12 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 2.95/3.12 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 2.95/3.12 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 2.95/3.12 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.95/3.12 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.95/3.12 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.95/3.12 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.95/3.12 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 2.95/3.12 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 2.95/3.12 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.95/3.12 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.95/3.12 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 2.95/3.12 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 2.95/3.12 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 2.95/3.12 (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))))
% 2.95/3.12 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 2.95/3.12 (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))))
% 2.95/3.12 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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))))
% 2.95/3.12 (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)))))
% 2.95/3.12 (assume a185 (tptp.ssList tptp.sk1))
% 2.95/3.12 (assume a186 (tptp.ssList tptp.sk2))
% 2.95/3.12 (assume a187 (tptp.ssList tptp.sk3))
% 2.95/3.12 (assume a188 (tptp.ssList tptp.sk4))
% 2.95/3.12 (assume a189 (= tptp.sk2 tptp.sk4))
% 2.95/3.12 (assume a190 (= tptp.sk1 tptp.sk3))
% 2.95/3.12 (assume a191 (tptp.ssList tptp.sk5))
% 2.95/3.12 (assume a192 (tptp.ssList tptp.sk6))
% 2.95/3.12 (assume a193 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4))
% 2.95/3.12 (assume a194 (tptp.strictorderedP tptp.sk3))
% 2.95/3.12 (assume a195 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app (tptp.cons C tptp.nil) D) tptp.sk3)) (not (tptp.lt A C)))))
% 2.95/3.12 (assume a196 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssItem C)) (not (tptp.ssList D)) (not (= (tptp.app D (tptp.cons C tptp.nil)) tptp.sk3)) (not (tptp.lt C A)))))
% 2.95/3.12 (assume a197 (not (tptp.duplicatefreeP tptp.sk1)))
% 2.95/3.12 (assume a198 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 2.95/3.12 (step t1 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t2)
% 2.95/3.12 (assume t2.a0 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 2.95/3.12 (step t2.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))))) :rule forall_inst :args ((:= U (tptp.skaf74 tptp.sk1))))
% 2.95/3.12 (step t2.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) :rule or :premises (t2.t1))
% 2.95/3.12 (step t2.t3 (cl (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) :rule resolution :premises (t2.t2 t2.a0))
% 2.95/3.12 (step t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) :rule subproof :discharge (t2.a0))
% 2.95/3.12 (step t3 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) :rule resolution :premises (t1 t2))
% 2.95/3.12 (step t4 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) (not (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))))) :rule implies_neg2)
% 2.95/3.12 (step t5 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))))) :rule resolution :premises (t3 t4))
% 2.95/3.12 (step t6 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))))) :rule contraction :premises (t5))
% 2.95/3.12 (step t7 (cl (not (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U))))) (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) :rule implies :premises (t6))
% 2.95/3.12 (step t8 (cl (not (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))))) (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule or_pos)
% 2.95/3.12 (step t9 (cl (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))))) :rule reordering :premises (t8))
% 2.95/3.12 (step t10 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t11)
% 2.95/3.12 (assume t11.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 2.95/3.12 (step t11.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.95/3.12 (step t11.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule or :premises (t11.t1))
% 2.95/3.12 (step t11.t3 (cl (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule resolution :premises (t11.t2 t11.a0))
% 2.95/3.12 (step t11 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule subproof :discharge (t11.a0))
% 2.95/3.12 (step t12 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule resolution :premises (t10 t11))
% 2.95/3.12 (step t13 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule implies_neg2)
% 2.95/3.12 (step t14 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule resolution :premises (t12 t13))
% 2.95/3.12 (step t15 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule contraction :premises (t14))
% 2.95/3.12 (step t16 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule implies :premises (t15))
% 2.95/3.12 (step t17 (cl (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule resolution :premises (t16 a20))
% 2.95/3.12 (step t18 (cl (not (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) :rule or_pos)
% 2.95/3.12 (step t19 (cl (not (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) :rule contraction :premises (t18))
% 2.95/3.12 (step t20 (cl (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)) (not (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))))) :rule reordering :premises (t19))
% 2.95/3.12 (step t21 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t22)
% 2.95/3.12 (assume t22.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 2.95/3.12 (step t22.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.95/3.12 (step t22.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule or :premises (t22.t1))
% 2.95/3.12 (step t22.t3 (cl (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule resolution :premises (t22.t2 t22.a0))
% 2.95/3.12 (step t22 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule subproof :discharge (t22.a0))
% 2.95/3.12 (step t23 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule resolution :premises (t21 t22))
% 2.95/3.12 (step t24 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule implies_neg2)
% 2.95/3.12 (step t25 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule resolution :premises (t23 t24))
% 2.95/3.12 (step t26 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule contraction :premises (t25))
% 2.95/3.12 (step t27 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule implies :premises (t26))
% 2.95/3.12 (step t28 (cl (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule resolution :premises (t27 a19))
% 2.95/3.12 (step t29 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t30)
% 2.95/3.12 (assume t30.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 2.95/3.12 (step t30.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.95/3.12 (step t30.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule or :premises (t30.t1))
% 2.95/3.12 (step t30.t3 (cl (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule resolution :premises (t30.t2 t30.a0))
% 2.95/3.12 (step t30 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule subproof :discharge (t30.a0))
% 2.95/3.12 (step t31 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule resolution :premises (t29 t30))
% 2.95/3.12 (step t32 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule implies_neg2)
% 2.95/3.12 (step t33 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule resolution :premises (t31 t32))
% 2.95/3.12 (step t34 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule contraction :premises (t33))
% 2.95/3.12 (step t35 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule implies :premises (t34))
% 2.95/3.12 (step t36 (cl (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule resolution :premises (t35 a18))
% 2.95/3.12 (step t37 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t38)
% 2.95/3.12 (assume t38.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 2.95/3.12 (step t38.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.95/3.12 (step t38.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule or :premises (t38.t1))
% 2.95/3.12 (step t38.t3 (cl (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule resolution :premises (t38.t2 t38.a0))
% 2.95/3.12 (step t38 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule subproof :discharge (t38.a0))
% 2.95/3.12 (step t39 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule resolution :premises (t37 t38))
% 2.95/3.12 (step t40 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule implies_neg2)
% 2.95/3.12 (step t41 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule resolution :premises (t39 t40))
% 2.95/3.12 (step t42 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule contraction :premises (t41))
% 2.95/3.12 (step t43 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule implies :premises (t42))
% 2.95/3.12 (step t44 (cl (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule resolution :premises (t43 a17))
% 2.95/3.12 (step t45 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule and_neg)
% 2.95/3.12 (step t46 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t47)
% 2.95/3.12 (assume t47.a0 (tptp.ssList tptp.sk1))
% 2.95/3.12 (assume t47.a1 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))
% 2.95/3.12 (step t47.t1 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t47.t2)
% 2.95/3.12 (assume t47.t2.a0 (tptp.ssList tptp.sk1))
% 2.95/3.12 (assume t47.t2.a1 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))
% 2.95/3.12 (step t47.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) true) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule equiv_simplify)
% 2.95/3.12 (step t47.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) true)) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule equiv1 :premises (t47.t2.t1))
% 2.95/3.12 (step t47.t2.t3 (cl (= (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))) tptp.sk1)) :rule symm :premises (t47.t2.a1))
% 2.95/3.12 (step t47.t2.t4 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (tptp.ssList tptp.sk1))) :rule cong :premises (t47.t2.t3))
% 2.95/3.12 (step t47.t2.t5 (cl (= (= (tptp.ssList tptp.sk1) true) (tptp.ssList tptp.sk1))) :rule equiv_simplify)
% 2.95/3.12 (step t47.t2.t6 (cl (= (tptp.ssList tptp.sk1) true) (not (tptp.ssList tptp.sk1))) :rule equiv2 :premises (t47.t2.t5))
% 2.95/3.12 (step t47.t2.t7 (cl (= (tptp.ssList tptp.sk1) true)) :rule resolution :premises (t47.t2.t6 t47.t2.a0))
% 2.95/3.12 (step t47.t2.t8 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) true)) :rule trans :premises (t47.t2.t4 t47.t2.t7))
% 2.95/3.12 (step t47.t2.t9 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t47.t2.t2 t47.t2.t8))
% 2.95/3.12 (step t47.t2 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule subproof :discharge (t47.t2.a0 t47.t2.a1))
% 2.95/3.12 (step t47.t3 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList tptp.sk1)) :rule and_pos)
% 2.95/3.12 (step t47.t4 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule and_pos)
% 2.95/3.12 (step t47.t5 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t47.t2 t47.t3 t47.t4))
% 2.95/3.12 (step t47.t6 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule reordering :premises (t47.t5))
% 2.95/3.12 (step t47.t7 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule contraction :premises (t47.t6))
% 2.95/3.12 (step t47.t8 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t47.t1 t47.t7))
% 2.95/3.12 (step t47.t9 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg2)
% 2.95/3.12 (step t47.t10 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t47.t8 t47.t9))
% 2.95/3.12 (step t47.t11 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule contraction :premises (t47.t10))
% 2.95/3.12 (step t47.t12 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule implies :premises (t47.t11))
% 2.95/3.12 (step t47.t13 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule and_neg)
% 2.95/3.12 (step t47.t14 (cl (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t47.t13 t47.a0 t47.a1))
% 2.95/3.12 (step t47.t15 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t47.t12 t47.t14))
% 2.95/3.12 (step t47 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule subproof :discharge (t47.a0 t47.a1))
% 2.95/3.12 (step t48 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList tptp.sk1)) :rule and_pos)
% 2.95/3.12 (step t49 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule and_pos)
% 2.95/3.12 (step t50 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t47 t48 t49))
% 2.95/3.12 (step t51 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule reordering :premises (t50))
% 2.95/3.12 (step t52 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule contraction :premises (t51))
% 2.95/3.12 (step t53 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t46 t52))
% 2.95/3.12 (step t54 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg2)
% 2.95/3.12 (step t55 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t53 t54))
% 2.95/3.12 (step t56 (cl (=> (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule contraction :premises (t55))
% 2.95/3.12 (step t57 (cl (not (and (tptp.ssList tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule implies :premises (t56))
% 2.95/3.12 (step t58 (cl (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t45 t57))
% 2.95/3.12 (step t59 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule or_pos)
% 2.95/3.12 (step t60 (cl (tptp.duplicatefreeP tptp.sk1) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule reordering :premises (t59))
% 2.95/3.12 (step t61 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t62)
% 2.95/3.12 (assume t62.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))))
% 2.95/3.12 (step t62.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.95/3.12 (step t62.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule or :premises (t62.t1))
% 2.95/3.12 (step t62.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t62.t2 t62.a0))
% 2.95/3.12 (step t62 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule subproof :discharge (t62.a0))
% 2.95/3.12 (step t63 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t61 t62))
% 2.95/3.12 (step t64 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule implies_neg2)
% 2.95/3.12 (step t65 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t63 t64))
% 2.95/3.12 (step t66 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule contraction :premises (t65))
% 2.95/3.12 (step t67 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies :premises (t66))
% 2.95/3.12 (step t68 (cl (not (= (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))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))))) (not (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)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) :rule equiv_pos2)
% 2.95/3.12 (anchor :step t69 :args ((U $$unsorted) (:= U U)))
% 2.95/3.12 (step t69.t1 (cl (= U U)) :rule refl)
% 2.95/3.12 (step t69.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.95/3.12 (step t69.t3 (cl (= (tptp.duplicatefreeP U) (tptp.duplicatefreeP U))) :rule refl)
% 2.95/3.12 (step t69.t4 (cl (= (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))) :rule all_simplify)
% 2.95/3.12 (step t69.t5 (cl (= (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)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) :rule cong :premises (t69.t2 t69.t3 t69.t4))
% 2.95/3.12 (step t69 (cl (= (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))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U)))))))) :rule bind)
% 2.95/3.12 (step t70 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= U (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))))))) :rule resolution :premises (t68 t69 a161))
% 2.95/3.12 (step t71 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.duplicatefreeP tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t67 t70))
% 2.95/3.12 (step t72 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t60 a197 a185 t71))
% 2.95/3.12 (step t73 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t58 a185 t72))
% 2.95/3.12 (step t74 (cl (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule and_neg)
% 2.95/3.12 (step t75 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t76)
% 2.95/3.12 (assume t76.a0 (= tptp.sk1 tptp.sk3))
% 2.95/3.12 (assume t76.a1 (tptp.strictorderedP tptp.sk3))
% 2.95/3.12 (assume t76.a2 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))
% 2.95/3.12 (step t76.t1 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg1)
% 2.95/3.12 (anchor :step t76.t2)
% 2.95/3.12 (assume t76.t2.a0 (tptp.strictorderedP tptp.sk3))
% 2.95/3.12 (assume t76.t2.a1 (= tptp.sk1 tptp.sk3))
% 2.95/3.12 (assume t76.t2.a2 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))
% 2.95/3.12 (step t76.t2.t1 (cl (= (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) true) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule equiv_simplify)
% 2.95/3.12 (step t76.t2.t2 (cl (not (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) true)) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule equiv1 :premises (t76.t2.t1))
% 2.95/3.12 (step t76.t2.t3 (cl (= (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))) tptp.sk1)) :rule symm :premises (t76.t2.a2))
% 2.95/3.12 (step t76.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t76.t2.a1))
% 2.95/3.12 (step t76.t2.t5 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t76.t2.t4))
% 2.95/3.12 (step t76.t2.t6 (cl (= (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))) tptp.sk3)) :rule trans :premises (t76.t2.t3 t76.t2.t5))
% 2.95/3.12 (step t76.t2.t7 (cl (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (tptp.strictorderedP tptp.sk3))) :rule cong :premises (t76.t2.t6))
% 2.95/3.12 (step t76.t2.t8 (cl (= (= (tptp.strictorderedP tptp.sk3) true) (tptp.strictorderedP tptp.sk3))) :rule equiv_simplify)
% 2.95/3.12 (step t76.t2.t9 (cl (= (tptp.strictorderedP tptp.sk3) true) (not (tptp.strictorderedP tptp.sk3))) :rule equiv2 :premises (t76.t2.t8))
% 2.95/3.12 (step t76.t2.t10 (cl (= (tptp.strictorderedP tptp.sk3) true)) :rule resolution :premises (t76.t2.t9 t76.t2.a0))
% 2.95/3.12 (step t76.t2.t11 (cl (= (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) true)) :rule trans :premises (t76.t2.t7 t76.t2.t10))
% 2.95/3.12 (step t76.t2.t12 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t76.t2.t2 t76.t2.t11))
% 2.95/3.12 (step t76.t2 (cl (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule subproof :discharge (t76.t2.a0 t76.t2.a1 t76.t2.a2))
% 2.95/3.12 (step t76.t3 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP tptp.sk3)) :rule and_pos)
% 2.95/3.12 (step t76.t4 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.95/3.12 (step t76.t5 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule and_pos)
% 2.95/3.12 (step t76.t6 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t76.t2 t76.t3 t76.t4 t76.t5))
% 2.95/3.12 (step t76.t7 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule reordering :premises (t76.t6))
% 2.95/3.12 (step t76.t8 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule contraction :premises (t76.t7))
% 2.95/3.12 (step t76.t9 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t76.t1 t76.t8))
% 2.95/3.12 (step t76.t10 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg2)
% 2.95/3.12 (step t76.t11 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t76.t9 t76.t10))
% 2.95/3.12 (step t76.t12 (cl (=> (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule contraction :premises (t76.t11))
% 2.95/3.12 (step t76.t13 (cl (not (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule implies :premises (t76.t12))
% 2.95/3.12 (step t76.t14 (cl (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule and_neg)
% 2.95/3.12 (step t76.t15 (cl (and (tptp.strictorderedP tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t76.t14 t76.a1 t76.a0 t76.a2))
% 2.95/3.12 (step t76.t16 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t76.t13 t76.t15))
% 2.95/3.12 (step t76 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule subproof :discharge (t76.a0 t76.a1 t76.a2))
% 2.95/3.12 (step t77 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.95/3.12 (step t78 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP tptp.sk3)) :rule and_pos)
% 2.95/3.12 (step t79 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule and_pos)
% 2.95/3.12 (step t80 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t76 t77 t78 t79))
% 2.95/3.12 (step t81 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule reordering :premises (t80))
% 2.95/3.12 (step t82 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule contraction :premises (t81))
% 2.95/3.12 (step t83 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t75 t82))
% 2.95/3.12 (step t84 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg2)
% 2.95/3.12 (step t85 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t83 t84))
% 2.95/3.12 (step t86 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule contraction :premises (t85))
% 2.95/3.12 (step t87 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.strictorderedP tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule implies :premises (t86))
% 2.95/3.12 (step t88 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.strictorderedP tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t74 t87))
% 2.95/3.12 (step t89 (cl (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t88 a190 a194 t72))
% 2.95/3.12 (step t90 (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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 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)
% 2.95/3.12 (anchor :step t91)
% 2.95/3.12 (assume t91.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))))
% 2.95/3.12 (step t91.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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))))) :rule forall_inst :args ((:= U (tptp.skaf75 tptp.sk1)) (:= V (tptp.skaf74 tptp.sk1)) (:= W (tptp.skaf76 tptp.sk1)) (:= X (tptp.skaf74 tptp.sk1)) (:= Y (tptp.skaf77 tptp.sk1))))
% 2.95/3.12 (step t91.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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) :rule or :premises (t91.t1))
% 2.95/3.12 (step t91.t3 (cl (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) :rule resolution :premises (t91.t2 t91.a0))
% 2.95/3.12 (step t91 (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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) :rule subproof :discharge (t91.a0))
% 2.95/3.12 (step t92 (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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) :rule resolution :premises (t90 t91))
% 2.95/3.12 (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))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) (not (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))))) :rule implies_neg2)
% 2.95/3.12 (step t94 (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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))))) :rule resolution :premises (t92 t93))
% 2.95/3.12 (step t95 (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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))))) :rule contraction :premises (t94))
% 2.95/3.12 (step t96 (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.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) :rule implies :premises (t95))
% 2.95/3.12 (step t97 (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)
% 2.95/3.12 (anchor :step t98 :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)))
% 2.95/3.12 (step t98.t1 (cl (= U U)) :rule refl)
% 2.95/3.12 (step t98.t2 (cl (= V V)) :rule refl)
% 2.95/3.12 (step t98.t3 (cl (= W W)) :rule refl)
% 2.95/3.12 (step t98.t4 (cl (= X X)) :rule refl)
% 2.95/3.12 (step t98.t5 (cl (= Y Y)) :rule refl)
% 2.95/3.12 (step t98.t6 (cl (= Z Z)) :rule refl)
% 2.95/3.12 (step t98.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)
% 2.95/3.12 (step t98.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 (t98.t7))
% 2.95/3.12 (step t98.t9 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 2.95/3.12 (step t98.t10 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.95/3.12 (step t98.t11 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.95/3.12 (step t98.t12 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 2.95/3.12 (step t98.t13 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 2.95/3.12 (step t98.t14 (cl (= (not (tptp.strictorderedP Z)) (not (tptp.strictorderedP Z)))) :rule refl)
% 2.95/3.12 (step t98.t15 (cl (= (not (tptp.ssList Z)) (not (tptp.ssList Z)))) :rule refl)
% 2.95/3.12 (step t98.t16 (cl (= (tptp.lt V X) (tptp.lt V X))) :rule refl)
% 2.95/3.12 (step t98.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 (t98.t8 t98.t9 t98.t10 t98.t11 t98.t12 t98.t13 t98.t14 t98.t15 t98.t16))
% 2.95/3.12 (step t98 (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)
% 2.95/3.12 (step t99 (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)
% 2.95/3.12 (anchor :step t100 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 2.95/3.12 (step t100.t1 (cl (= U U)) :rule refl)
% 2.95/3.12 (step t100.t2 (cl (= V V)) :rule refl)
% 2.95/3.12 (step t100.t3 (cl (= W W)) :rule refl)
% 2.95/3.12 (step t100.t4 (cl (= X X)) :rule refl)
% 2.95/3.12 (step t100.t5 (cl (= Y Y)) :rule refl)
% 2.95/3.12 (step t100.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)
% 2.95/3.12 (step t100.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 (t100.t6))
% 2.95/3.12 (step t100.t8 (cl (= (not true) false)) :rule all_simplify)
% 2.95/3.12 (step t100.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 (t100.t7 t100.t8))
% 2.95/3.12 (step t100.t10 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 2.95/3.12 (step t100.t11 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.95/3.12 (step t100.t12 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.95/3.12 (step t100.t13 (cl (= (not (tptp.ssItem X)) (not (tptp.ssItem X)))) :rule refl)
% 2.95/3.12 (step t100.t14 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 2.95/3.12 (step t100.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)
% 2.95/3.12 (step t100.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)
% 2.95/3.12 (step t100.t17 (cl (= (tptp.lt V X) (tptp.lt V X))) :rule refl)
% 2.95/3.12 (step t100.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 (t100.t9 t100.t10 t100.t11 t100.t12 t100.t13 t100.t14 t100.t15 t100.t16 t100.t17))
% 2.95/3.12 (step t100.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)
% 2.95/3.12 (step t100.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 (t100.t18 t100.t19))
% 2.95/3.12 (step t100 (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)
% 2.95/3.12 (step t101 (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 (t99 t100))
% 2.95/3.12 (step t102 (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 (t98 t101))
% 2.95/3.12 (step t103 (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 (t97 t102 a180))
% 2.95/3.12 (step t104 (cl (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.strictorderedP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1)))) :rule resolution :premises (t96 t103))
% 2.95/3.12 (step t105 (cl (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) :rule resolution :premises (t20 t28 t17 t36 t44 t73 t89 t104))
% 2.95/3.12 (step t106 (cl (not (or (not (tptp.lt (tptp.skaf74 tptp.sk1) (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))))) :rule resolution :premises (t9 t17 t105))
% 2.95/3.12 (step t107 (cl) :rule resolution :premises (t7 t106 a62))
% 2.95/3.12
% 2.95/3.14 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.qTI4p2LuXn/cvc5---1.0.5_30398.smt2
% 2.95/3.15 % cvc5---1.0.5 exiting
% 2.95/3.15 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------