TSTP Solution File: SWC404-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC404-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:01:58 EDT 2024
% Result : Unsatisfiable 0.91s 1.08s
% Output : Proof 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : SWC404-1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/0.15 % Command : do_cvc5 %s %d
% 0.16/0.36 % Computer : n023.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.37 % DateTime : Sun May 26 15:24:09 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.39/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.39/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.91/1.08 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.v2us64a1GK/cvc5---1.0.5_13055.smt2
% 0.91/1.08 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.v2us64a1GK/cvc5---1.0.5_13055.smt2
% 0.91/1.09 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.91/1.09 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.91/1.09 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.91/1.09 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.91/1.09 (assume a4 (tptp.strictorderP tptp.nil))
% 0.91/1.09 (assume a5 (tptp.totalorderP tptp.nil))
% 0.91/1.09 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.91/1.09 (assume a7 (tptp.ssList tptp.nil))
% 0.91/1.09 (assume a8 (tptp.ssItem tptp.skac3))
% 0.91/1.09 (assume a9 (tptp.ssItem tptp.skac2))
% 0.91/1.09 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.91/1.09 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.91/1.09 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.91/1.09 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.91/1.09 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.91/1.09 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.91/1.09 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.91/1.09 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.91/1.09 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.91/1.09 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.91/1.09 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.91/1.09 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.91/1.09 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.91/1.09 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.91/1.09 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.91/1.09 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.91/1.09 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.91/1.09 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.91/1.09 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.91/1.09 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.91/1.09 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.91/1.09 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.91/1.09 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.91/1.09 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.91/1.09 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.91/1.09 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.91/1.09 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.91/1.09 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.91/1.09 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.91/1.09 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.91/1.09 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.91/1.09 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.91/1.09 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.91/1.09 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.91/1.09 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.91/1.09 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.91/1.09 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.91/1.09 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.91/1.09 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.91/1.09 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.91/1.09 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.91/1.09 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.91/1.09 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.91/1.09 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.91/1.09 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.91/1.09 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.91/1.09 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.91/1.09 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.91/1.09 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.91/1.09 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.91/1.09 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.91/1.09 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.91/1.09 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.91/1.09 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.91/1.09 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.91/1.09 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.91/1.09 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.91/1.09 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.91/1.09 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.91/1.09 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.91/1.09 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.91/1.09 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.91/1.09 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.91/1.09 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.91/1.09 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.91/1.09 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.91/1.09 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.91/1.09 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.91/1.09 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.91/1.09 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.91/1.09 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.91/1.09 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.91/1.09 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.91/1.09 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.91/1.09 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.91/1.09 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.91/1.09 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.91/1.09 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.91/1.09 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.91/1.09 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.91/1.09 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.91/1.09 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.91/1.09 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.91/1.09 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.91/1.09 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.91/1.09 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.91/1.09 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.91/1.09 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.91/1.09 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.91/1.09 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.91/1.09 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.91/1.09 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.91/1.09 (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))))
% 0.91/1.09 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 0.91/1.09 (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))))
% 0.91/1.09 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (assume a185 (tptp.ssList tptp.sk1))
% 0.91/1.09 (assume a186 (tptp.ssList tptp.sk2))
% 0.91/1.09 (assume a187 (tptp.ssList tptp.sk3))
% 0.91/1.09 (assume a188 (tptp.ssList tptp.sk4))
% 0.91/1.09 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.91/1.09 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.91/1.09 (assume a191 (tptp.ssList tptp.sk5))
% 0.91/1.09 (assume a192 (tptp.ssList tptp.sk6))
% 0.91/1.09 (assume a193 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4))
% 0.91/1.09 (assume a194 (tptp.strictorderedP tptp.sk3))
% 0.91/1.09 (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)))))
% 0.91/1.09 (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)))))
% 0.91/1.09 (assume a197 (tptp.ssItem tptp.sk7))
% 0.91/1.09 (assume a198 (tptp.memberP tptp.sk1 tptp.sk7))
% 0.91/1.09 (assume a199 (not (tptp.memberP tptp.sk2 tptp.sk7)))
% 0.91/1.09 (assume a200 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 0.91/1.09 (step t1 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (tptp.memberP tptp.sk3 tptp.sk7)))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7))))) (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (tptp.memberP tptp.sk3 tptp.sk7))) :rule equiv_pos2)
% 0.91/1.09 (step t2 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.91/1.09 (step t3 (cl (= (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.memberP tptp.sk1 tptp.sk7)))) :rule refl)
% 0.91/1.09 (step t4 (cl (= (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))))) :rule refl)
% 0.91/1.09 (step t5 (cl (= (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7)) true) (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7)))) :rule equiv_simplify)
% 0.91/1.09 (step t6 (cl (not (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7)) true)) (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7))) :rule equiv1 :premises (t5))
% 0.91/1.09 (step t7 (cl (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7)) (= (tptp.memberP tptp.sk3 tptp.sk7) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))))) :rule all_simplify)
% 0.91/1.09 (step t8 (cl (= (tptp.memberP tptp.sk3 tptp.sk7) (tptp.memberP tptp.sk3 tptp.sk7))) :rule refl)
% 0.91/1.09 (step t9 (cl (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7))) :rule all_simplify)
% 0.91/1.09 (step t10 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk7) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (= (tptp.memberP tptp.sk3 tptp.sk7) (tptp.memberP tptp.sk3 tptp.sk7)))) :rule cong :premises (t8 t9))
% 0.91/1.09 (step t11 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk7) (tptp.memberP tptp.sk3 tptp.sk7)) true)) :rule all_simplify)
% 0.91/1.09 (step t12 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk7) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) true)) :rule trans :premises (t10 t11))
% 0.91/1.09 (step t13 (cl (= (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7)) true)) :rule trans :premises (t7 t12))
% 0.91/1.09 (step t14 (cl (= (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (tptp.memberP tptp.sk3 tptp.sk7))) :rule resolution :premises (t6 t13))
% 0.91/1.09 (step t15 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (tptp.memberP tptp.sk3 tptp.sk7)))) :rule cong :premises (t2 t3 t4 t14))
% 0.91/1.09 (step t16 (cl (not (= (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))))) (not (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))))) :rule equiv_pos2)
% 0.91/1.09 (step t17 (cl (= (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))))) :rule refl)
% 0.91/1.09 (step t18 (cl (= (= (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))))) :rule equiv_simplify)
% 0.91/1.09 (step t19 (cl (= (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) (not (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))))) :rule equiv2 :premises (t18))
% 0.91/1.09 (step t20 (cl (not (not (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule not_not)
% 0.91/1.09 (step t21 (cl (= (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule resolution :premises (t19 t20))
% 0.91/1.09 (step t22 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t23)
% 0.91/1.09 (assume t23.a0 (not (tptp.memberP tptp.sk3 tptp.sk7)))
% 0.91/1.09 (assume t23.a1 (= tptp.sk1 tptp.sk3))
% 0.91/1.09 (assume t23.a2 (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))
% 0.91/1.09 (assume t23.a3 (tptp.memberP tptp.sk1 tptp.sk7))
% 0.91/1.09 (step t23.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 0.91/1.09 (step t23.t2 (cl (= (= true false) false)) :rule all_simplify)
% 0.91/1.09 (step t23.t3 (cl (= (= (tptp.memberP tptp.sk1 tptp.sk7) true) (tptp.memberP tptp.sk1 tptp.sk7))) :rule equiv_simplify)
% 0.91/1.09 (step t23.t4 (cl (= (tptp.memberP tptp.sk1 tptp.sk7) true) (not (tptp.memberP tptp.sk1 tptp.sk7))) :rule equiv2 :premises (t23.t3))
% 0.91/1.09 (step t23.t5 (cl (= (tptp.memberP tptp.sk1 tptp.sk7) true)) :rule resolution :premises (t23.t4 t23.a3))
% 0.91/1.09 (step t23.t6 (cl (= true (tptp.memberP tptp.sk1 tptp.sk7))) :rule symm :premises (t23.t5))
% 0.91/1.09 (step t23.t7 (cl (= tptp.sk7 tptp.sk7)) :rule refl)
% 0.91/1.09 (step t23.t8 (cl (= (tptp.memberP tptp.sk1 tptp.sk7) (tptp.memberP (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))) tptp.sk7))) :rule cong :premises (t23.a2 t23.t7))
% 0.91/1.09 (step t23.t9 (cl (= (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))) tptp.sk1)) :rule symm :premises (t23.a2))
% 0.91/1.09 (step t23.t10 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t23.a1))
% 0.91/1.09 (step t23.t11 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t23.t10))
% 0.91/1.09 (step t23.t12 (cl (= (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))) tptp.sk3)) :rule trans :premises (t23.t9 t23.t11))
% 0.91/1.09 (step t23.t13 (cl (= (tptp.memberP (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))) tptp.sk7) (tptp.memberP tptp.sk3 tptp.sk7))) :rule cong :premises (t23.t12 t23.t7))
% 0.91/1.09 (step t23.t14 (cl (= (= (tptp.memberP tptp.sk3 tptp.sk7) false) (not (tptp.memberP tptp.sk3 tptp.sk7)))) :rule equiv_simplify)
% 0.91/1.09 (step t23.t15 (cl (= (tptp.memberP tptp.sk3 tptp.sk7) false) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) :rule equiv2 :premises (t23.t14))
% 0.91/1.09 (step t23.t16 (cl (not (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (tptp.memberP tptp.sk3 tptp.sk7)) :rule not_not)
% 0.91/1.09 (step t23.t17 (cl (= (tptp.memberP tptp.sk3 tptp.sk7) false) (tptp.memberP tptp.sk3 tptp.sk7)) :rule resolution :premises (t23.t15 t23.t16))
% 0.91/1.09 (step t23.t18 (cl (= (tptp.memberP tptp.sk3 tptp.sk7) false)) :rule resolution :premises (t23.t17 t23.a0))
% 0.91/1.09 (step t23.t19 (cl (= true false)) :rule trans :premises (t23.t6 t23.t8 t23.t13 t23.t18))
% 0.91/1.09 (step t23.t20 (cl false) :rule resolution :premises (t23.t1 t23.t2 t23.t19))
% 0.91/1.09 (step t23 (cl (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (tptp.memberP tptp.sk1 tptp.sk7)) false) :rule subproof :discharge (t23.a0 t23.a1 t23.a2 t23.a3))
% 0.91/1.09 (step t24 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (tptp.memberP tptp.sk3 tptp.sk7))) :rule and_pos)
% 0.91/1.09 (step t25 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.91/1.09 (step t26 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) :rule and_pos)
% 0.91/1.09 (step t27 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (tptp.memberP tptp.sk1 tptp.sk7)) :rule and_pos)
% 0.91/1.09 (step t28 (cl false (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)))) :rule resolution :premises (t23 t24 t25 t26 t27))
% 0.91/1.09 (step t29 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) false) :rule reordering :premises (t28))
% 0.91/1.09 (step t30 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) false) :rule contraction :premises (t29))
% 0.91/1.09 (step t31 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) false) :rule resolution :premises (t22 t30))
% 0.91/1.09 (step t32 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) (not false)) :rule implies_neg2)
% 0.91/1.09 (step t33 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false)) :rule resolution :premises (t31 t32))
% 0.91/1.09 (step t34 (cl (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false)) :rule contraction :premises (t33))
% 0.91/1.09 (step t35 (cl (= (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))))) :rule implies_simplify)
% 0.91/1.09 (step t36 (cl (not (=> (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false)) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)))) :rule equiv1 :premises (t35))
% 0.91/1.09 (step t37 (cl (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)))) :rule resolution :premises (t34 t36))
% 0.91/1.09 (step t38 (cl (= (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) false)) :rule resolution :premises (t21 t37))
% 0.91/1.09 (step t39 (cl (= (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) false))) :rule cong :premises (t17 t38))
% 0.91/1.09 (step t40 (cl (= (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) false) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))))) :rule all_simplify)
% 0.91/1.09 (step t41 (cl (= (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))))) :rule trans :premises (t39 t40))
% 0.91/1.09 (step t42 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t43)
% 0.91/1.09 (assume t43.a0 (= tptp.sk1 tptp.sk3))
% 0.91/1.09 (assume t43.a1 (tptp.memberP tptp.sk1 tptp.sk7))
% 0.91/1.09 (assume t43.a2 (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))
% 0.91/1.09 (assume t43.a3 (not (tptp.memberP tptp.sk3 tptp.sk7)))
% 0.91/1.09 (step t43.t1 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (tptp.memberP tptp.sk1 tptp.sk7))) :rule and_neg)
% 0.91/1.09 (step t43.t2 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule resolution :premises (t43.t1 t43.a3 t43.a0 t43.a2 t43.a1))
% 0.91/1.09 (step t43 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule subproof :discharge (t43.a0 t43.a1 t43.a2 t43.a3))
% 0.91/1.09 (step t44 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.91/1.09 (step t45 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (tptp.memberP tptp.sk1 tptp.sk7)) :rule and_pos)
% 0.91/1.09 (step t46 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) :rule and_pos)
% 0.91/1.09 (step t47 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) :rule and_pos)
% 0.91/1.09 (step t48 (cl (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))))) :rule resolution :premises (t43 t44 t45 t46 t47))
% 0.91/1.09 (step t49 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule reordering :premises (t48))
% 0.91/1.09 (step t50 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7)))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule contraction :premises (t49))
% 0.91/1.09 (step t51 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) :rule resolution :premises (t42 t50))
% 0.91/1.09 (step t52 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (not (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)))) :rule implies_neg2)
% 0.91/1.09 (step t53 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7))) (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)))) :rule resolution :premises (t51 t52))
% 0.91/1.09 (step t54 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))) (and (not (tptp.memberP tptp.sk3 tptp.sk7)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (tptp.memberP tptp.sk1 tptp.sk7)))) :rule contraction :premises (t53))
% 0.91/1.09 (step t55 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.memberP tptp.sk1 tptp.sk7) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (tptp.memberP tptp.sk3 tptp.sk7))))) :rule resolution :premises (t16 t41 t54))
% 0.91/1.09 (step t56 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) :rule not_and :premises (t55))
% 0.91/1.09 (step t57 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.91/1.09 (step t58 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (not (tptp.memberP tptp.sk1 tptp.sk7)))) :rule or_neg)
% 0.91/1.09 (step t59 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))))) :rule or_neg)
% 0.91/1.09 (step t60 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (not (not (not (tptp.memberP tptp.sk3 tptp.sk7))))) :rule or_neg)
% 0.91/1.09 (step t61 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7)))) (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7))))) :rule resolution :premises (t56 t57 t58 t59 t60))
% 0.91/1.09 (step t62 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (not (not (tptp.memberP tptp.sk3 tptp.sk7))))) :rule contraction :premises (t61))
% 0.91/1.09 (step t63 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (tptp.memberP tptp.sk3 tptp.sk7))) :rule resolution :premises (t1 t15 t62))
% 0.91/1.09 (step t64 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) (tptp.memberP tptp.sk3 tptp.sk7)) :rule or :premises (t63))
% 0.91/1.09 (step t65 (cl (not (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) :rule or_pos)
% 0.91/1.09 (step t66 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7) (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)))) :rule reordering :premises (t65))
% 0.91/1.09 (step t67 (cl (not (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)) :rule or_pos)
% 0.91/1.09 (step t68 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7) (not (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule reordering :premises (t67))
% 0.91/1.09 (step t69 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) :rule or_pos)
% 0.91/1.09 (step t70 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule reordering :premises (t69))
% 0.91/1.09 (step t71 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t72)
% 0.91/1.09 (assume t72.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.91/1.09 (step t72.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk5)))
% 0.91/1.09 (step t72.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule or :premises (t72.t1))
% 0.91/1.09 (step t72.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t72.t2 t72.a0))
% 0.91/1.09 (step t72 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule subproof :discharge (t72.a0))
% 0.91/1.09 (step t73 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t71 t72))
% 0.91/1.09 (step t74 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule implies_neg2)
% 0.91/1.09 (step t75 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule resolution :premises (t73 t74))
% 0.91/1.09 (step t76 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))))) :rule contraction :premises (t75))
% 0.91/1.09 (step t77 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule implies :premises (t76))
% 0.91/1.09 (step t78 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (tptp.ssList (tptp.app tptp.sk5 tptp.sk3)))) :rule resolution :premises (t77 a84))
% 0.91/1.09 (step t79 (cl (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) :rule resolution :premises (t70 a187 a191 t78))
% 0.91/1.09 (step t80 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk2 tptp.sk7) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk2 tptp.sk7) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule equiv_pos2)
% 0.91/1.09 (step t81 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 0.91/1.09 (step t82 (cl (= (= (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7)) true) (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7)))) :rule equiv_simplify)
% 0.91/1.09 (step t83 (cl (not (= (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7)) true)) (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7))) :rule equiv1 :premises (t82))
% 0.91/1.09 (step t84 (cl (= (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7)) (= (tptp.memberP tptp.sk2 tptp.sk7) (not (not (tptp.memberP tptp.sk2 tptp.sk7)))))) :rule all_simplify)
% 0.91/1.09 (step t85 (cl (= (tptp.memberP tptp.sk2 tptp.sk7) (tptp.memberP tptp.sk2 tptp.sk7))) :rule refl)
% 0.91/1.09 (step t86 (cl (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7))) :rule all_simplify)
% 0.91/1.09 (step t87 (cl (= (= (tptp.memberP tptp.sk2 tptp.sk7) (not (not (tptp.memberP tptp.sk2 tptp.sk7)))) (= (tptp.memberP tptp.sk2 tptp.sk7) (tptp.memberP tptp.sk2 tptp.sk7)))) :rule cong :premises (t85 t86))
% 0.91/1.09 (step t88 (cl (= (= (tptp.memberP tptp.sk2 tptp.sk7) (tptp.memberP tptp.sk2 tptp.sk7)) true)) :rule all_simplify)
% 0.91/1.09 (step t89 (cl (= (= (tptp.memberP tptp.sk2 tptp.sk7) (not (not (tptp.memberP tptp.sk2 tptp.sk7)))) true)) :rule trans :premises (t87 t88))
% 0.91/1.09 (step t90 (cl (= (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7)) true)) :rule trans :premises (t84 t89))
% 0.91/1.09 (step t91 (cl (= (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (tptp.memberP tptp.sk2 tptp.sk7))) :rule resolution :premises (t83 t90))
% 0.91/1.09 (step t92 (cl (= (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule refl)
% 0.91/1.09 (step t93 (cl (= (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule refl)
% 0.91/1.09 (step t94 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk2 tptp.sk7) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))))) :rule cong :premises (t81 t91 t92 t93))
% 0.91/1.09 (step t95 (cl (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule and_neg)
% 0.91/1.09 (step t96 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t97)
% 0.91/1.09 (assume t97.a0 (= tptp.sk2 tptp.sk4))
% 0.91/1.09 (assume t97.a1 (not (tptp.memberP tptp.sk2 tptp.sk7)))
% 0.91/1.09 (assume t97.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 0.91/1.09 (step t97.t1 (cl (=> (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t97.t2)
% 0.91/1.09 (assume t97.t2.a0 (not (tptp.memberP tptp.sk2 tptp.sk7)))
% 0.91/1.09 (assume t97.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.91/1.09 (assume t97.t2.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 0.91/1.09 (step t97.t2.t1 (cl (= (= (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7) false) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule equiv_simplify)
% 0.91/1.09 (step t97.t2.t2 (cl (not (= (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7) false)) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule equiv1 :premises (t97.t2.t1))
% 0.91/1.09 (step t97.t2.t3 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4)) :rule symm :premises (t97.t2.a2))
% 0.91/1.09 (step t97.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t97.t2.a1))
% 0.91/1.09 (step t97.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk2)) :rule trans :premises (t97.t2.t3 t97.t2.t4))
% 0.91/1.09 (step t97.t2.t6 (cl (= tptp.sk7 tptp.sk7)) :rule refl)
% 0.91/1.09 (step t97.t2.t7 (cl (= (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7) (tptp.memberP tptp.sk2 tptp.sk7))) :rule cong :premises (t97.t2.t5 t97.t2.t6))
% 0.91/1.09 (step t97.t2.t8 (cl (= (= (tptp.memberP tptp.sk2 tptp.sk7) false) (not (tptp.memberP tptp.sk2 tptp.sk7)))) :rule equiv_simplify)
% 0.91/1.09 (step t97.t2.t9 (cl (= (tptp.memberP tptp.sk2 tptp.sk7) false) (not (not (tptp.memberP tptp.sk2 tptp.sk7)))) :rule equiv2 :premises (t97.t2.t8))
% 0.91/1.09 (step t97.t2.t10 (cl (not (not (not (tptp.memberP tptp.sk2 tptp.sk7)))) (tptp.memberP tptp.sk2 tptp.sk7)) :rule not_not)
% 0.91/1.09 (step t97.t2.t11 (cl (= (tptp.memberP tptp.sk2 tptp.sk7) false) (tptp.memberP tptp.sk2 tptp.sk7)) :rule resolution :premises (t97.t2.t9 t97.t2.t10))
% 0.91/1.09 (step t97.t2.t12 (cl (= (tptp.memberP tptp.sk2 tptp.sk7) false)) :rule resolution :premises (t97.t2.t11 t97.t2.a0))
% 0.91/1.09 (step t97.t2.t13 (cl (= (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7) false)) :rule trans :premises (t97.t2.t7 t97.t2.t12))
% 0.91/1.09 (step t97.t2.t14 (cl (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t97.t2.t2 t97.t2.t13))
% 0.91/1.09 (step t97.t2 (cl (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule subproof :discharge (t97.t2.a0 t97.t2.a1 t97.t2.a2))
% 0.91/1.09 (step t97.t3 (cl (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP tptp.sk2 tptp.sk7))) :rule and_pos)
% 0.91/1.09 (step t97.t4 (cl (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.91/1.09 (step t97.t5 (cl (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 0.91/1.09 (step t97.t6 (cl (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)) (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule resolution :premises (t97.t2 t97.t3 t97.t4 t97.t5))
% 0.91/1.09 (step t97.t7 (cl (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule reordering :premises (t97.t6))
% 0.91/1.09 (step t97.t8 (cl (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule contraction :premises (t97.t7))
% 0.91/1.09 (step t97.t9 (cl (=> (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t97.t1 t97.t8))
% 0.91/1.09 (step t97.t10 (cl (=> (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule implies_neg2)
% 0.91/1.09 (step t97.t11 (cl (=> (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (=> (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule resolution :premises (t97.t9 t97.t10))
% 0.91/1.09 (step t97.t12 (cl (=> (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule contraction :premises (t97.t11))
% 0.91/1.09 (step t97.t13 (cl (not (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule implies :premises (t97.t12))
% 0.91/1.09 (step t97.t14 (cl (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule and_neg)
% 0.91/1.09 (step t97.t15 (cl (and (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t97.t14 t97.a1 t97.a0 t97.a2))
% 0.91/1.09 (step t97.t16 (cl (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t97.t13 t97.t15))
% 0.91/1.09 (step t97 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule subproof :discharge (t97.a0 t97.a1 t97.a2))
% 0.91/1.09 (step t98 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.91/1.09 (step t99 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP tptp.sk2 tptp.sk7))) :rule and_pos)
% 0.91/1.09 (step t100 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 0.91/1.09 (step t101 (cl (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule resolution :premises (t97 t98 t99 t100))
% 0.91/1.09 (step t102 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule reordering :premises (t101))
% 0.91/1.09 (step t103 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule contraction :premises (t102))
% 0.91/1.09 (step t104 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t96 t103))
% 0.91/1.09 (step t105 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule implies_neg2)
% 0.91/1.09 (step t106 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule resolution :premises (t104 t105))
% 0.91/1.09 (step t107 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule contraction :premises (t106))
% 0.91/1.09 (step t108 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.memberP tptp.sk2 tptp.sk7)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule implies :premises (t107))
% 0.91/1.09 (step t109 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t95 t108))
% 0.91/1.09 (step t110 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.91/1.09 (step t111 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (not (not (tptp.memberP tptp.sk2 tptp.sk7))))) :rule or_neg)
% 0.91/1.09 (step t112 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule or_neg)
% 0.91/1.09 (step t113 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule or_neg)
% 0.91/1.09 (step t114 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule resolution :premises (t109 t110 t111 t112 t113))
% 0.91/1.09 (step t115 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.memberP tptp.sk2 tptp.sk7))) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule contraction :premises (t114))
% 0.91/1.09 (step t116 (cl (or (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk2 tptp.sk7) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule resolution :premises (t80 t94 t115))
% 0.91/1.09 (step t117 (cl (not (= tptp.sk2 tptp.sk4)) (tptp.memberP tptp.sk2 tptp.sk7) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule or :premises (t116))
% 0.91/1.09 (step t118 (cl (tptp.memberP tptp.sk2 tptp.sk7) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule reordering :premises (t117))
% 0.91/1.09 (step t119 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (a193))
% 0.91/1.09 (step t120 (cl (not (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t118 a199 a189 t119))
% 0.91/1.09 (step t121 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (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)))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t122)
% 0.91/1.09 (assume t122.a0 (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))))
% 0.91/1.09 (step t122.t1 (cl (or (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule forall_inst :args ((:= U (tptp.app tptp.sk5 tptp.sk3)) (:= V tptp.sk7) (:= W tptp.sk6)))
% 0.91/1.09 (step t122.t2 (cl (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule or :premises (t122.t1))
% 0.91/1.09 (step t122.t3 (cl (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t122.t2 t122.a0))
% 0.91/1.09 (step t122 (cl (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule subproof :discharge (t122.a0))
% 0.91/1.09 (step t123 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t121 t122))
% 0.91/1.09 (step t124 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (not (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule implies_neg2)
% 0.91/1.09 (step t125 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule resolution :premises (t123 t124))
% 0.91/1.09 (step t126 (cl (=> (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))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7)))) :rule contraction :premises (t125))
% 0.91/1.09 (step t127 (cl (not (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)))) (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule implies :premises (t126))
% 0.91/1.09 (step t128 (cl (or (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app tptp.sk5 tptp.sk3))) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk7))) :rule resolution :premises (t127 a139))
% 0.91/1.09 (step t129 (cl (not (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) :rule resolution :premises (t68 a192 a197 t79 t120 t128))
% 0.91/1.09 (step t130 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) (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)))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t131)
% 0.91/1.09 (assume t131.a0 (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))))
% 0.91/1.09 (step t131.t1 (cl (or (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk7) (:= W tptp.sk5)))
% 0.91/1.09 (step t131.t2 (cl (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) :rule or :premises (t131.t1))
% 0.91/1.09 (step t131.t3 (cl (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) :rule resolution :premises (t131.t2 t131.a0))
% 0.91/1.09 (step t131 (cl (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) :rule subproof :discharge (t131.a0))
% 0.91/1.09 (step t132 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) :rule resolution :premises (t130 t131))
% 0.91/1.09 (step t133 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) (not (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)))) :rule implies_neg2)
% 0.91/1.09 (step t134 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)))) :rule resolution :premises (t132 t133))
% 0.91/1.09 (step t135 (cl (=> (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))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7)))) :rule contraction :premises (t134))
% 0.91/1.09 (step t136 (cl (not (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)))) (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) :rule implies :premises (t135))
% 0.91/1.09 (step t137 (cl (or (not (tptp.memberP tptp.sk3 tptp.sk7)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssItem tptp.sk7)) (tptp.memberP (tptp.app tptp.sk5 tptp.sk3) tptp.sk7))) :rule resolution :premises (t136 a140))
% 0.91/1.09 (step t138 (cl (not (tptp.memberP tptp.sk3 tptp.sk7))) :rule resolution :premises (t66 a187 a191 a197 t129 t137))
% 0.91/1.09 (step t139 (cl (not (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) :rule or_pos)
% 0.91/1.09 (step t140 (cl (not (tptp.ssList tptp.sk1)) (not (tptp.ssItem tptp.sk7)) (not (tptp.memberP tptp.sk1 tptp.sk7)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))) (not (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))))) :rule reordering :premises (t139))
% 0.91/1.09 (step t141 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule implies_neg1)
% 0.91/1.09 (anchor :step t142)
% 0.91/1.09 (assume t142.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))
% 0.91/1.09 (step t142.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))))) :rule forall_inst :args ((:= U tptp.sk1) (:= V tptp.sk7)))
% 0.91/1.09 (step t142.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) :rule or :premises (t142.t1))
% 0.91/1.09 (step t142.t3 (cl (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) :rule resolution :premises (t142.t2 t142.a0))
% 0.91/1.09 (step t142 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) :rule subproof :discharge (t142.a0))
% 0.91/1.09 (step t143 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) :rule resolution :premises (t141 t142))
% 0.91/1.09 (step t144 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) (not (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))))) :rule implies_neg2)
% 0.91/1.09 (step t145 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))))) :rule resolution :premises (t143 t144))
% 0.91/1.09 (step t146 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))))) :rule contraction :premises (t145))
% 0.91/1.09 (step t147 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) :rule implies :premises (t146))
% 0.91/1.09 (step t148 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule equiv_pos2)
% 0.91/1.09 (anchor :step t149 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.91/1.09 (step t149.t1 (cl (= U U)) :rule refl)
% 0.91/1.09 (step t149.t2 (cl (= V V)) :rule refl)
% 0.91/1.09 (step t149.t3 (cl (= (not (tptp.memberP U V)) (not (tptp.memberP U V)))) :rule refl)
% 0.91/1.09 (step t149.t4 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 0.91/1.09 (step t149.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.91/1.09 (step t149.t6 (cl (= (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) :rule all_simplify)
% 0.91/1.09 (step t149.t7 (cl (= (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)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule cong :premises (t149.t3 t149.t4 t149.t5 t149.t6))
% 0.91/1.09 (step t149 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))) :rule bind)
% 0.91/1.09 (step t150 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule resolution :premises (t148 t149 a168))
% 0.91/1.09 (step t151 (cl (or (not (tptp.memberP tptp.sk1 tptp.sk7)) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1)))))) :rule resolution :premises (t147 t150))
% 0.91/1.09 (step t152 (cl (= tptp.sk1 (tptp.app (tptp.skaf42 tptp.sk1 tptp.sk7) (tptp.cons tptp.sk7 (tptp.skaf43 tptp.sk7 tptp.sk1))))) :rule resolution :premises (t140 a185 a197 a198 t151))
% 0.91/1.09 (step t153 (cl) :rule resolution :premises (t64 t138 t152 a198 a190))
% 0.91/1.09
% 0.91/1.10 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.v2us64a1GK/cvc5---1.0.5_13055.smt2
% 0.91/1.10 % cvc5---1.0.5 exiting
% 0.91/1.10 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------