TSTP Solution File: SWC325-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC325-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n013.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:31 EDT 2024
% Result : Unsatisfiable 1.54s 1.73s
% Output : Proof 1.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC325-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 26 16:00:24 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.52 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.54/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.TjgtEGtpxp/cvc5---1.0.5_21517.smt2
% 1.54/1.73 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.TjgtEGtpxp/cvc5---1.0.5_21517.smt2
% 1.62/1.79 (assume a0 (tptp.equalelemsP tptp.nil))
% 1.62/1.79 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 1.62/1.79 (assume a2 (tptp.strictorderedP tptp.nil))
% 1.62/1.79 (assume a3 (tptp.totalorderedP tptp.nil))
% 1.62/1.79 (assume a4 (tptp.strictorderP tptp.nil))
% 1.62/1.79 (assume a5 (tptp.totalorderP tptp.nil))
% 1.62/1.79 (assume a6 (tptp.cyclefreeP tptp.nil))
% 1.62/1.79 (assume a7 (tptp.ssList tptp.nil))
% 1.62/1.79 (assume a8 (tptp.ssItem tptp.skac3))
% 1.62/1.79 (assume a9 (tptp.ssItem tptp.skac2))
% 1.62/1.79 (assume a10 (not (tptp.singletonP tptp.nil)))
% 1.62/1.79 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 1.62/1.79 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 1.62/1.79 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 1.62/1.79 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 1.62/1.79 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 1.62/1.79 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 1.62/1.79 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 1.62/1.79 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 1.62/1.79 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 1.62/1.79 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 1.62/1.79 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 1.62/1.79 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 1.62/1.79 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 1.62/1.79 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 1.62/1.79 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 1.62/1.79 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 1.62/1.79 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 1.62/1.79 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 1.62/1.79 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 1.62/1.79 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 1.62/1.79 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 1.62/1.79 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 1.62/1.79 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 1.62/1.79 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 1.62/1.79 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 1.62/1.79 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 1.62/1.79 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 1.62/1.79 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 1.62/1.79 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 1.62/1.79 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 1.62/1.79 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 1.62/1.79 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 1.62/1.79 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 1.62/1.79 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 1.62/1.79 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 1.62/1.79 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 1.62/1.79 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 1.62/1.79 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 1.62/1.79 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 1.62/1.79 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 1.62/1.79 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 1.62/1.79 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 1.62/1.79 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 1.62/1.79 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 1.62/1.79 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 1.62/1.79 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 1.62/1.79 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 1.62/1.79 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 1.62/1.79 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 1.62/1.79 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 1.62/1.79 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 1.62/1.79 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 1.62/1.79 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 1.62/1.79 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 1.62/1.79 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 1.62/1.79 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 1.62/1.79 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 1.62/1.79 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 1.62/1.79 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 1.62/1.79 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 1.62/1.79 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 1.62/1.79 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 1.62/1.79 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 1.62/1.79 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.62/1.79 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.62/1.79 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.62/1.79 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.62/1.79 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 1.62/1.79 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.62/1.79 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 1.62/1.79 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.62/1.79 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 1.62/1.79 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.62/1.79 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 1.62/1.79 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.62/1.79 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 1.62/1.79 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 1.62/1.79 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 1.62/1.79 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 1.62/1.79 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 1.62/1.79 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.62/1.79 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.62/1.79 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.62/1.79 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.62/1.79 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 1.62/1.79 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 1.62/1.79 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.62/1.79 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.62/1.79 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 1.62/1.79 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 1.62/1.79 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 1.62/1.79 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 1.62/1.79 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 1.62/1.79 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 1.62/1.79 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 1.62/1.79 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 1.62/1.79 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 1.62/1.79 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 1.62/1.79 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 1.62/1.79 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.62/1.79 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 1.62/1.79 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 1.62/1.79 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 1.62/1.79 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 1.62/1.79 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 1.62/1.79 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.62/1.79 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.62/1.79 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 1.62/1.79 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 1.62/1.79 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 1.62/1.79 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 1.62/1.79 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 1.62/1.79 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 1.62/1.79 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 1.62/1.79 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 1.62/1.79 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.62/1.79 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.62/1.79 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.62/1.79 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 1.62/1.79 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 1.62/1.79 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 1.62/1.79 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 1.62/1.79 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 1.62/1.79 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 1.62/1.79 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 1.62/1.79 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 1.62/1.79 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 1.62/1.79 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 1.62/1.79 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 1.62/1.79 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 1.62/1.79 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 1.62/1.79 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 1.62/1.79 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 1.62/1.79 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 1.62/1.79 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 1.62/1.79 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 1.62/1.79 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 1.62/1.79 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 1.62/1.79 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 1.62/1.79 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 1.62/1.79 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 1.62/1.79 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 1.62/1.79 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 1.62/1.79 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 1.62/1.79 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 1.62/1.79 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 1.62/1.79 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 1.62/1.79 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 1.62/1.79 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 1.62/1.79 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 1.62/1.79 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 1.62/1.79 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 1.62/1.79 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 1.62/1.79 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 1.62/1.79 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 1.62/1.79 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 1.62/1.79 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 1.62/1.79 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 1.62/1.79 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 1.62/1.79 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 1.62/1.79 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 1.62/1.79 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 1.62/1.79 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 1.62/1.79 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 1.62/1.79 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 1.62/1.79 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 1.62/1.79 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 1.62/1.79 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 1.62/1.79 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 1.62/1.79 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 1.62/1.79 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 1.62/1.79 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 1.62/1.79 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 1.62/1.79 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 1.62/1.79 (assume a185 (tptp.ssList tptp.sk1))
% 1.62/1.79 (assume a186 (tptp.ssList tptp.sk2))
% 1.62/1.79 (assume a187 (tptp.ssList tptp.sk3))
% 1.62/1.79 (assume a188 (tptp.ssList tptp.sk4))
% 1.62/1.79 (assume a189 (= tptp.sk2 tptp.sk4))
% 1.62/1.79 (assume a190 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (assume a191 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app A B) tptp.sk2)) (not (= (tptp.app B A) tptp.sk1)))))
% 1.62/1.79 (assume a192 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 1.62/1.79 (assume a193 (or (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.62/1.79 (assume a194 (or (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.62/1.79 (assume a195 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.62/1.79 (assume a196 (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.62/1.79 (step t1 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule or_pos)
% 1.62/1.79 (step t2 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule contraction :premises (t1))
% 1.62/1.79 (step t3 (cl (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))))) :rule reordering :premises (t2))
% 1.62/1.79 (step t4 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule and_neg)
% 1.62/1.79 (step t5 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t6)
% 1.62/1.79 (assume t6.a0 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (assume t6.a1 (= tptp.nil tptp.sk3))
% 1.62/1.79 (assume t6.a2 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (step t6.t1 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t6.t2)
% 1.62/1.79 (assume t6.t2.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (assume t6.t2.a1 (= tptp.nil tptp.sk3))
% 1.62/1.79 (assume t6.t2.a2 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (step t6.t2.t1 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t6.t2.a2))
% 1.62/1.79 (step t6.t2.t2 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t6.t2.t1))
% 1.62/1.79 (step t6.t2.t3 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t6.t2.a1))
% 1.62/1.79 (step t6.t2.t4 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t6.t2.a0))
% 1.62/1.79 (step t6.t2.t5 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule symm :premises (t6.t2.t4))
% 1.62/1.79 (step t6.t2.t6 (cl (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule trans :premises (t6.t2.t2 t6.t2.t3 t6.t2.t5))
% 1.62/1.79 (step t6.t2 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule subproof :discharge (t6.t2.a0 t6.t2.a1 t6.t2.a2))
% 1.62/1.79 (step t6.t3 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t6.t4 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t6.t5 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t6.t6 (cl (= tptp.sk1 (tptp.app tptp.nil tptp.nil)) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t6.t2 t6.t3 t6.t4 t6.t5))
% 1.62/1.79 (step t6.t7 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule reordering :premises (t6.t6))
% 1.62/1.79 (step t6.t8 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule contraction :premises (t6.t7))
% 1.62/1.79 (step t6.t9 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t6.t1 t6.t8))
% 1.62/1.79 (step t6.t10 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule implies_neg2)
% 1.62/1.79 (step t6.t11 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t6.t9 t6.t10))
% 1.62/1.79 (step t6.t12 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule contraction :premises (t6.t11))
% 1.62/1.79 (step t6.t13 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule implies :premises (t6.t12))
% 1.62/1.79 (step t6.t14 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 1.62/1.79 (step t6.t15 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t6.t14 t6.a2 t6.a1 t6.a0))
% 1.62/1.79 (step t6.t16 (cl (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t6.t13 t6.t15))
% 1.62/1.79 (step t6 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule subproof :discharge (t6.a0 t6.a1 t6.a2))
% 1.62/1.79 (step t7 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t8 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t9 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t10 (cl (= tptp.sk1 (tptp.app tptp.nil tptp.nil)) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t6 t7 t8 t9))
% 1.62/1.79 (step t11 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule reordering :premises (t10))
% 1.62/1.79 (step t12 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule contraction :premises (t11))
% 1.62/1.79 (step t13 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t5 t12))
% 1.62/1.79 (step t14 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule implies_neg2)
% 1.62/1.79 (step t15 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t13 t14))
% 1.62/1.79 (step t16 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))) :rule contraction :premises (t15))
% 1.62/1.79 (step t17 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule implies :premises (t16))
% 1.62/1.79 (step t18 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t4 t17))
% 1.62/1.79 (step t19 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule reordering :premises (t18))
% 1.62/1.79 (step t20 (cl (not (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) (not (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)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule equiv_pos2)
% 1.62/1.79 (anchor :step t21 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.62/1.79 (step t21.t1 (cl (= U U)) :rule refl)
% 1.62/1.79 (step t21.t2 (cl (= V V)) :rule refl)
% 1.62/1.79 (step t21.t3 (cl (= (not (= tptp.nil U)) (not (= tptp.nil U)))) :rule refl)
% 1.62/1.79 (step t21.t4 (cl (= (not (= tptp.nil V)) (not (= tptp.nil V)))) :rule refl)
% 1.62/1.79 (step t21.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.62/1.79 (step t21.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.62/1.79 (step t21.t7 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 1.62/1.79 (step t21.t8 (cl (= (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V))))) :rule cong :premises (t21.t3 t21.t4 t21.t5 t21.t6 t21.t7))
% 1.62/1.79 (step t21 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))))) :rule bind)
% 1.62/1.79 (step t22 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 1.62/1.79 (step t23 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 1.62/1.79 (step t24 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t23))
% 1.62/1.79 (step t25 (cl (= (not true) false)) :rule all_simplify)
% 1.62/1.79 (step t26 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t24 t25))
% 1.62/1.79 (step t27 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 1.62/1.79 (step t28 (cl (= (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule refl)
% 1.62/1.79 (step t29 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule cong :premises (t26 t26 t27 t27 t28))
% 1.62/1.79 (step t30 (cl (= (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 1.62/1.79 (step t31 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t29 t30))
% 1.62/1.79 (step t32 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t22 t31))
% 1.62/1.79 (step t33 (cl (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t21 t32))
% 1.62/1.79 (step t34 (cl (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t20 t33 a144))
% 1.62/1.79 (step t35 (cl (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule or :premises (t34))
% 1.62/1.79 (step t36 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t35 a7))
% 1.62/1.79 (step t37 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a192))
% 1.62/1.79 (step t38 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)) :rule or_pos)
% 1.62/1.79 (step t39 (cl (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t38))
% 1.62/1.79 (step t40 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a193))
% 1.62/1.79 (step t41 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule and_neg)
% 1.62/1.79 (step t42 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t43)
% 1.62/1.79 (assume t43.a0 (= tptp.sk2 tptp.sk4))
% 1.62/1.79 (assume t43.a1 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 1.62/1.79 (step t43.t1 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t43.t2)
% 1.62/1.79 (assume t43.t2.a0 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 1.62/1.79 (assume t43.t2.a1 (= tptp.sk2 tptp.sk4))
% 1.62/1.79 (step t43.t2.t1 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t43.t2.a1))
% 1.62/1.79 (step t43.t2.t2 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t43.t2.t1))
% 1.62/1.79 (step t43.t2.t3 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4)) :rule symm :premises (t43.t2.a0))
% 1.62/1.79 (step t43.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t43.t2.t3))
% 1.62/1.79 (step t43.t2.t5 (cl (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule trans :premises (t43.t2.t2 t43.t2.t4))
% 1.62/1.79 (step t43.t2 (cl (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t43.t2.a0 t43.t2.a1))
% 1.62/1.79 (step t43.t3 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t43.t4 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t43.t5 (cl (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t43.t2 t43.t3 t43.t4))
% 1.62/1.79 (step t43.t6 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t43.t5))
% 1.62/1.79 (step t43.t7 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t43.t6))
% 1.62/1.79 (step t43.t8 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t43.t1 t43.t7))
% 1.62/1.79 (step t43.t9 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t43.t10 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t43.t8 t43.t9))
% 1.62/1.79 (step t43.t11 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t43.t10))
% 1.62/1.79 (step t43.t12 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t43.t11))
% 1.62/1.79 (step t43.t13 (cl (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 1.62/1.79 (step t43.t14 (cl (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t43.t13 t43.a1 t43.a0))
% 1.62/1.79 (step t43.t15 (cl (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t43.t12 t43.t14))
% 1.62/1.79 (step t43 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t43.a0 t43.a1))
% 1.62/1.79 (step t44 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t45 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t46 (cl (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t43 t44 t45))
% 1.62/1.79 (step t47 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t46))
% 1.62/1.79 (step t48 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t47))
% 1.62/1.79 (step t49 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t42 t48))
% 1.62/1.79 (step t50 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t51 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t49 t50))
% 1.62/1.79 (step t52 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t51))
% 1.62/1.79 (step t53 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t52))
% 1.62/1.79 (step t54 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t41 t53))
% 1.62/1.79 (step t55 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule or_pos)
% 1.62/1.79 (step t56 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule reordering :premises (t55))
% 1.62/1.79 (step t57 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t58)
% 1.62/1.79 (assume t58.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))))
% 1.62/1.79 (step t58.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B (tptp.cons tptp.sk5 tptp.nil))))
% 1.62/1.79 (step t58.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule or :premises (t58.t1))
% 1.62/1.79 (step t58.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t58.t2 t58.a0))
% 1.62/1.79 (step t58 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule subproof :discharge (t58.a0))
% 1.62/1.79 (step t59 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t57 t58))
% 1.62/1.79 (step t60 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule implies_neg2)
% 1.62/1.79 (step t61 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule resolution :premises (t59 t60))
% 1.62/1.79 (step t62 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule contraction :premises (t61))
% 1.62/1.79 (step t63 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule implies :premises (t62))
% 1.62/1.79 (step t64 (cl (not (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app A B) tptp.sk2)) (not (= (tptp.app B A) tptp.sk1)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))))) (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app A B) tptp.sk2)) (not (= (tptp.app B A) tptp.sk1))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) :rule equiv_pos2)
% 1.62/1.79 (anchor :step t65 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B)))
% 1.62/1.79 (step t65.t1 (cl (= A A)) :rule refl)
% 1.62/1.79 (step t65.t2 (cl (= B B)) :rule refl)
% 1.62/1.79 (step t65.t3 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 1.62/1.79 (step t65.t4 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 1.62/1.79 (step t65.t5 (cl (= (= (tptp.app A B) tptp.sk2) (= tptp.sk2 (tptp.app A B)))) :rule all_simplify)
% 1.62/1.79 (step t65.t6 (cl (= (not (= (tptp.app A B) tptp.sk2)) (not (= tptp.sk2 (tptp.app A B))))) :rule cong :premises (t65.t5))
% 1.62/1.79 (step t65.t7 (cl (= (= (tptp.app B A) tptp.sk1) (= tptp.sk1 (tptp.app B A)))) :rule all_simplify)
% 1.62/1.79 (step t65.t8 (cl (= (not (= (tptp.app B A) tptp.sk1)) (not (= tptp.sk1 (tptp.app B A))))) :rule cong :premises (t65.t7))
% 1.62/1.79 (step t65.t9 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app A B) tptp.sk2)) (not (= (tptp.app B A) tptp.sk1))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) :rule cong :premises (t65.t3 t65.t4 t65.t6 t65.t8))
% 1.62/1.79 (step t65 (cl (= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= (tptp.app A B) tptp.sk2)) (not (= (tptp.app B A) tptp.sk1)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))))) :rule bind)
% 1.62/1.79 (step t66 (cl (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) :rule resolution :premises (t64 t65 a191))
% 1.62/1.79 (step t67 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t63 t66))
% 1.62/1.79 (step t68 (cl (not (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 1.62/1.79 (step t69 (cl (= (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule all_simplify)
% 1.62/1.79 (step t70 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 1.62/1.79 (step t71 (cl (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t69 t70))
% 1.62/1.79 (step t72 (cl (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t68 t71 a196))
% 1.62/1.79 (step t73 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t72))
% 1.62/1.79 (step t74 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t73))
% 1.62/1.79 (step t75 (cl (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a194))
% 1.62/1.79 (step t76 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk6)) :rule reordering :premises (t75))
% 1.62/1.79 (step t77 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t54 a189 t56 t67 t74 t76))
% 1.62/1.79 (step t78 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t77))
% 1.62/1.79 (step t79 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t80)
% 1.62/1.79 (assume t80.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 1.62/1.79 (step t80.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk4)))
% 1.62/1.79 (step t80.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule or :premises (t80.t1))
% 1.62/1.79 (step t80.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t80.t2 t80.a0))
% 1.62/1.79 (step t80 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule subproof :discharge (t80.a0))
% 1.62/1.79 (step t81 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t79 t80))
% 1.62/1.79 (step t82 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 1.62/1.79 (step t83 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t81 t82))
% 1.62/1.79 (step t84 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule contraction :premises (t83))
% 1.62/1.79 (step t85 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule implies :premises (t84))
% 1.62/1.79 (step t86 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 1.62/1.79 (anchor :step t87 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.62/1.79 (step t87.t1 (cl (= U U)) :rule refl)
% 1.62/1.79 (step t87.t2 (cl (= V V)) :rule refl)
% 1.62/1.79 (step t87.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.62/1.79 (step t87.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.62/1.79 (step t87.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 1.62/1.79 (step t87.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 1.62/1.79 (step t87.t7 (cl (= (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule cong :premises (t87.t3 t87.t4 t87.t5 t87.t6))
% 1.62/1.79 (step t87 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 1.62/1.79 (step t88 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t86 t87 a99))
% 1.62/1.79 (step t89 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t85 t88))
% 1.62/1.79 (step t90 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a192))
% 1.62/1.79 (step t91 (cl (not (= (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk3))))) (not (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 1.62/1.79 (step t92 (cl (= (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule refl)
% 1.62/1.79 (step t93 (cl (= (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true) (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule equiv_simplify)
% 1.62/1.79 (step t94 (cl (not (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true)) (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule equiv1 :premises (t93))
% 1.62/1.79 (step t95 (cl (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))))) :rule all_simplify)
% 1.62/1.79 (step t96 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule refl)
% 1.62/1.79 (step t97 (cl (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 1.62/1.79 (step t98 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule cong :premises (t96 t97))
% 1.62/1.79 (step t99 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true)) :rule all_simplify)
% 1.62/1.79 (step t100 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) true)) :rule trans :premises (t98 t99))
% 1.62/1.79 (step t101 (cl (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true)) :rule trans :premises (t95 t100))
% 1.62/1.79 (step t102 (cl (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t94 t101))
% 1.62/1.79 (step t103 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 1.62/1.79 (step t104 (cl (= (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk3))))) :rule cong :premises (t92 t102 t103))
% 1.62/1.79 (step t105 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule and_neg)
% 1.62/1.79 (step t106 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t107)
% 1.62/1.79 (assume t107.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 1.62/1.79 (assume t107.a1 (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 1.62/1.79 (step t107.t1 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3))) (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t107.t2)
% 1.62/1.79 (assume t107.t2.a0 (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 1.62/1.79 (assume t107.t2.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 1.62/1.79 (step t107.t2.t1 (cl (= (= (= tptp.nil tptp.sk3) false) (not (= tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 1.62/1.79 (step t107.t2.t2 (cl (not (= (= tptp.nil tptp.sk3) false)) (not (= tptp.nil tptp.sk3))) :rule equiv1 :premises (t107.t2.t1))
% 1.62/1.79 (step t107.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.62/1.79 (step t107.t2.t4 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t107.t2.a1))
% 1.62/1.79 (step t107.t2.t5 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t107.t2.t4))
% 1.62/1.79 (step t107.t2.t6 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t107.t2.t3 t107.t2.t5))
% 1.62/1.79 (step t107.t2.t7 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule equiv_simplify)
% 1.62/1.79 (step t107.t2.t8 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule equiv2 :premises (t107.t2.t7))
% 1.62/1.79 (step t107.t2.t9 (cl (not (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule not_not)
% 1.62/1.79 (step t107.t2.t10 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t107.t2.t8 t107.t2.t9))
% 1.62/1.79 (step t107.t2.t11 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false)) :rule resolution :premises (t107.t2.t10 t107.t2.a0))
% 1.62/1.79 (step t107.t2.t12 (cl (= (= tptp.nil tptp.sk3) false)) :rule trans :premises (t107.t2.t6 t107.t2.t11))
% 1.62/1.79 (step t107.t2.t13 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t107.t2.t2 t107.t2.t12))
% 1.62/1.79 (step t107.t2 (cl (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t107.t2.a0 t107.t2.a1))
% 1.62/1.79 (step t107.t3 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 1.62/1.79 (step t107.t4 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 1.62/1.79 (step t107.t5 (cl (not (= tptp.nil tptp.sk3)) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t107.t2 t107.t3 t107.t4))
% 1.62/1.79 (step t107.t6 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t107.t5))
% 1.62/1.79 (step t107.t7 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t107.t6))
% 1.62/1.79 (step t107.t8 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t107.t1 t107.t7))
% 1.62/1.79 (step t107.t9 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 1.62/1.79 (step t107.t10 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3))) (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t107.t8 t107.t9))
% 1.62/1.79 (step t107.t11 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t107.t10))
% 1.62/1.79 (step t107.t12 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t107.t11))
% 1.62/1.79 (step t107.t13 (cl (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_neg)
% 1.62/1.79 (step t107.t14 (cl (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t107.t13 t107.a1 t107.a0))
% 1.62/1.79 (step t107.t15 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t107.t12 t107.t14))
% 1.62/1.79 (step t107 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t107.a0 t107.a1))
% 1.62/1.79 (step t108 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 1.62/1.79 (step t109 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 1.62/1.79 (step t110 (cl (not (= tptp.nil tptp.sk3)) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule resolution :premises (t107 t108 t109))
% 1.62/1.79 (step t111 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t110))
% 1.62/1.79 (step t112 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t111))
% 1.62/1.79 (step t113 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t106 t112))
% 1.62/1.79 (step t114 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 1.62/1.79 (step t115 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t113 t114))
% 1.62/1.79 (step t116 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t115))
% 1.62/1.79 (step t117 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t116))
% 1.62/1.79 (step t118 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t105 t117))
% 1.62/1.79 (step t119 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule or_neg)
% 1.62/1.79 (step t120 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (not (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule or_neg)
% 1.62/1.79 (step t121 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 1.62/1.79 (step t122 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t118 t119 t120 t121))
% 1.62/1.79 (step t123 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t122))
% 1.62/1.79 (step t124 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t91 t104 t123))
% 1.62/1.79 (step t125 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk3))) :rule or :premises (t124))
% 1.62/1.79 (step t126 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t125))
% 1.62/1.79 (step t127 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_neg)
% 1.62/1.79 (step t128 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t129)
% 1.62/1.79 (assume t129.a0 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (assume t129.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 1.62/1.79 (step t129.t1 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t129.t2)
% 1.62/1.79 (assume t129.t2.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 1.62/1.79 (assume t129.t2.a1 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (step t129.t2.t1 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t129.t2.a1))
% 1.62/1.79 (step t129.t2.t2 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t129.t2.t1))
% 1.62/1.79 (step t129.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t129.t2.a0))
% 1.62/1.79 (step t129.t2.t4 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t129.t2.t3))
% 1.62/1.79 (step t129.t2.t5 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t129.t2.t2 t129.t2.t4))
% 1.62/1.79 (step t129.t2 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t129.t2.a0 t129.t2.a1))
% 1.62/1.79 (step t129.t3 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 1.62/1.79 (step t129.t4 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t129.t5 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t129.t2 t129.t3 t129.t4))
% 1.62/1.79 (step t129.t6 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t129.t5))
% 1.62/1.79 (step t129.t7 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t129.t6))
% 1.62/1.79 (step t129.t8 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t129.t1 t129.t7))
% 1.62/1.79 (step t129.t9 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 1.62/1.79 (step t129.t10 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t129.t8 t129.t9))
% 1.62/1.79 (step t129.t11 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t129.t10))
% 1.62/1.79 (step t129.t12 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t129.t11))
% 1.62/1.79 (step t129.t13 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 1.62/1.79 (step t129.t14 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t129.t13 t129.a1 t129.a0))
% 1.62/1.79 (step t129.t15 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t129.t12 t129.t14))
% 1.62/1.79 (step t129 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t129.a0 t129.a1))
% 1.62/1.79 (step t130 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t131 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 1.62/1.79 (step t132 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t129 t130 t131))
% 1.62/1.79 (step t133 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t132))
% 1.62/1.79 (step t134 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t133))
% 1.62/1.79 (step t135 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t128 t134))
% 1.62/1.79 (step t136 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 1.62/1.79 (step t137 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t135 t136))
% 1.62/1.79 (step t138 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t137))
% 1.62/1.79 (step t139 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t138))
% 1.62/1.79 (step t140 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t127 t139))
% 1.62/1.79 (step t141 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t78 t39 t89 a188 a7 t90 t126 t140 a190))
% 1.62/1.79 (step t142 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t141))
% 1.62/1.79 (step t143 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t142))
% 1.62/1.79 (step t144 (cl (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 1.62/1.79 (step t145 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t144))
% 1.62/1.79 (step t146 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t147)
% 1.62/1.79 (assume t147.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.62/1.79 (step t147.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk6)))
% 1.62/1.79 (step t147.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t147.t1))
% 1.62/1.79 (step t147.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t147.t2 t147.a0))
% 1.62/1.79 (step t147 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t147.a0))
% 1.62/1.79 (step t148 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t146 t147))
% 1.62/1.79 (step t149 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t150 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t148 t149))
% 1.62/1.79 (step t151 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t150))
% 1.62/1.79 (step t152 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t151))
% 1.62/1.79 (step t153 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 1.62/1.79 (anchor :step t154 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.62/1.79 (step t154.t1 (cl (= U U)) :rule refl)
% 1.62/1.79 (step t154.t2 (cl (= V V)) :rule refl)
% 1.62/1.79 (step t154.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 1.62/1.79 (step t154.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t154.t3))
% 1.62/1.79 (step t154.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.62/1.79 (step t154.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.62/1.79 (step t154.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 1.62/1.79 (step t154.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t154.t4 t154.t5 t154.t6 t154.t7))
% 1.62/1.79 (step t154 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 1.62/1.79 (step t155 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t153 t154 a117))
% 1.62/1.79 (step t156 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t152 t155))
% 1.62/1.79 (step t157 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 1.62/1.79 (step t158 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 1.62/1.79 (step t159 (cl (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t158 t70))
% 1.62/1.79 (step t160 (cl (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t157 t159 a195))
% 1.62/1.79 (step t161 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t160))
% 1.62/1.79 (step t162 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t161))
% 1.62/1.79 (step t163 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t143 t145 t156 t162 t76))
% 1.62/1.79 (step t164 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t163))
% 1.62/1.79 (step t165 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a192))
% 1.62/1.79 (step t166 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule equiv_pos2)
% 1.62/1.79 (step t167 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 1.62/1.79 (step t168 (cl (= (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule refl)
% 1.62/1.79 (step t169 (cl (= (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule refl)
% 1.62/1.79 (step t170 (cl (= (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) true) (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule equiv_simplify)
% 1.62/1.79 (step t171 (cl (not (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) true)) (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule equiv1 :premises (t170))
% 1.62/1.79 (step t172 (cl (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) :rule all_simplify)
% 1.62/1.79 (step t173 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule refl)
% 1.62/1.79 (step t174 (cl (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule all_simplify)
% 1.62/1.79 (step t175 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule cong :premises (t173 t174))
% 1.62/1.79 (step t176 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) true)) :rule all_simplify)
% 1.62/1.79 (step t177 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) true)) :rule trans :premises (t175 t176))
% 1.62/1.79 (step t178 (cl (= (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) true)) :rule trans :premises (t172 t177))
% 1.62/1.79 (step t179 (cl (= (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t171 t178))
% 1.62/1.79 (step t180 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule cong :premises (t167 t103 t168 t169 t179))
% 1.62/1.79 (step t181 (cl (not (= (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) (not (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule equiv_pos2)
% 1.62/1.79 (step t182 (cl (= (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule refl)
% 1.62/1.79 (step t183 (cl (= (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) :rule equiv_simplify)
% 1.62/1.79 (step t184 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (not (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) :rule equiv2 :premises (t183))
% 1.62/1.79 (step t185 (cl (not (not (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule not_not)
% 1.62/1.79 (step t186 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t184 t185))
% 1.62/1.79 (step t187 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t188)
% 1.62/1.79 (assume t188.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (assume t188.a1 (= tptp.nil tptp.sk3))
% 1.62/1.79 (assume t188.a2 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (assume t188.a3 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t188.a4 (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))
% 1.62/1.79 (step t188.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 1.62/1.79 (step t188.t2 (cl (= (= false true) false)) :rule all_simplify)
% 1.62/1.79 (step t188.t3 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) false) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule equiv_simplify)
% 1.62/1.79 (step t188.t4 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) false) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule equiv2 :premises (t188.t3))
% 1.62/1.79 (step t188.t5 (cl (not (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule not_not)
% 1.62/1.79 (step t188.t6 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) false) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t188.t4 t188.t5))
% 1.62/1.79 (step t188.t7 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) false)) :rule resolution :premises (t188.t6 t188.a4))
% 1.62/1.79 (step t188.t8 (cl (= false (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule symm :premises (t188.t7))
% 1.62/1.79 (step t188.t9 (cl (= (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) true) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule equiv_simplify)
% 1.62/1.79 (step t188.t10 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) true) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule equiv2 :premises (t188.t9))
% 1.62/1.79 (step t188.t11 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t188.a2))
% 1.62/1.79 (step t188.t12 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t188.t11))
% 1.62/1.79 (step t188.t13 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t188.a1))
% 1.62/1.79 (step t188.t14 (cl (= tptp.sk1 tptp.nil)) :rule trans :premises (t188.t12 t188.t13))
% 1.62/1.79 (step t188.t15 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t188.a0))
% 1.62/1.79 (step t188.t16 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule symm :premises (t188.t15))
% 1.62/1.79 (step t188.t17 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.nil)) :rule symm :premises (t188.a3))
% 1.62/1.79 (step t188.t18 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.app tptp.nil tptp.nil))) :rule trans :premises (t188.t17 t188.t16))
% 1.62/1.79 (step t188.t19 (cl (= (tptp.app tptp.nil tptp.nil) (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule symm :premises (t188.t18))
% 1.62/1.79 (step t188.t20 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule trans :premises (t188.t14 t188.t16 t188.t19))
% 1.62/1.79 (step t188.t21 (cl (= (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) true)) :rule resolution :premises (t188.t10 t188.t20))
% 1.62/1.79 (step t188.t22 (cl (= false true)) :rule trans :premises (t188.t8 t188.t21))
% 1.62/1.79 (step t188.t23 (cl false) :rule resolution :premises (t188.t1 t188.t2 t188.t22))
% 1.62/1.79 (step t188 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) :rule subproof :discharge (t188.a0 t188.a1 t188.a2 t188.a3 t188.a4))
% 1.62/1.79 (step t189 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t190 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t191 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t192 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t193 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule and_pos)
% 1.62/1.79 (step t194 (cl false (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule resolution :premises (t188 t189 t190 t191 t192 t193))
% 1.62/1.79 (step t195 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) false) :rule reordering :premises (t194))
% 1.62/1.79 (step t196 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) false) :rule contraction :premises (t195))
% 1.62/1.79 (step t197 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) false) :rule resolution :premises (t187 t196))
% 1.62/1.79 (step t198 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (not false)) :rule implies_neg2)
% 1.62/1.79 (step t199 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false)) :rule resolution :premises (t197 t198))
% 1.62/1.79 (step t200 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false)) :rule contraction :premises (t199))
% 1.62/1.79 (step t201 (cl (= (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) :rule implies_simplify)
% 1.62/1.79 (step t202 (cl (not (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false)) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule equiv1 :premises (t201))
% 1.62/1.79 (step t203 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule resolution :premises (t200 t202))
% 1.62/1.79 (step t204 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false)) :rule resolution :premises (t186 t203))
% 1.62/1.79 (step t205 (cl (= (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false))) :rule cong :premises (t182 t204))
% 1.62/1.79 (step t206 (cl (= (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) false) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) :rule all_simplify)
% 1.62/1.79 (step t207 (cl (= (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))))) :rule trans :premises (t205 t206))
% 1.62/1.79 (step t208 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t209)
% 1.62/1.79 (assume t209.a0 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (assume t209.a1 (= tptp.nil tptp.sk3))
% 1.62/1.79 (assume t209.a2 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (assume t209.a3 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t209.a4 (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))
% 1.62/1.79 (step t209.t1 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule and_neg)
% 1.62/1.79 (step t209.t2 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t209.t1 t209.a2 t209.a1 t209.a0 t209.a3 t209.a4))
% 1.62/1.79 (step t209 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule subproof :discharge (t209.a0 t209.a1 t209.a2 t209.a3 t209.a4))
% 1.62/1.79 (step t210 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t211 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t212 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t213 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t214 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule and_pos)
% 1.62/1.79 (step t215 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule resolution :premises (t209 t210 t211 t212 t213 t214))
% 1.62/1.79 (step t216 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule reordering :premises (t215))
% 1.62/1.79 (step t217 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule contraction :premises (t216))
% 1.62/1.79 (step t218 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t208 t217))
% 1.62/1.79 (step t219 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule implies_neg2)
% 1.62/1.79 (step t220 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule resolution :premises (t218 t219))
% 1.62/1.79 (step t221 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk3) (= tptp.sk1 tptp.sk3) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule contraction :premises (t220))
% 1.62/1.79 (step t222 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk3) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule resolution :premises (t181 t207 t221))
% 1.62/1.79 (step t223 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule not_and :premises (t222))
% 1.62/1.79 (step t224 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 1.62/1.79 (step t225 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 1.62/1.79 (step t226 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule or_neg)
% 1.62/1.79 (step t227 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule or_neg)
% 1.62/1.79 (step t228 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule or_neg)
% 1.62/1.79 (step t229 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule resolution :premises (t223 t224 t225 t226 t227 t228))
% 1.62/1.79 (step t230 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule contraction :premises (t229))
% 1.62/1.79 (step t231 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t166 t180 t230))
% 1.62/1.79 (step t232 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule or :premises (t231))
% 1.62/1.79 (step t233 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule reordering :premises (t232))
% 1.62/1.79 (step t234 (cl (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule or_pos)
% 1.62/1.79 (step t235 (cl (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule contraction :premises (t234))
% 1.62/1.79 (step t236 (cl (not (tptp.ssList tptp.nil)) (not (tptp.segmentP tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule reordering :premises (t235))
% 1.62/1.79 (step t237 (cl (not (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) (not (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U)))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil))) :rule equiv_pos2)
% 1.62/1.79 (step t238 (cl (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule all_simplify)
% 1.62/1.79 (step t239 (cl (= (tptp.segmentP tptp.nil tptp.nil) (tptp.segmentP tptp.nil tptp.nil))) :rule refl)
% 1.62/1.79 (step t240 (cl (= (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or false (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule cong :premises (t26 t27 t239))
% 1.62/1.79 (step t241 (cl (= (or false (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule all_simplify)
% 1.62/1.79 (step t242 (cl (= (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule trans :premises (t240 t241))
% 1.62/1.79 (step t243 (cl (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule trans :premises (t238 t242))
% 1.62/1.79 (step t244 (cl (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil))) :rule resolution :premises (t237 t243 a78))
% 1.62/1.79 (step t245 (cl (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) :rule or :premises (t244))
% 1.62/1.79 (step t246 (cl (tptp.segmentP tptp.nil tptp.nil)) :rule resolution :premises (t245 a7))
% 1.62/1.79 (step t247 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t248)
% 1.62/1.79 (assume t248.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))
% 1.62/1.79 (step t248.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 1.62/1.79 (step t248.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule or :premises (t248.t1))
% 1.62/1.79 (step t248.t3 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t248.t2 t248.a0))
% 1.62/1.79 (step t248 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule subproof :discharge (t248.a0))
% 1.62/1.79 (step t249 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t247 t248))
% 1.62/1.79 (step t250 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule implies_neg2)
% 1.62/1.79 (step t251 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t249 t250))
% 1.62/1.79 (step t252 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule contraction :premises (t251))
% 1.62/1.79 (step t253 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies :premises (t252))
% 1.62/1.79 (step t254 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule equiv_pos2)
% 1.62/1.79 (anchor :step t255 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.62/1.79 (step t255.t1 (cl (= U U)) :rule refl)
% 1.62/1.79 (step t255.t2 (cl (= V V)) :rule refl)
% 1.62/1.79 (step t255.t3 (cl (= (not (tptp.segmentP U V)) (not (tptp.segmentP U V)))) :rule refl)
% 1.62/1.79 (step t255.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.62/1.79 (step t255.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.62/1.79 (step t255.t6 (cl (= (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) :rule all_simplify)
% 1.62/1.79 (step t255.t7 (cl (= (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)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule cong :premises (t255.t3 t255.t4 t255.t5 t255.t6))
% 1.62/1.79 (step t255 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))) :rule bind)
% 1.62/1.79 (step t256 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule resolution :premises (t254 t255 a167))
% 1.62/1.79 (step t257 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t253 t256))
% 1.62/1.79 (step t258 (cl (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t236 a7 t246 t257))
% 1.62/1.79 (step t259 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule and_neg)
% 1.62/1.79 (step t260 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t261)
% 1.62/1.79 (assume t261.a0 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (assume t261.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 1.62/1.79 (assume t261.a2 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t261.a3 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (step t261.t1 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t261.t2)
% 1.62/1.79 (assume t261.t2.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 1.62/1.79 (assume t261.t2.a1 (= tptp.sk1 tptp.sk3))
% 1.62/1.79 (assume t261.t2.a2 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t261.t2.a3 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (step t261.t2.t1 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.nil)) :rule symm :premises (t261.t2.a3))
% 1.62/1.79 (step t261.t2.t2 (cl (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule symm :premises (t261.t2.t1))
% 1.62/1.79 (step t261.t2.t3 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk1)) :rule symm :premises (t261.t2.a2))
% 1.62/1.79 (step t261.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t261.t2.a1))
% 1.62/1.79 (step t261.t2.t5 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t261.t2.t4))
% 1.62/1.79 (step t261.t2.t6 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t261.t2.a0))
% 1.62/1.79 (step t261.t2.t7 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t261.t2.t6))
% 1.62/1.79 (step t261.t2.t8 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t261.t2.t2 t261.t2.t3 t261.t2.t5 t261.t2.t7))
% 1.62/1.79 (step t261.t2 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t261.t2.a0 t261.t2.a1 t261.t2.a2 t261.t2.a3))
% 1.62/1.79 (step t261.t3 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 1.62/1.79 (step t261.t4 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t261.t5 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t261.t6 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t261.t7 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t261.t2 t261.t3 t261.t4 t261.t5 t261.t6))
% 1.62/1.79 (step t261.t8 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t261.t7))
% 1.62/1.79 (step t261.t9 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t261.t8))
% 1.62/1.79 (step t261.t10 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t261.t1 t261.t9))
% 1.62/1.79 (step t261.t11 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 1.62/1.79 (step t261.t12 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t261.t10 t261.t11))
% 1.62/1.79 (step t261.t13 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t261.t12))
% 1.62/1.79 (step t261.t14 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t261.t13))
% 1.62/1.79 (step t261.t15 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule and_neg)
% 1.62/1.79 (step t261.t16 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t261.t15 t261.a1 t261.a0 t261.a3 t261.a2))
% 1.62/1.79 (step t261.t17 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t261.t14 t261.t16))
% 1.62/1.79 (step t261 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t261.a0 t261.a1 t261.a2 t261.a3))
% 1.62/1.79 (step t262 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.62/1.79 (step t263 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 1.62/1.79 (step t264 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t265 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t266 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t261 t262 t263 t264 t265))
% 1.62/1.79 (step t267 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t266))
% 1.62/1.79 (step t268 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t267))
% 1.62/1.79 (step t269 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t260 t268))
% 1.62/1.79 (step t270 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 1.62/1.79 (step t271 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t269 t270))
% 1.62/1.79 (step t272 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t271))
% 1.62/1.79 (step t273 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t272))
% 1.62/1.79 (step t274 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t259 t273))
% 1.62/1.79 (step t275 (cl (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t274 t258 a190 t145 t156 t162 t76))
% 1.62/1.79 (step t276 (cl (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t275))
% 1.62/1.79 (step t277 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule equiv_pos2)
% 1.62/1.79 (step t278 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 1.62/1.79 (step t279 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 1.62/1.79 (step t280 (cl (= (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule refl)
% 1.62/1.79 (step t281 (cl (= (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule refl)
% 1.62/1.79 (step t282 (cl (= (= (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) true) (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule equiv_simplify)
% 1.62/1.79 (step t283 (cl (not (= (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) true)) (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule equiv1 :premises (t282))
% 1.62/1.79 (step t284 (cl (= (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))))) :rule all_simplify)
% 1.62/1.79 (step t285 (cl (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule refl)
% 1.62/1.79 (step t286 (cl (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule all_simplify)
% 1.62/1.79 (step t287 (cl (= (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule cong :premises (t285 t286))
% 1.62/1.79 (step t288 (cl (= (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) true)) :rule all_simplify)
% 1.62/1.79 (step t289 (cl (= (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) true)) :rule trans :premises (t287 t288))
% 1.62/1.79 (step t290 (cl (= (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) true)) :rule trans :premises (t284 t289))
% 1.62/1.79 (step t291 (cl (= (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule resolution :premises (t283 t290))
% 1.62/1.79 (step t292 (cl (= (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule refl)
% 1.62/1.79 (step t293 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule cong :premises (t278 t279 t168 t169 t280 t281 t291 t292))
% 1.62/1.79 (step t294 (cl (not (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) (not (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule equiv_pos2)
% 1.62/1.79 (step t295 (cl (= (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule refl)
% 1.62/1.79 (step t296 (cl (= (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))))) :rule equiv_simplify)
% 1.62/1.79 (step t297 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) (not (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))))) :rule equiv2 :premises (t296))
% 1.62/1.79 (step t298 (cl (not (not (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule not_not)
% 1.62/1.79 (step t299 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule resolution :premises (t297 t298))
% 1.62/1.79 (step t300 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t301)
% 1.62/1.79 (assume t301.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (assume t301.a1 (= tptp.nil tptp.sk4))
% 1.62/1.79 (assume t301.a2 (= tptp.sk2 tptp.sk4))
% 1.62/1.79 (assume t301.a3 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t301.a4 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t301.a5 (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))
% 1.62/1.79 (assume t301.a6 (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))
% 1.62/1.79 (step t301.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 1.62/1.79 (step t301.t2 (cl (= (= false true) false)) :rule all_simplify)
% 1.62/1.79 (step t301.t3 (cl (= (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) false) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule equiv_simplify)
% 1.62/1.79 (step t301.t4 (cl (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) false) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule equiv2 :premises (t301.t3))
% 1.62/1.79 (step t301.t5 (cl (not (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule not_not)
% 1.62/1.79 (step t301.t6 (cl (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) false) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t301.t4 t301.t5))
% 1.62/1.79 (step t301.t7 (cl (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) false)) :rule resolution :premises (t301.t6 t301.a6))
% 1.62/1.79 (step t301.t8 (cl (= false (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule symm :premises (t301.t7))
% 1.62/1.79 (step t301.t9 (cl (= (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) true) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule equiv_simplify)
% 1.62/1.79 (step t301.t10 (cl (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) true) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule equiv2 :premises (t301.t9))
% 1.62/1.79 (step t301.t11 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t301.a2))
% 1.62/1.79 (step t301.t12 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t301.t11))
% 1.62/1.79 (step t301.t13 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t301.a1))
% 1.62/1.79 (step t301.t14 (cl (= tptp.sk2 tptp.nil)) :rule trans :premises (t301.t12 t301.t13))
% 1.62/1.79 (step t301.t15 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t301.a0))
% 1.62/1.79 (step t301.t16 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule symm :premises (t301.t15))
% 1.62/1.79 (step t301.t17 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.nil)) :rule symm :premises (t301.a3))
% 1.62/1.79 (step t301.t18 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.app tptp.nil tptp.nil))) :rule trans :premises (t301.t17 t301.t16))
% 1.62/1.79 (step t301.t19 (cl (= (tptp.app tptp.nil tptp.nil) (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule symm :premises (t301.t18))
% 1.62/1.79 (step t301.t20 (cl (= (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) tptp.sk1)) :rule symm :premises (t301.a5))
% 1.62/1.79 (step t301.t21 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk1)) :rule symm :premises (t301.a4))
% 1.62/1.79 (step t301.t22 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule symm :premises (t301.t21))
% 1.62/1.79 (step t301.t23 (cl (= (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule trans :premises (t301.t20 t301.t22))
% 1.62/1.79 (step t301.t24 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule symm :premises (t301.t23))
% 1.62/1.79 (step t301.t25 (cl (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule trans :premises (t301.t14 t301.t16 t301.t19 t301.t24))
% 1.62/1.79 (step t301.t26 (cl (= (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) true)) :rule resolution :premises (t301.t10 t301.t25))
% 1.62/1.79 (step t301.t27 (cl (= false true)) :rule trans :premises (t301.t8 t301.t26))
% 1.62/1.79 (step t301.t28 (cl false) :rule resolution :premises (t301.t1 t301.t2 t301.t27))
% 1.62/1.79 (step t301 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) :rule subproof :discharge (t301.a0 t301.a1 t301.a2 t301.a3 t301.a4 t301.a5 t301.a6))
% 1.62/1.79 (step t302 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t303 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t304 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t305 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t306 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t307 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t308 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule and_pos)
% 1.62/1.79 (step t309 (cl false (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) :rule resolution :premises (t301 t302 t303 t304 t305 t306 t307 t308))
% 1.62/1.79 (step t310 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) false) :rule reordering :premises (t309))
% 1.62/1.79 (step t311 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) false) :rule contraction :premises (t310))
% 1.62/1.79 (step t312 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) false) :rule resolution :premises (t300 t311))
% 1.62/1.79 (step t313 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) (not false)) :rule implies_neg2)
% 1.62/1.79 (step t314 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false)) :rule resolution :premises (t312 t313))
% 1.62/1.79 (step t315 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false)) :rule contraction :premises (t314))
% 1.62/1.79 (step t316 (cl (= (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))))) :rule implies_simplify)
% 1.62/1.79 (step t317 (cl (not (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false)) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) :rule equiv1 :premises (t316))
% 1.62/1.79 (step t318 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) :rule resolution :premises (t315 t317))
% 1.62/1.79 (step t319 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) false)) :rule resolution :premises (t299 t318))
% 1.62/1.79 (step t320 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) false))) :rule cong :premises (t295 t319))
% 1.62/1.79 (step t321 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) false) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule all_simplify)
% 1.62/1.79 (step t322 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule trans :premises (t320 t321))
% 1.62/1.79 (step t323 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t324)
% 1.62/1.79 (assume t324.a0 (= tptp.sk2 tptp.sk4))
% 1.62/1.79 (assume t324.a1 (= tptp.nil tptp.sk4))
% 1.62/1.79 (assume t324.a2 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (assume t324.a3 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t324.a4 (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))
% 1.62/1.79 (assume t324.a5 (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))
% 1.62/1.79 (assume t324.a6 (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))
% 1.62/1.79 (assume t324.a7 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (step t324.t1 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule and_neg)
% 1.62/1.79 (step t324.t2 (cl (=> (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t324.t3)
% 1.62/1.79 (assume t324.t3.a0 (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))
% 1.62/1.79 (assume t324.t3.a1 (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))
% 1.62/1.79 (assume t324.t3.a2 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (assume t324.t3.a3 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (assume t324.t3.a4 (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (step t324.t3.t1 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk1)) :rule symm :premises (t324.t3.a4))
% 1.62/1.79 (step t324.t3.t2 (cl (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule symm :premises (t324.t3.t1))
% 1.62/1.79 (step t324.t3.t3 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.nil)) :rule symm :premises (t324.t3.a3))
% 1.62/1.79 (step t324.t3.t4 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t324.t3.a2))
% 1.62/1.79 (step t324.t3.t5 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule symm :premises (t324.t3.t4))
% 1.62/1.79 (step t324.t3.t6 (cl (= (tptp.skaf48 tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t324.t3.a1))
% 1.62/1.79 (step t324.t3.t7 (cl (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule symm :premises (t324.t3.t6))
% 1.62/1.79 (step t324.t3.t8 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.62/1.79 (step t324.t3.t9 (cl (= (tptp.app tptp.nil tptp.nil) (tptp.app (tptp.skaf48 tptp.nil tptp.nil) tptp.nil))) :rule cong :premises (t324.t3.t7 t324.t3.t8))
% 1.62/1.79 (step t324.t3.t10 (cl (= (tptp.skaf48 tptp.nil tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) :rule refl)
% 1.62/1.79 (step t324.t3.t11 (cl (= (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) tptp.nil)) :rule symm :premises (t324.t3.a0))
% 1.62/1.79 (step t324.t3.t12 (cl (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule symm :premises (t324.t3.t11))
% 1.62/1.79 (step t324.t3.t13 (cl (= (tptp.app (tptp.skaf48 tptp.nil tptp.nil) tptp.nil) (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule cong :premises (t324.t3.t10 t324.t3.t12))
% 1.62/1.79 (step t324.t3.t14 (cl (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule trans :premises (t324.t3.t2 t324.t3.t3 t324.t3.t5 t324.t3.t9 t324.t3.t13))
% 1.62/1.79 (step t324.t3 (cl (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule subproof :discharge (t324.t3.a0 t324.t3.a1 t324.t3.a2 t324.t3.a3 t324.t3.a4))
% 1.62/1.79 (step t324.t4 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t324.t5 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t324.t6 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t324.t7 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t324.t8 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t324.t9 (cl (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t324.t3 t324.t4 t324.t5 t324.t6 t324.t7 t324.t8))
% 1.62/1.79 (step t324.t10 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule reordering :premises (t324.t9))
% 1.62/1.79 (step t324.t11 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule contraction :premises (t324.t10))
% 1.62/1.79 (step t324.t12 (cl (=> (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t324.t2 t324.t11))
% 1.62/1.79 (step t324.t13 (cl (=> (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t324.t14 (cl (=> (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (=> (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule resolution :premises (t324.t12 t324.t13))
% 1.62/1.79 (step t324.t15 (cl (=> (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule contraction :premises (t324.t14))
% 1.62/1.79 (step t324.t16 (cl (not (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule implies :premises (t324.t15))
% 1.62/1.79 (step t324.t17 (cl (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule and_neg)
% 1.62/1.79 (step t324.t18 (cl (and (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t324.t17 t324.a4 t324.a5 t324.a2 t324.a3 t324.a7))
% 1.62/1.79 (step t324.t19 (cl (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t324.t16 t324.t18))
% 1.62/1.79 (step t324.t20 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule resolution :premises (t324.t1 t324.a2 t324.a1 t324.a0 t324.a3 t324.a7 t324.t19 t324.a6))
% 1.62/1.79 (step t324 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule subproof :discharge (t324.a0 t324.a1 t324.a2 t324.a3 t324.a4 t324.a5 t324.a6 t324.a7))
% 1.62/1.79 (step t325 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t326 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t327 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t328 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t329 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t330 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t331 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule and_pos)
% 1.62/1.79 (step t332 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 1.62/1.79 (step t333 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t324 t325 t326 t327 t328 t329 t330 t331 t332))
% 1.62/1.79 (step t334 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule reordering :premises (t333))
% 1.62/1.79 (step t335 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule contraction :premises (t334))
% 1.62/1.79 (step t336 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) :rule resolution :premises (t323 t335))
% 1.62/1.79 (step t337 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) :rule implies_neg2)
% 1.62/1.79 (step t338 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) :rule resolution :premises (t336 t337))
% 1.62/1.79 (step t339 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk1 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) :rule contraction :premises (t338))
% 1.62/1.79 (step t340 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t294 t322 t339))
% 1.62/1.79 (step t341 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule not_and :premises (t340))
% 1.62/1.79 (step t342 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 1.62/1.79 (step t343 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 1.62/1.79 (step t344 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule or_neg)
% 1.62/1.79 (step t345 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule or_neg)
% 1.62/1.79 (step t346 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule or_neg)
% 1.62/1.79 (step t347 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule or_neg)
% 1.62/1.79 (step t348 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))))) :rule or_neg)
% 1.62/1.79 (step t349 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule or_neg)
% 1.62/1.79 (step t350 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t341 t342 t343 t344 t345 t346 t347 t348 t349))
% 1.62/1.79 (step t351 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule contraction :premises (t350))
% 1.62/1.79 (step t352 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t277 t293 t351))
% 1.62/1.79 (step t353 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule or :premises (t352))
% 1.62/1.79 (step t354 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule reordering :premises (t353))
% 1.62/1.79 (step t355 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule or_pos)
% 1.62/1.79 (step t356 (cl (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule reordering :premises (t355))
% 1.62/1.79 (step t357 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t358)
% 1.62/1.79 (assume t358.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 1.62/1.79 (step t358.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 1.62/1.79 (step t358.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule or :premises (t358.t1))
% 1.62/1.79 (step t358.t3 (cl (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t358.t2 t358.a0))
% 1.62/1.79 (step t358 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule subproof :discharge (t358.a0))
% 1.62/1.79 (step t359 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t357 t358))
% 1.62/1.79 (step t360 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule implies_neg2)
% 1.62/1.79 (step t361 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t359 t360))
% 1.62/1.79 (step t362 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule contraction :premises (t361))
% 1.62/1.79 (step t363 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule implies :premises (t362))
% 1.62/1.79 (step t364 (cl (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t363 a47))
% 1.62/1.79 (step t365 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule or_pos)
% 1.62/1.79 (step t366 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule reordering :premises (t365))
% 1.62/1.79 (step t367 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t368)
% 1.62/1.79 (assume t368.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 1.62/1.79 (step t368.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 1.62/1.79 (step t368.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule or :premises (t368.t1))
% 1.62/1.79 (step t368.t3 (cl (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t368.t2 t368.a0))
% 1.62/1.79 (step t368 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule subproof :discharge (t368.a0))
% 1.62/1.79 (step t369 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t367 t368))
% 1.62/1.79 (step t370 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule implies_neg2)
% 1.62/1.79 (step t371 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule resolution :premises (t369 t370))
% 1.62/1.79 (step t372 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule contraction :premises (t371))
% 1.62/1.79 (step t373 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule implies :premises (t372))
% 1.62/1.79 (step t374 (cl (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t373 a48))
% 1.62/1.79 (step t375 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t376)
% 1.62/1.79 (assume t376.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 1.62/1.79 (step t376.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= U tptp.nil) (:= V (tptp.skaf47 tptp.nil tptp.nil))))
% 1.62/1.79 (step t376.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule or :premises (t376.t1))
% 1.62/1.79 (step t376.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t376.t2 t376.a0))
% 1.62/1.79 (step t376 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule subproof :discharge (t376.a0))
% 1.62/1.79 (step t377 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t375 t376))
% 1.62/1.79 (step t378 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t379 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule resolution :premises (t377 t378))
% 1.62/1.79 (step t380 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule contraction :premises (t379))
% 1.62/1.79 (step t381 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule implies :premises (t380))
% 1.62/1.79 (step t382 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t381 a84))
% 1.62/1.79 (step t383 (cl (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule resolution :premises (t366 a7 t374 t382))
% 1.62/1.79 (step t384 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t385)
% 1.62/1.79 (assume t385.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 1.62/1.79 (step t385.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule forall_inst :args ((:= U (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (:= V (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (step t385.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule or :premises (t385.t1))
% 1.62/1.79 (step t385.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t385.t2 t385.a0))
% 1.62/1.79 (step t385 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule subproof :discharge (t385.a0))
% 1.62/1.79 (step t386 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t384 t385))
% 1.62/1.79 (step t387 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t388 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t386 t387))
% 1.62/1.79 (step t389 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule contraction :premises (t388))
% 1.62/1.79 (step t390 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule implies :premises (t389))
% 1.62/1.79 (step t391 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule equiv_pos2)
% 1.62/1.79 (anchor :step t392 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.62/1.79 (step t392.t1 (cl (= U U)) :rule refl)
% 1.62/1.79 (step t392.t2 (cl (= V V)) :rule refl)
% 1.62/1.79 (step t392.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 1.62/1.79 (step t392.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t392.t3))
% 1.62/1.79 (step t392.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.62/1.79 (step t392.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.62/1.79 (step t392.t7 (cl (= (= tptp.nil V) (= tptp.nil V))) :rule refl)
% 1.62/1.79 (step t392.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule cong :premises (t392.t4 t392.t5 t392.t6 t392.t7))
% 1.62/1.79 (step t392 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) :rule bind)
% 1.62/1.79 (step t393 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule resolution :premises (t391 t392 a118))
% 1.62/1.79 (step t394 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t390 t393))
% 1.62/1.79 (step t395 (cl (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t356 t258 t364 t383 t394))
% 1.62/1.79 (step t396 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule or_pos)
% 1.62/1.79 (step t397 (cl (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule reordering :premises (t396))
% 1.62/1.79 (step t398 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t399)
% 1.62/1.79 (assume t399.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.62/1.79 (step t399.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (:= V (tptp.skaf48 tptp.nil tptp.nil))))
% 1.62/1.79 (step t399.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule or :premises (t399.t1))
% 1.62/1.79 (step t399.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t399.t2 t399.a0))
% 1.62/1.79 (step t399 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule subproof :discharge (t399.a0))
% 1.62/1.79 (step t400 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t398 t399))
% 1.62/1.79 (step t401 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t402 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule resolution :premises (t400 t401))
% 1.62/1.79 (step t403 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule contraction :premises (t402))
% 1.62/1.79 (step t404 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule implies :premises (t403))
% 1.62/1.79 (step t405 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t404 t155))
% 1.62/1.79 (step t406 (cl (= tptp.nil (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule resolution :premises (t397 t258 t364 t383 t405))
% 1.62/1.79 (step t407 (cl (not (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule or_pos)
% 1.62/1.79 (step t408 (cl (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule reordering :premises (t407))
% 1.62/1.79 (step t409 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t410)
% 1.62/1.79 (assume t410.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))))
% 1.62/1.79 (step t410.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule forall_inst :args ((:= A (tptp.skaf48 tptp.nil tptp.nil)) (:= B (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))
% 1.62/1.79 (step t410.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule or :premises (t410.t1))
% 1.62/1.79 (step t410.t3 (cl (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t410.t2 t410.a0))
% 1.62/1.79 (step t410 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule subproof :discharge (t410.a0))
% 1.62/1.79 (step t411 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t409 t410))
% 1.62/1.79 (step t412 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (not (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule implies_neg2)
% 1.62/1.79 (step t413 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule resolution :premises (t411 t412))
% 1.62/1.79 (step t414 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))))) :rule contraction :premises (t413))
% 1.62/1.79 (step t415 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule implies :premises (t414))
% 1.62/1.79 (step t416 (cl (or (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.skaf48 tptp.nil tptp.nil) (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t415 t66))
% 1.62/1.79 (step t417 (cl (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t276 t39 t89 a188 a7 t354 t395 t406 t258 a189 t36 t408 t364 t416 t383))
% 1.62/1.79 (step t418 (cl (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t417))
% 1.62/1.79 (step t419 (cl (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule reordering :premises (t418))
% 1.62/1.79 (step t420 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t164 t39 t89 a188 a7 t165 t233 t258 a190 t36 t419))
% 1.62/1.79 (step t421 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule contraction :premises (t420))
% 1.62/1.79 (step t422 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 1.62/1.79 (step t423 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t422))
% 1.62/1.79 (step t424 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t425)
% 1.62/1.79 (assume t425.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.62/1.79 (step t425.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 1.62/1.79 (step t425.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t425.t1))
% 1.62/1.79 (step t425.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t425.t2 t425.a0))
% 1.62/1.79 (step t425 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t425.a0))
% 1.62/1.79 (step t426 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t424 t425))
% 1.62/1.79 (step t427 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t428 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t426 t427))
% 1.62/1.79 (step t429 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t428))
% 1.62/1.79 (step t430 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t429))
% 1.62/1.79 (step t431 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 1.62/1.79 (anchor :step t432 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.62/1.79 (step t432.t1 (cl (= U U)) :rule refl)
% 1.62/1.79 (step t432.t2 (cl (= V V)) :rule refl)
% 1.62/1.79 (step t432.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 1.62/1.79 (step t432.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t432.t3))
% 1.62/1.79 (step t432.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 1.62/1.79 (step t432.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.62/1.79 (step t432.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t432.t4 t432.t5 t432.t6))
% 1.62/1.79 (step t432 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 1.62/1.79 (step t433 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t431 t432 a97))
% 1.62/1.79 (step t434 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t430 t433))
% 1.62/1.79 (step t435 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 1.62/1.79 (step t436 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t435))
% 1.62/1.79 (step t437 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t438)
% 1.62/1.79 (assume t438.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.62/1.79 (step t438.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 1.62/1.79 (step t438.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t438.t1))
% 1.62/1.79 (step t438.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t438.t2 t438.a0))
% 1.62/1.79 (step t438 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t438.a0))
% 1.62/1.79 (step t439 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t437 t438))
% 1.62/1.79 (step t440 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 1.62/1.79 (step t441 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t439 t440))
% 1.62/1.79 (step t442 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t441))
% 1.62/1.79 (step t443 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t442))
% 1.62/1.79 (step t444 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t443 a85))
% 1.62/1.79 (step t445 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5))) :rule resolution :premises (t421 t423 t434 a7 t436 t444 a7))
% 1.62/1.79 (step t446 (cl (not (tptp.ssItem tptp.sk5))) :rule contraction :premises (t445))
% 1.62/1.79 (step t447 (cl (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t40 t446))
% 1.62/1.79 (step t448 (cl (= tptp.nil tptp.sk4)) :rule resolution :premises (t39 t447 a7 a188 t89))
% 1.62/1.79 (step t449 (cl (= tptp.nil tptp.sk3)) :rule resolution :premises (t37 t448))
% 1.62/1.79 (step t450 (cl (= tptp.sk1 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t19 t36 a190 t449))
% 1.62/1.79 (step t451 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule and_neg)
% 1.62/1.79 (step t452 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t453)
% 1.62/1.79 (assume t453.a0 (= tptp.sk2 tptp.sk4))
% 1.62/1.79 (assume t453.a1 (= tptp.nil tptp.sk4))
% 1.62/1.79 (assume t453.a2 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (step t453.t1 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t453.t2)
% 1.62/1.79 (assume t453.t2.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 1.62/1.79 (assume t453.t2.a1 (= tptp.nil tptp.sk4))
% 1.62/1.79 (assume t453.t2.a2 (= tptp.sk2 tptp.sk4))
% 1.62/1.79 (step t453.t2.t1 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t453.t2.a2))
% 1.62/1.79 (step t453.t2.t2 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t453.t2.t1))
% 1.62/1.79 (step t453.t2.t3 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t453.t2.a1))
% 1.62/1.79 (step t453.t2.t4 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t453.t2.a0))
% 1.62/1.79 (step t453.t2.t5 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule symm :premises (t453.t2.t4))
% 1.62/1.79 (step t453.t2.t6 (cl (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule trans :premises (t453.t2.t2 t453.t2.t3 t453.t2.t5))
% 1.62/1.79 (step t453.t2 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule subproof :discharge (t453.t2.a0 t453.t2.a1 t453.t2.a2))
% 1.62/1.79 (step t453.t3 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t453.t4 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t453.t5 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t453.t6 (cl (= tptp.sk2 (tptp.app tptp.nil tptp.nil)) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t453.t2 t453.t3 t453.t4 t453.t5))
% 1.62/1.79 (step t453.t7 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule reordering :premises (t453.t6))
% 1.62/1.79 (step t453.t8 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule contraction :premises (t453.t7))
% 1.62/1.79 (step t453.t9 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t453.t1 t453.t8))
% 1.62/1.79 (step t453.t10 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil)))) :rule implies_neg2)
% 1.62/1.79 (step t453.t11 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t453.t9 t453.t10))
% 1.62/1.79 (step t453.t12 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil)))) :rule contraction :premises (t453.t11))
% 1.62/1.79 (step t453.t13 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule implies :premises (t453.t12))
% 1.62/1.79 (step t453.t14 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 1.62/1.79 (step t453.t15 (cl (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t453.t14 t453.a2 t453.a1 t453.a0))
% 1.62/1.79 (step t453.t16 (cl (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t453.t13 t453.t15))
% 1.62/1.79 (step t453 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule subproof :discharge (t453.a0 t453.a1 t453.a2))
% 1.62/1.79 (step t454 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t455 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 1.62/1.79 (step t456 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 1.62/1.79 (step t457 (cl (= tptp.sk2 (tptp.app tptp.nil tptp.nil)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t453 t454 t455 t456))
% 1.62/1.79 (step t458 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule reordering :premises (t457))
% 1.62/1.79 (step t459 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule contraction :premises (t458))
% 1.62/1.79 (step t460 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t452 t459))
% 1.62/1.79 (step t461 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil)))) :rule implies_neg2)
% 1.62/1.79 (step t462 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t460 t461))
% 1.62/1.79 (step t463 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil)))) :rule contraction :premises (t462))
% 1.62/1.79 (step t464 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule implies :premises (t463))
% 1.62/1.79 (step t465 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t451 t464))
% 1.62/1.79 (step t466 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule reordering :premises (t465))
% 1.62/1.79 (step t467 (cl (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t466 t448 t36 a189))
% 1.62/1.79 (step t468 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) :rule implies_neg1)
% 1.62/1.79 (anchor :step t469)
% 1.62/1.79 (assume t469.a0 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))))
% 1.62/1.79 (step t469.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))))) :rule forall_inst :args ((:= A tptp.nil) (:= B tptp.nil)))
% 1.62/1.79 (step t469.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) :rule or :premises (t469.t1))
% 1.62/1.79 (step t469.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t469.t2 t469.a0))
% 1.62/1.79 (step t469 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) :rule subproof :discharge (t469.a0))
% 1.62/1.79 (step t470 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t468 t469))
% 1.62/1.79 (step t471 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))))) :rule implies_neg2)
% 1.62/1.79 (step t472 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))))) :rule resolution :premises (t470 t471))
% 1.62/1.79 (step t473 (cl (=> (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil)))))) :rule contraction :premises (t472))
% 1.62/1.79 (step t474 (cl (not (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (= tptp.sk2 (tptp.app A B))) (not (= tptp.sk1 (tptp.app B A)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) :rule implies :premises (t473))
% 1.62/1.79 (step t475 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk2 (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk1 (tptp.app tptp.nil tptp.nil))))) :rule resolution :premises (t474 t66))
% 1.62/1.79 (step t476 (cl) :rule resolution :premises (t3 t450 t467 t475 a7))
% 1.62/1.79
% 1.63/1.80 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.TjgtEGtpxp/cvc5---1.0.5_21517.smt2
% 1.63/1.81 % cvc5---1.0.5 exiting
% 1.63/1.81 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------