TSTP Solution File: SWC313-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC313-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n029.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:28 EDT 2024
% Result : Unsatisfiable 8.63s 8.78s
% Output : Proof 8.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWC313-1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/0.15 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 26 15:31:09 EDT 2024
% 0.20/0.36 % CPUTime :
% 0.22/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 8.63/8.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.OcEBtMc0QA/cvc5---1.0.5_12109.smt2
% 8.63/8.78 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.OcEBtMc0QA/cvc5---1.0.5_12109.smt2
% 8.63/8.80 (assume a0 (tptp.equalelemsP tptp.nil))
% 8.63/8.80 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 8.63/8.80 (assume a2 (tptp.strictorderedP tptp.nil))
% 8.63/8.80 (assume a3 (tptp.totalorderedP tptp.nil))
% 8.63/8.80 (assume a4 (tptp.strictorderP tptp.nil))
% 8.63/8.80 (assume a5 (tptp.totalorderP tptp.nil))
% 8.63/8.80 (assume a6 (tptp.cyclefreeP tptp.nil))
% 8.63/8.80 (assume a7 (tptp.ssList tptp.nil))
% 8.63/8.80 (assume a8 (tptp.ssItem tptp.skac3))
% 8.63/8.80 (assume a9 (tptp.ssItem tptp.skac2))
% 8.63/8.80 (assume a10 (not (tptp.singletonP tptp.nil)))
% 8.63/8.80 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 8.63/8.80 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 8.63/8.80 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 8.63/8.80 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 8.63/8.80 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 8.63/8.80 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 8.63/8.80 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 8.63/8.80 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 8.63/8.80 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 8.63/8.80 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 8.63/8.80 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 8.63/8.80 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 8.63/8.80 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 8.63/8.80 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 8.63/8.80 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 8.63/8.80 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 8.63/8.80 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 8.63/8.80 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 8.63/8.80 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 8.63/8.80 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 8.63/8.80 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 8.63/8.80 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 8.63/8.80 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 8.63/8.80 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 8.63/8.80 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 8.63/8.80 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 8.63/8.80 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 8.63/8.80 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 8.63/8.80 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 8.63/8.80 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 8.63/8.80 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 8.63/8.80 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 8.63/8.80 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 8.63/8.80 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 8.63/8.80 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 8.63/8.80 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 8.63/8.80 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 8.63/8.80 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 8.63/8.81 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 8.63/8.81 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 8.63/8.81 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 8.63/8.81 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 8.63/8.81 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 8.63/8.81 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 8.63/8.81 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 8.63/8.81 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 8.63/8.81 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 8.63/8.81 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 8.63/8.81 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 8.63/8.81 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 8.63/8.81 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 8.63/8.81 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 8.63/8.81 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 8.63/8.81 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 8.63/8.81 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 8.63/8.81 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 8.63/8.81 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 8.63/8.81 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 8.63/8.81 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 8.63/8.81 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 8.63/8.81 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 8.63/8.81 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 8.63/8.81 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 8.63/8.81 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 8.63/8.81 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 8.63/8.81 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 8.63/8.81 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 8.63/8.81 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 8.63/8.81 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 8.63/8.81 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 8.63/8.81 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 8.63/8.81 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 8.63/8.81 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 8.63/8.81 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 8.63/8.81 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 8.63/8.81 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 8.63/8.81 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 8.63/8.81 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 8.63/8.81 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 8.63/8.81 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 8.63/8.81 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 8.63/8.81 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 8.63/8.81 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 8.63/8.81 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 8.63/8.81 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 8.63/8.81 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 8.63/8.81 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 8.63/8.81 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 8.63/8.81 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 8.63/8.81 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 8.63/8.81 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 8.63/8.81 (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))))
% 8.63/8.81 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 8.63/8.81 (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))))
% 8.63/8.81 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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))))
% 8.63/8.81 (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)))))
% 8.63/8.81 (assume a185 (tptp.ssList tptp.sk1))
% 8.63/8.81 (assume a186 (tptp.ssList tptp.sk2))
% 8.63/8.81 (assume a187 (tptp.ssList tptp.sk3))
% 8.63/8.81 (assume a188 (tptp.ssList tptp.sk4))
% 8.63/8.81 (assume a189 (= tptp.sk2 tptp.sk4))
% 8.63/8.81 (assume a190 (= tptp.sk1 tptp.sk3))
% 8.63/8.81 (assume a191 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk4)))))
% 8.63/8.81 (assume a192 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 8.63/8.81 (assume a193 (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))
% 8.63/8.81 (assume a194 (forall ((A $$unsorted) (B $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))))
% 8.63/8.81 (assume a195 (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)))
% 8.63/8.81 (assume a196 (forall ((A $$unsorted) (B $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))))
% 8.63/8.81 (step t1 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule equiv_pos2)
% 8.63/8.81 (step t2 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 8.63/8.81 (step t3 (cl (= (= (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) true) (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule equiv_simplify)
% 8.63/8.81 (step t4 (cl (not (= (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) true)) (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule equiv1 :premises (t3))
% 8.63/8.81 (step t5 (cl (= (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))))) :rule all_simplify)
% 8.63/8.81 (step t6 (cl (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule refl)
% 8.63/8.81 (step t7 (cl (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule all_simplify)
% 8.63/8.81 (step t8 (cl (= (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule cong :premises (t6 t7))
% 8.63/8.81 (step t9 (cl (= (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) true)) :rule all_simplify)
% 8.63/8.81 (step t10 (cl (= (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) true)) :rule trans :premises (t8 t9))
% 8.63/8.81 (step t11 (cl (= (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) true)) :rule trans :premises (t5 t10))
% 8.63/8.81 (step t12 (cl (= (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule resolution :premises (t4 t11))
% 8.63/8.81 (step t13 (cl (= (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule refl)
% 8.63/8.81 (step t14 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule cong :premises (t2 t12 t13))
% 8.63/8.81 (step t15 (cl (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule and_neg)
% 8.63/8.81 (step t16 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t17)
% 8.63/8.81 (assume t17.a0 (= tptp.sk1 tptp.sk3))
% 8.63/8.81 (assume t17.a1 (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))
% 8.63/8.81 (step t17.t1 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t17.t2)
% 8.63/8.81 (assume t17.t2.a0 (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))
% 8.63/8.81 (assume t17.t2.a1 (= tptp.sk1 tptp.sk3))
% 8.63/8.81 (step t17.t2.t1 (cl (= (= (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) false) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule equiv_simplify)
% 8.63/8.81 (step t17.t2.t2 (cl (not (= (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) false)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule equiv1 :premises (t17.t2.t1))
% 8.63/8.81 (step t17.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t17.t2.a1))
% 8.63/8.81 (step t17.t2.t4 (cl (= (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule refl)
% 8.63/8.81 (step t17.t2.t5 (cl (= (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule cong :premises (t17.t2.t3 t17.t2.t4))
% 8.63/8.81 (step t17.t2.t6 (cl (= (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) false) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule equiv_simplify)
% 8.63/8.81 (step t17.t2.t7 (cl (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) false) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule equiv2 :premises (t17.t2.t6))
% 8.63/8.81 (step t17.t2.t8 (cl (not (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule not_not)
% 8.63/8.81 (step t17.t2.t9 (cl (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) false) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule resolution :premises (t17.t2.t7 t17.t2.t8))
% 8.63/8.81 (step t17.t2.t10 (cl (= (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) false)) :rule resolution :premises (t17.t2.t9 t17.t2.a0))
% 8.63/8.81 (step t17.t2.t11 (cl (= (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) false)) :rule trans :premises (t17.t2.t5 t17.t2.t10))
% 8.63/8.81 (step t17.t2.t12 (cl (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule resolution :premises (t17.t2.t2 t17.t2.t11))
% 8.63/8.81 (step t17.t2 (cl (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule subproof :discharge (t17.t2.a0 t17.t2.a1))
% 8.63/8.81 (step t17.t3 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule and_pos)
% 8.63/8.81 (step t17.t4 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 8.63/8.81 (step t17.t5 (cl (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t17.t2 t17.t3 t17.t4))
% 8.63/8.81 (step t17.t6 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule reordering :premises (t17.t5))
% 8.63/8.81 (step t17.t7 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule contraction :premises (t17.t6))
% 8.63/8.81 (step t17.t8 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule resolution :premises (t17.t1 t17.t7))
% 8.63/8.81 (step t17.t9 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule implies_neg2)
% 8.63/8.81 (step t17.t10 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (=> (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule resolution :premises (t17.t8 t17.t9))
% 8.63/8.81 (step t17.t11 (cl (=> (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule contraction :premises (t17.t10))
% 8.63/8.81 (step t17.t12 (cl (not (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule implies :premises (t17.t11))
% 8.63/8.81 (step t17.t13 (cl (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 8.63/8.81 (step t17.t14 (cl (and (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t17.t13 t17.a1 t17.a0))
% 8.63/8.81 (step t17.t15 (cl (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule resolution :premises (t17.t12 t17.t14))
% 8.63/8.81 (step t17 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule subproof :discharge (t17.a0 t17.a1))
% 8.63/8.81 (step t18 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 8.63/8.81 (step t19 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule and_pos)
% 8.63/8.81 (step t20 (cl (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule resolution :premises (t17 t18 t19))
% 8.63/8.81 (step t21 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule reordering :premises (t20))
% 8.63/8.81 (step t22 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule contraction :premises (t21))
% 8.63/8.81 (step t23 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule resolution :premises (t16 t22))
% 8.63/8.81 (step t24 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule implies_neg2)
% 8.63/8.81 (step t25 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule resolution :premises (t23 t24))
% 8.63/8.81 (step t26 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule contraction :premises (t25))
% 8.63/8.81 (step t27 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule implies :premises (t26))
% 8.63/8.81 (step t28 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule resolution :premises (t15 t27))
% 8.63/8.81 (step t29 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 8.63/8.81 (step t30 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule or_neg)
% 8.63/8.81 (step t31 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule or_neg)
% 8.63/8.81 (step t32 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule resolution :premises (t28 t29 t30 t31))
% 8.63/8.81 (step t33 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule contraction :premises (t32))
% 8.63/8.81 (step t34 (cl (or (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule resolution :premises (t1 t14 t33))
% 8.63/8.81 (step t35 (cl (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule or :premises (t34))
% 8.63/8.81 (step t36 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule or_pos)
% 8.63/8.81 (step t37 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) :rule reordering :premises (t36))
% 8.63/8.81 (step t38 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t39)
% 8.63/8.81 (assume t39.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 8.63/8.81 (step t39.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 8.63/8.81 (step t39.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule or :premises (t39.t1))
% 8.63/8.81 (step t39.t3 (cl (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t39.t2 t39.a0))
% 8.63/8.81 (step t39 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule subproof :discharge (t39.a0))
% 8.63/8.81 (step t40 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t38 t39))
% 8.63/8.81 (step t41 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule implies_neg2)
% 8.63/8.81 (step t42 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule resolution :premises (t40 t41))
% 8.63/8.81 (step t43 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule contraction :premises (t42))
% 8.63/8.81 (step t44 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule implies :premises (t43))
% 8.63/8.81 (step t45 (cl (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t44 a11))
% 8.63/8.81 (step t46 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t47)
% 8.63/8.81 (assume t47.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 8.63/8.81 (step t47.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 8.63/8.81 (step t47.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule or :premises (t47.t1))
% 8.63/8.81 (step t47.t3 (cl (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t47.t2 t47.a0))
% 8.63/8.81 (step t47 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule subproof :discharge (t47.a0))
% 8.63/8.81 (step t48 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t46 t47))
% 8.63/8.81 (step t49 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule implies_neg2)
% 8.63/8.81 (step t50 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t48 t49))
% 8.63/8.81 (step t51 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t50))
% 8.63/8.81 (step t52 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule implies :premises (t51))
% 8.63/8.81 (step t53 (cl (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t52 a12))
% 8.63/8.81 (step t54 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule and_neg)
% 8.63/8.81 (step t55 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t56)
% 8.63/8.81 (assume t56.a0 (= tptp.sk2 tptp.sk4))
% 8.63/8.81 (assume t56.a1 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (assume t56.a2 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (step t56.t1 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t56.t2)
% 8.63/8.81 (assume t56.t2.a0 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (assume t56.t2.a1 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (assume t56.t2.a2 (= tptp.sk2 tptp.sk4))
% 8.63/8.81 (step t56.t2.t1 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t56.t2.a2))
% 8.63/8.81 (step t56.t2.t2 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule symm :premises (t56.t2.a1))
% 8.63/8.81 (step t56.t2.t3 (cl (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t56.t2.t2))
% 8.63/8.81 (step t56.t2.t4 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t56.t2.a0))
% 8.63/8.81 (step t56.t2.t5 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t56.t2.t4))
% 8.63/8.81 (step t56.t2.t6 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule trans :premises (t56.t2.t1 t56.t2.t3 t56.t2.t5))
% 8.63/8.81 (step t56.t2 (cl (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t56.t2.a0 t56.t2.a1 t56.t2.a2))
% 8.63/8.81 (step t56.t3 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t56.t4 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t56.t5 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t56.t6 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t56.t2 t56.t3 t56.t4 t56.t5))
% 8.63/8.81 (step t56.t7 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t56.t6))
% 8.63/8.81 (step t56.t8 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t56.t7))
% 8.63/8.81 (step t56.t9 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t56.t1 t56.t8))
% 8.63/8.81 (step t56.t10 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 8.63/8.81 (step t56.t11 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t56.t9 t56.t10))
% 8.63/8.81 (step t56.t12 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t56.t11))
% 8.63/8.81 (step t56.t13 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t56.t12))
% 8.63/8.81 (step t56.t14 (cl (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4)) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 8.63/8.81 (step t56.t15 (cl (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t56.t14 t56.a2 t56.a1 t56.a0))
% 8.63/8.81 (step t56.t16 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t56.t13 t56.t15))
% 8.63/8.81 (step t56 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t56.a0 t56.a1 t56.a2))
% 8.63/8.81 (step t57 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t58 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t59 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t60 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t56 t57 t58 t59))
% 8.63/8.81 (step t61 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t60))
% 8.63/8.81 (step t62 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t61))
% 8.63/8.81 (step t63 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t55 t62))
% 8.63/8.81 (step t64 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 8.63/8.81 (step t65 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t63 t64))
% 8.63/8.81 (step t66 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t65))
% 8.63/8.81 (step t67 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t66))
% 8.63/8.81 (step t68 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t54 t67))
% 8.63/8.81 (step t69 (cl (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)) :rule or_pos)
% 8.63/8.81 (step t70 (cl (= tptp.nil tptp.sk2) (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule reordering :premises (t69))
% 8.63/8.81 (step t71 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule and_neg)
% 8.63/8.81 (step t72 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t73)
% 8.63/8.81 (assume t73.a0 (= tptp.sk2 tptp.sk4))
% 8.63/8.81 (assume t73.a1 (= tptp.nil tptp.sk2))
% 8.63/8.81 (step t73.t1 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t73.t2)
% 8.63/8.81 (assume t73.t2.a0 (= tptp.sk2 tptp.sk4))
% 8.63/8.81 (assume t73.t2.a1 (= tptp.nil tptp.sk2))
% 8.63/8.81 (step t73.t2.t1 (cl (= tptp.sk2 tptp.nil)) :rule symm :premises (t73.t2.a1))
% 8.63/8.81 (step t73.t2.t2 (cl (= tptp.nil tptp.sk2)) :rule symm :premises (t73.t2.t1))
% 8.63/8.81 (step t73.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t73.t2.a0))
% 8.63/8.81 (step t73.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t73.t2.t3))
% 8.63/8.81 (step t73.t2.t5 (cl (= tptp.nil tptp.sk4)) :rule trans :premises (t73.t2.t2 t73.t2.t4))
% 8.63/8.81 (step t73.t2 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule subproof :discharge (t73.t2.a0 t73.t2.a1))
% 8.63/8.81 (step t73.t3 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t73.t4 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 8.63/8.81 (step t73.t5 (cl (= tptp.nil tptp.sk4) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t73.t2 t73.t3 t73.t4))
% 8.63/8.81 (step t73.t6 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule reordering :premises (t73.t5))
% 8.63/8.81 (step t73.t7 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule contraction :premises (t73.t6))
% 8.63/8.81 (step t73.t8 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t73.t1 t73.t7))
% 8.63/8.81 (step t73.t9 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule implies_neg2)
% 8.63/8.81 (step t73.t10 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t73.t8 t73.t9))
% 8.63/8.81 (step t73.t11 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule contraction :premises (t73.t10))
% 8.63/8.81 (step t73.t12 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule implies :premises (t73.t11))
% 8.63/8.81 (step t73.t13 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule and_neg)
% 8.63/8.81 (step t73.t14 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule resolution :premises (t73.t13 t73.a0 t73.a1))
% 8.63/8.81 (step t73.t15 (cl (= tptp.nil tptp.sk4)) :rule resolution :premises (t73.t12 t73.t14))
% 8.63/8.81 (step t73 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule subproof :discharge (t73.a0 t73.a1))
% 8.63/8.81 (step t74 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t75 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 8.63/8.81 (step t76 (cl (= tptp.nil tptp.sk4) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t73 t74 t75))
% 8.63/8.81 (step t77 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule reordering :premises (t76))
% 8.63/8.81 (step t78 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule contraction :premises (t77))
% 8.63/8.81 (step t79 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t72 t78))
% 8.63/8.81 (step t80 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule implies_neg2)
% 8.63/8.81 (step t81 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t79 t80))
% 8.63/8.81 (step t82 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule contraction :premises (t81))
% 8.63/8.81 (step t83 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule implies :premises (t82))
% 8.63/8.81 (step t84 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t71 t83))
% 8.63/8.81 (step t85 (cl (= tptp.nil tptp.sk4) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule reordering :premises (t84))
% 8.63/8.81 (step t86 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.nil tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.nil tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule equiv_pos2)
% 8.63/8.81 (step t87 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 8.63/8.81 (step t88 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 8.63/8.81 (step t89 (cl (= (= (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil)) true) (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil)))) :rule equiv_simplify)
% 8.63/8.81 (step t90 (cl (not (= (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil)) true)) (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil))) :rule equiv1 :premises (t89))
% 8.63/8.81 (step t91 (cl (= (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil)) (= (tptp.neq tptp.nil tptp.nil) (not (not (tptp.neq tptp.nil tptp.nil)))))) :rule all_simplify)
% 8.63/8.81 (step t92 (cl (= (tptp.neq tptp.nil tptp.nil) (tptp.neq tptp.nil tptp.nil))) :rule refl)
% 8.63/8.81 (step t93 (cl (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil))) :rule all_simplify)
% 8.63/8.81 (step t94 (cl (= (= (tptp.neq tptp.nil tptp.nil) (not (not (tptp.neq tptp.nil tptp.nil)))) (= (tptp.neq tptp.nil tptp.nil) (tptp.neq tptp.nil tptp.nil)))) :rule cong :premises (t92 t93))
% 8.63/8.81 (step t95 (cl (= (= (tptp.neq tptp.nil tptp.nil) (tptp.neq tptp.nil tptp.nil)) true)) :rule all_simplify)
% 8.63/8.81 (step t96 (cl (= (= (tptp.neq tptp.nil tptp.nil) (not (not (tptp.neq tptp.nil tptp.nil)))) true)) :rule trans :premises (t94 t95))
% 8.63/8.81 (step t97 (cl (= (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil)) true)) :rule trans :premises (t91 t96))
% 8.63/8.81 (step t98 (cl (= (not (not (tptp.neq tptp.nil tptp.nil))) (tptp.neq tptp.nil tptp.nil))) :rule resolution :premises (t90 t97))
% 8.63/8.81 (step t99 (cl (= (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule refl)
% 8.63/8.81 (step t100 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.nil tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil))))) :rule cong :premises (t87 t88 t98 t99))
% 8.63/8.81 (step t101 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil)))) :rule and_neg)
% 8.63/8.81 (step t102 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t103)
% 8.63/8.81 (assume t103.a0 (= tptp.sk2 tptp.sk4))
% 8.63/8.81 (assume t103.a1 (= tptp.nil tptp.sk4))
% 8.63/8.81 (assume t103.a2 (not (tptp.neq tptp.nil tptp.nil)))
% 8.63/8.81 (step t103.t1 (cl (=> (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t103.t2)
% 8.63/8.81 (assume t103.t2.a0 (not (tptp.neq tptp.nil tptp.nil)))
% 8.63/8.81 (assume t103.t2.a1 (= tptp.nil tptp.sk4))
% 8.63/8.81 (assume t103.t2.a2 (= tptp.sk2 tptp.sk4))
% 8.63/8.81 (step t103.t2.t1 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) false) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule equiv_simplify)
% 8.63/8.81 (step t103.t2.t2 (cl (not (= (tptp.neq tptp.sk2 tptp.nil) false)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv1 :premises (t103.t2.t1))
% 8.63/8.81 (step t103.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t103.t2.a2))
% 8.63/8.81 (step t103.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t103.t2.t3))
% 8.63/8.81 (step t103.t2.t5 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t103.t2.a1))
% 8.63/8.81 (step t103.t2.t6 (cl (= tptp.sk2 tptp.nil)) :rule trans :premises (t103.t2.t4 t103.t2.t5))
% 8.63/8.81 (step t103.t2.t7 (cl (= tptp.nil tptp.nil)) :rule refl)
% 8.63/8.81 (step t103.t2.t8 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.nil tptp.nil))) :rule cong :premises (t103.t2.t6 t103.t2.t7))
% 8.63/8.81 (step t103.t2.t9 (cl (= (= (tptp.neq tptp.nil tptp.nil) false) (not (tptp.neq tptp.nil tptp.nil)))) :rule equiv_simplify)
% 8.63/8.81 (step t103.t2.t10 (cl (= (tptp.neq tptp.nil tptp.nil) false) (not (not (tptp.neq tptp.nil tptp.nil)))) :rule equiv2 :premises (t103.t2.t9))
% 8.63/8.81 (step t103.t2.t11 (cl (not (not (not (tptp.neq tptp.nil tptp.nil)))) (tptp.neq tptp.nil tptp.nil)) :rule not_not)
% 8.63/8.81 (step t103.t2.t12 (cl (= (tptp.neq tptp.nil tptp.nil) false) (tptp.neq tptp.nil tptp.nil)) :rule resolution :premises (t103.t2.t10 t103.t2.t11))
% 8.63/8.81 (step t103.t2.t13 (cl (= (tptp.neq tptp.nil tptp.nil) false)) :rule resolution :premises (t103.t2.t12 t103.t2.a0))
% 8.63/8.81 (step t103.t2.t14 (cl (= (tptp.neq tptp.sk2 tptp.nil) false)) :rule trans :premises (t103.t2.t8 t103.t2.t13))
% 8.63/8.81 (step t103.t2.t15 (cl (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t103.t2.t2 t103.t2.t14))
% 8.63/8.81 (step t103.t2 (cl (not (not (tptp.neq tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule subproof :discharge (t103.t2.a0 t103.t2.a1 t103.t2.a2))
% 8.63/8.81 (step t103.t3 (cl (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.nil tptp.nil))) :rule and_pos)
% 8.63/8.81 (step t103.t4 (cl (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t103.t5 (cl (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t103.t6 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t103.t2 t103.t3 t103.t4 t103.t5))
% 8.63/8.81 (step t103.t7 (cl (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t103.t6))
% 8.63/8.81 (step t103.t8 (cl (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule contraction :premises (t103.t7))
% 8.63/8.81 (step t103.t9 (cl (=> (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t103.t1 t103.t8))
% 8.63/8.81 (step t103.t10 (cl (=> (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 8.63/8.81 (step t103.t11 (cl (=> (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (=> (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t103.t9 t103.t10))
% 8.63/8.81 (step t103.t12 (cl (=> (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t103.t11))
% 8.63/8.81 (step t103.t13 (cl (not (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule implies :premises (t103.t12))
% 8.63/8.81 (step t103.t14 (cl (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 8.63/8.81 (step t103.t15 (cl (and (not (tptp.neq tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t103.t14 t103.a2 t103.a1 t103.a0))
% 8.63/8.81 (step t103.t16 (cl (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t103.t13 t103.t15))
% 8.63/8.81 (step t103 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule subproof :discharge (t103.a0 t103.a1 t103.a2))
% 8.63/8.81 (step t104 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t105 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 8.63/8.81 (step t106 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (tptp.neq tptp.nil tptp.nil))) :rule and_pos)
% 8.63/8.81 (step t107 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))))) :rule resolution :premises (t103 t104 t105 t106))
% 8.63/8.81 (step t108 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t107))
% 8.63/8.81 (step t109 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule contraction :premises (t108))
% 8.63/8.81 (step t110 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t102 t109))
% 8.63/8.81 (step t111 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 8.63/8.81 (step t112 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t110 t111))
% 8.63/8.81 (step t113 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t112))
% 8.63/8.81 (step t114 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.nil tptp.nil)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule implies :premises (t113))
% 8.63/8.81 (step t115 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t101 t114))
% 8.63/8.81 (step t116 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 8.63/8.81 (step t117 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 8.63/8.81 (step t118 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (not (tptp.neq tptp.nil tptp.nil))))) :rule or_neg)
% 8.63/8.81 (step t119 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule or_neg)
% 8.63/8.81 (step t120 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t115 t116 t117 t118 t119))
% 8.63/8.81 (step t121 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.nil tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t120))
% 8.63/8.81 (step t122 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.nil tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t86 t100 t121))
% 8.63/8.81 (step t123 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.nil tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil))) :rule or :premises (t122))
% 8.63/8.81 (step t124 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.nil tptp.nil)) :rule reordering :premises (t123))
% 8.63/8.81 (step t125 (cl (not (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 8.63/8.81 (step t126 (cl (not (tptp.ssList tptp.nil)) (not (tptp.neq tptp.nil tptp.nil)) (not (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t125))
% 8.63/8.81 (step t127 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t128)
% 8.63/8.81 (assume t128.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 8.63/8.81 (step t128.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= V tptp.nil)))
% 8.63/8.81 (step t128.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t128.t1))
% 8.63/8.81 (step t128.t3 (cl (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t128.t2 t128.a0))
% 8.63/8.81 (step t128 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t128.a0))
% 8.63/8.81 (step t129 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t127 t128))
% 8.63/8.81 (step t130 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) (not (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 8.63/8.81 (step t131 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t129 t130))
% 8.63/8.81 (step t132 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t131))
% 8.63/8.81 (step t133 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t132))
% 8.63/8.81 (step t134 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U))))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 8.63/8.81 (step t135 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))))) :rule all_simplify)
% 8.63/8.81 (anchor :step t136 :args ((V $$unsorted) (:= V V)))
% 8.63/8.81 (step t136.t1 (cl (= V V)) :rule refl)
% 8.63/8.81 (step t136.t2 (cl (= (= V V) true)) :rule all_simplify)
% 8.63/8.81 (step t136.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t136.t2))
% 8.63/8.81 (step t136.t4 (cl (= (not true) false)) :rule all_simplify)
% 8.63/8.81 (step t136.t5 (cl (= (not (= V V)) false)) :rule trans :premises (t136.t3 t136.t4))
% 8.63/8.81 (step t136.t6 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 8.63/8.81 (step t136.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 8.63/8.81 (step t136.t8 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))))) :rule cong :premises (t136.t5 t136.t6 t136.t7 t136.t7))
% 8.63/8.81 (step t136.t9 (cl (= (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule all_simplify)
% 8.63/8.81 (step t136.t10 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule trans :premises (t136.t8 t136.t9))
% 8.63/8.81 (step t136 (cl (= (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule bind)
% 8.63/8.81 (step t137 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule trans :premises (t135 t136))
% 8.63/8.81 (step t138 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t134 t137 a114))
% 8.63/8.81 (step t139 (cl (or (not (tptp.neq tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t133 t138))
% 8.63/8.81 (step t140 (cl (not (tptp.neq tptp.nil tptp.nil))) :rule resolution :premises (t126 a7 t139))
% 8.63/8.81 (step t141 (cl (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)) :rule or :premises (a195))
% 8.63/8.81 (step t142 (cl (tptp.neq tptp.sk2 tptp.nil) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t141))
% 8.63/8.81 (step t143 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 8.63/8.81 (step t144 (cl (= (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true) (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 8.63/8.81 (step t145 (cl (not (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true)) (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule equiv1 :premises (t144))
% 8.63/8.81 (step t146 (cl (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))))) :rule all_simplify)
% 8.63/8.81 (step t147 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 8.63/8.81 (step t148 (cl (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule all_simplify)
% 8.63/8.81 (step t149 (cl (= (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))) (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)))) :rule cong :premises (t147 t148))
% 8.63/8.81 (step t150 (cl (= (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)) true)) :rule all_simplify)
% 8.63/8.81 (step t151 (cl (= (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))) true)) :rule trans :premises (t149 t150))
% 8.63/8.81 (step t152 (cl (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true)) :rule trans :premises (t146 t151))
% 8.63/8.81 (step t153 (cl (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule resolution :premises (t145 t152))
% 8.63/8.81 (step t154 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 8.63/8.81 (step t155 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))))) :rule cong :premises (t2 t153 t154))
% 8.63/8.81 (step t156 (cl (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1)))) :rule and_neg)
% 8.63/8.81 (step t157 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t158)
% 8.63/8.81 (assume t158.a0 (= tptp.sk1 tptp.sk3))
% 8.63/8.81 (assume t158.a1 (not (= tptp.nil tptp.sk1)))
% 8.63/8.81 (step t158.t1 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t158.t2)
% 8.63/8.81 (assume t158.t2.a0 (not (= tptp.nil tptp.sk1)))
% 8.63/8.81 (assume t158.t2.a1 (= tptp.sk1 tptp.sk3))
% 8.63/8.81 (step t158.t2.t1 (cl (= (= (= tptp.nil tptp.sk3) false) (not (= tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 8.63/8.81 (step t158.t2.t2 (cl (not (= (= tptp.nil tptp.sk3) false)) (not (= tptp.nil tptp.sk3))) :rule equiv1 :premises (t158.t2.t1))
% 8.63/8.81 (step t158.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 8.63/8.81 (step t158.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t158.t2.a1))
% 8.63/8.81 (step t158.t2.t5 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk1))) :rule cong :premises (t158.t2.t3 t158.t2.t4))
% 8.63/8.81 (step t158.t2.t6 (cl (= (= (= tptp.nil tptp.sk1) false) (not (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 8.63/8.81 (step t158.t2.t7 (cl (= (= tptp.nil tptp.sk1) false) (not (not (= tptp.nil tptp.sk1)))) :rule equiv2 :premises (t158.t2.t6))
% 8.63/8.81 (step t158.t2.t8 (cl (not (not (not (= tptp.nil tptp.sk1)))) (= tptp.nil tptp.sk1)) :rule not_not)
% 8.63/8.81 (step t158.t2.t9 (cl (= (= tptp.nil tptp.sk1) false) (= tptp.nil tptp.sk1)) :rule resolution :premises (t158.t2.t7 t158.t2.t8))
% 8.63/8.81 (step t158.t2.t10 (cl (= (= tptp.nil tptp.sk1) false)) :rule resolution :premises (t158.t2.t9 t158.t2.a0))
% 8.63/8.81 (step t158.t2.t11 (cl (= (= tptp.nil tptp.sk3) false)) :rule trans :premises (t158.t2.t5 t158.t2.t10))
% 8.63/8.81 (step t158.t2.t12 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t158.t2.t2 t158.t2.t11))
% 8.63/8.81 (step t158.t2 (cl (not (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t158.t2.a0 t158.t2.a1))
% 8.63/8.81 (step t158.t3 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule and_pos)
% 8.63/8.81 (step t158.t4 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 8.63/8.81 (step t158.t5 (cl (not (= tptp.nil tptp.sk3)) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t158.t2 t158.t3 t158.t4))
% 8.63/8.81 (step t158.t6 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t158.t5))
% 8.63/8.81 (step t158.t7 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t158.t6))
% 8.63/8.81 (step t158.t8 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t158.t1 t158.t7))
% 8.63/8.81 (step t158.t9 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 8.63/8.81 (step t158.t10 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t158.t8 t158.t9))
% 8.63/8.81 (step t158.t11 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t158.t10))
% 8.63/8.81 (step t158.t12 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t158.t11))
% 8.63/8.81 (step t158.t13 (cl (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 8.63/8.81 (step t158.t14 (cl (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t158.t13 t158.a1 t158.a0))
% 8.63/8.81 (step t158.t15 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t158.t12 t158.t14))
% 8.63/8.81 (step t158 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t158.a0 t158.a1))
% 8.63/8.81 (step t159 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 8.63/8.81 (step t160 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk1))) :rule and_pos)
% 8.63/8.81 (step t161 (cl (not (= tptp.nil tptp.sk3)) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))))) :rule resolution :premises (t158 t159 t160))
% 8.63/8.81 (step t162 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t161))
% 8.63/8.81 (step t163 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t162))
% 8.63/8.81 (step t164 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t157 t163))
% 8.63/8.81 (step t165 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 8.63/8.81 (step t166 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t164 t165))
% 8.63/8.81 (step t167 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t166))
% 8.63/8.81 (step t168 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t167))
% 8.63/8.81 (step t169 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t156 t168))
% 8.63/8.81 (step t170 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 8.63/8.81 (step t171 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (not (= tptp.nil tptp.sk1))))) :rule or_neg)
% 8.63/8.81 (step t172 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 8.63/8.81 (step t173 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t169 t170 t171 t172))
% 8.63/8.81 (step t174 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t173))
% 8.63/8.81 (step t175 (cl (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t143 t155 t174))
% 8.63/8.81 (step t176 (cl (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))) :rule or :premises (t175))
% 8.63/8.81 (step t177 (cl (= tptp.nil tptp.sk1) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t176))
% 8.63/8.81 (step t178 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a192))
% 8.63/8.81 (step t179 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t124 t140 a189 t142 t177 a190 t178))
% 8.63/8.81 (step t180 (cl (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t179))
% 8.63/8.81 (step t181 (cl (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t85 t180 a189))
% 8.63/8.81 (step t182 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t183)
% 8.63/8.81 (assume t183.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))
% 8.63/8.81 (step t183.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 8.63/8.81 (step t183.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule or :premises (t183.t1))
% 8.63/8.81 (step t183.t3 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t183.t2 t183.a0))
% 8.63/8.81 (step t183 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule subproof :discharge (t183.a0))
% 8.63/8.81 (step t184 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t182 t183))
% 8.63/8.81 (step t185 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule implies_neg2)
% 8.63/8.81 (step t186 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t184 t185))
% 8.63/8.81 (step t187 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule contraction :premises (t186))
% 8.63/8.81 (step t188 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule implies :premises (t187))
% 8.63/8.81 (step t189 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule equiv_pos2)
% 8.63/8.81 (anchor :step t190 :args ((U $$unsorted) (:= U U)))
% 8.63/8.81 (step t190.t1 (cl (= U U)) :rule refl)
% 8.63/8.81 (step t190.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 8.63/8.81 (step t190.t3 (cl (= (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))))) :rule all_simplify)
% 8.63/8.81 (step t190.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 8.63/8.81 (step t190.t5 (cl (= (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule cong :premises (t190.t2 t190.t3 t190.t4))
% 8.63/8.81 (step t190 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) :rule bind)
% 8.63/8.81 (step t191 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule resolution :premises (t189 t190 a108))
% 8.63/8.81 (step t192 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t188 t191))
% 8.63/8.81 (step t193 (cl (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t70 t181 a186 t192))
% 8.63/8.81 (step t194 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule or_pos)
% 8.63/8.81 (step t195 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule reordering :premises (t194))
% 8.63/8.81 (step t196 (cl (not (= (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) (not (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule equiv_pos2)
% 8.63/8.81 (step t197 (cl (= (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)))) (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)))))) :rule refl)
% 8.63/8.81 (step t198 (cl (= (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))))) :rule refl)
% 8.63/8.81 (step t199 (cl (= (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))))) :rule refl)
% 8.63/8.81 (step t200 (cl (= (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule all_simplify)
% 8.63/8.81 (step t201 (cl (= (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule cong :premises (t198 t199 t200))
% 8.63/8.81 (step t202 (cl (= (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) :rule cong :premises (t197 t201))
% 8.63/8.81 (step t203 (cl (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (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))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t204)
% 8.63/8.81 (assume t204.a0 (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)))))
% 8.63/8.81 (step t204.t1 (cl (or (not (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))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk2)) (:= V (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (step t204.t2 (cl (not (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))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule or :premises (t204.t1))
% 8.63/8.81 (step t204.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t204.t2 t204.a0))
% 8.63/8.81 (step t204 (cl (not (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))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule subproof :discharge (t204.a0))
% 8.63/8.81 (step t205 (cl (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t203 t204))
% 8.63/8.81 (step t206 (cl (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies_neg2)
% 8.63/8.81 (step t207 (cl (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t205 t206))
% 8.63/8.81 (step t208 (cl (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule contraction :premises (t207))
% 8.63/8.81 (step t209 (cl (=> (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)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t196 t202 t208))
% 8.63/8.81 (step t210 (cl (not (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))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies :premises (t209))
% 8.63/8.81 (step t211 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t210 a119))
% 8.63/8.81 (step t212 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t195 t45 t53 t211))
% 8.63/8.81 (step t213 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t68 a189 t193 t212))
% 8.63/8.81 (step t214 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t215)
% 8.63/8.81 (assume t215.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))))
% 8.63/8.81 (step t215.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) :rule forall_inst :args ((:= A (tptp.skaf83 tptp.sk2)) (:= B (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (step t215.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule or :premises (t215.t1))
% 8.63/8.81 (step t215.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t215.t2 t215.a0))
% 8.63/8.81 (step t215 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule subproof :discharge (t215.a0))
% 8.63/8.81 (step t216 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t214 t215))
% 8.63/8.81 (step t217 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) :rule implies_neg2)
% 8.63/8.81 (step t218 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) :rule resolution :premises (t216 t217))
% 8.63/8.81 (step t219 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) :rule contraction :premises (t218))
% 8.63/8.81 (step t220 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule implies :premises (t219))
% 8.63/8.81 (step t221 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk4)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk4))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) :rule equiv_pos2)
% 8.63/8.81 (anchor :step t222 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 8.63/8.81 (step t222.t1 (cl (= A A)) :rule refl)
% 8.63/8.81 (step t222.t2 (cl (= B B)) :rule refl)
% 8.63/8.81 (step t222.t3 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 8.63/8.81 (step t222.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 8.63/8.81 (step t222.t5 (cl (= (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))))) :rule all_simplify)
% 8.63/8.81 (step t222.t6 (cl (= (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))) :rule all_simplify)
% 8.63/8.81 (step t222.t7 (cl (= (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))) :rule cong :premises (t222.t6))
% 8.63/8.81 (step t222.t8 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk4))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) :rule cong :premises (t222.t3 t222.t4 t222.t5 t222.t7))
% 8.63/8.81 (step t222 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk3) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk4)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B))))))) :rule bind)
% 8.63/8.81 (step t223 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (= tptp.sk3 (tptp.app B (tptp.cons A tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons A tptp.nil) B)))))) :rule resolution :premises (t221 t222 a191))
% 8.63/8.81 (step t224 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t220 t223))
% 8.63/8.81 (step t225 (cl (= tptp.sk3 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule resolution :premises (t37 t45 t53 t213 t224))
% 8.63/8.81 (step t226 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule or_pos)
% 8.63/8.81 (step t227 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule reordering :premises (t226))
% 8.63/8.81 (step t228 (cl (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule and_neg)
% 8.63/8.81 (step t229 (cl (=> (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t230)
% 8.63/8.81 (assume t230.a0 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (assume t230.a1 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (step t230.t1 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t230.t2)
% 8.63/8.81 (assume t230.t2.a0 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (assume t230.t2.a1 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (step t230.t2.t1 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule symm :premises (t230.t2.a1))
% 8.63/8.81 (step t230.t2.t2 (cl (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t230.t2.t1))
% 8.63/8.81 (step t230.t2.t3 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t230.t2.a0))
% 8.63/8.81 (step t230.t2.t4 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t230.t2.t3))
% 8.63/8.81 (step t230.t2.t5 (cl (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule trans :premises (t230.t2.t2 t230.t2.t4))
% 8.63/8.81 (step t230.t2 (cl (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t230.t2.a0 t230.t2.a1))
% 8.63/8.81 (step t230.t3 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t230.t4 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t230.t5 (cl (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t230.t2 t230.t3 t230.t4))
% 8.63/8.81 (step t230.t6 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t230.t5))
% 8.63/8.81 (step t230.t7 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t230.t6))
% 8.63/8.81 (step t230.t8 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t230.t1 t230.t7))
% 8.63/8.81 (step t230.t9 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 8.63/8.81 (step t230.t10 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t230.t8 t230.t9))
% 8.63/8.81 (step t230.t11 (cl (=> (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t230.t10))
% 8.63/8.81 (step t230.t12 (cl (not (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t230.t11))
% 8.63/8.81 (step t230.t13 (cl (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule and_neg)
% 8.63/8.81 (step t230.t14 (cl (and (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t230.t13 t230.a1 t230.a0))
% 8.63/8.81 (step t230.t15 (cl (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t230.t12 t230.t14))
% 8.63/8.81 (step t230 (cl (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t230.a0 t230.a1))
% 8.63/8.81 (step t231 (cl (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t232 (cl (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 8.63/8.81 (step t233 (cl (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t230 t231 t232))
% 8.63/8.81 (step t234 (cl (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t233))
% 8.63/8.81 (step t235 (cl (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t234))
% 8.63/8.81 (step t236 (cl (=> (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t229 t235))
% 8.63/8.81 (step t237 (cl (=> (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 8.63/8.81 (step t238 (cl (=> (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (=> (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t236 t237))
% 8.63/8.81 (step t239 (cl (=> (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t238))
% 8.63/8.81 (step t240 (cl (not (and (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t239))
% 8.63/8.81 (step t241 (cl (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t228 t240))
% 8.63/8.81 (step t242 (cl (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t241 t193 t212))
% 8.63/8.81 (step t243 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule implies_neg1)
% 8.63/8.81 (anchor :step t244)
% 8.63/8.81 (assume t244.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))
% 8.63/8.81 (step t244.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule forall_inst :args ((:= A (tptp.skaf83 tptp.sk2)) (:= B (tptp.skaf82 tptp.sk2))))
% 8.63/8.81 (step t244.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule or :premises (t244.t1))
% 8.63/8.81 (step t244.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule resolution :premises (t244.t2 t244.a0))
% 8.63/8.81 (step t244 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule subproof :discharge (t244.a0))
% 8.63/8.81 (step t245 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule resolution :premises (t243 t244))
% 8.63/8.81 (step t246 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule implies_neg2)
% 8.63/8.81 (step t247 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule resolution :premises (t245 t246))
% 8.63/8.81 (step t248 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))))) :rule contraction :premises (t247))
% 8.63/8.81 (step t249 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule implies :premises (t248))
% 8.63/8.81 (step t250 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (= A A) (= B B)))
% 8.63/8.81 (step t251 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule equiv2 :premises (t250))
% 8.63/8.81 (step t252 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a192))
% 8.63/8.81 (step t253 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1))))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule equiv_pos2)
% 8.63/8.81 (anchor :step t254 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 8.63/8.81 (step t254.t1 (cl (= A A)) :rule refl)
% 8.63/8.81 (step t254.t2 (cl (= B B)) :rule refl)
% 8.63/8.81 (step t254.t3 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule refl)
% 8.63/8.81 (step t254.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 8.63/8.81 (step t254.t5 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 8.63/8.81 (step t254.t6 (cl (= (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B)))) :rule all_simplify)
% 8.63/8.81 (step t254.t7 (cl (= (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))))) :rule cong :premises (t254.t6))
% 8.63/8.81 (step t254.t8 (cl (= (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))) :rule all_simplify)
% 8.63/8.81 (step t254.t9 (cl (= (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) :rule cong :premises (t254.t8))
% 8.63/8.81 (step t254.t10 (cl (= (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1))) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule cong :premises (t254.t3 t254.t4 t254.t5 t254.t7 t254.t9))
% 8.63/8.81 (step t254 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))) (forall ((A $$unsorted) (B $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule bind)
% 8.63/8.81 (step t255 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))))) :rule all_simplify)
% 8.63/8.81 (step t256 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))))) :rule trans :premises (t254 t255))
% 8.63/8.81 (step t257 (cl (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule resolution :premises (t253 t256 a194))
% 8.63/8.81 (step t258 (cl (= tptp.nil tptp.sk2) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule or :premises (t257))
% 8.63/8.81 (step t259 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))) (or (not (= tptp.nil tptp.sk1)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1))))) (or (not (= tptp.nil tptp.sk1)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule equiv_pos2)
% 8.63/8.81 (anchor :step t260 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 8.63/8.81 (step t260.t1 (cl (= A A)) :rule refl)
% 8.63/8.81 (step t260.t2 (cl (= B B)) :rule refl)
% 8.63/8.81 (step t260.t3 (cl (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk1)))) :rule refl)
% 8.63/8.81 (step t260.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 8.63/8.81 (step t260.t5 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 8.63/8.81 (step t260.t6 (cl (= (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B)))) :rule all_simplify)
% 8.63/8.81 (step t260.t7 (cl (= (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))))) :rule cong :premises (t260.t6))
% 8.63/8.81 (step t260.t8 (cl (= (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))) :rule all_simplify)
% 8.63/8.81 (step t260.t9 (cl (= (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) :rule cong :premises (t260.t8))
% 8.63/8.81 (step t260.t10 (cl (= (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1))) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule cong :premises (t260.t3 t260.t4 t260.t5 t260.t7 t260.t9))
% 8.63/8.81 (step t260 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule bind)
% 8.63/8.81 (step t261 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (or (not (= tptp.nil tptp.sk1)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))))) :rule all_simplify)
% 8.63/8.81 (step t262 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk2)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk1)))) (or (not (= tptp.nil tptp.sk1)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))))) :rule trans :premises (t260 t261))
% 8.63/8.81 (step t263 (cl (or (not (= tptp.nil tptp.sk1)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule resolution :premises (t259 t262 a196))
% 8.63/8.81 (step t264 (cl (not (= tptp.nil tptp.sk1)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule or :premises (t263))
% 8.63/8.81 (step t265 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule equiv1 :premises (t250))
% 8.63/8.81 (step t266 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))))) :rule reordering :premises (t265))
% 8.63/8.81 (step t267 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule resolution :premises (t252 t85 a189 t177 a190 t258 t264 t266))
% 8.63/8.81 (step t268 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule contraction :premises (t267))
% 8.63/8.81 (step t269 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app (tptp.cons A tptp.nil) B))) (not (= tptp.sk1 (tptp.app B (tptp.cons A tptp.nil))))))) :rule resolution :premises (t251 t268))
% 8.63/8.81 (step t270 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (= tptp.sk2 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))))) :rule resolution :premises (t249 t269))
% 8.63/8.81 (step t271 (cl (not (= tptp.sk1 (tptp.app (tptp.skaf82 tptp.sk2) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))))) :rule resolution :premises (t227 t45 t53 t242 t270))
% 8.63/8.81 (step t272 (cl) :rule resolution :premises (t35 t225 t271 a190))
% 8.63/8.81
% 8.63/8.84 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.OcEBtMc0QA/cvc5---1.0.5_12109.smt2
% 8.63/8.84 % cvc5---1.0.5 exiting
% 8.63/8.84 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------