%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWC315-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 18:01:28 EDT 2024

% Result   : Unsatisfiable 2.49s 2.65s
% Output   : Proof 2.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : SWC315-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.37  % Computer : n002.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Sun May 26 16:00:24 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.40/0.55  %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.56  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 2.49/2.65  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.azV6HVz3iO/cvc5---1.0.5_24318.smt2
% 2.49/2.65  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.azV6HVz3iO/cvc5---1.0.5_24318.smt2
% 2.54/2.71  (assume a0 (tptp.equalelemsP tptp.nil))
% 2.54/2.71  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 2.54/2.71  (assume a2 (tptp.strictorderedP tptp.nil))
% 2.54/2.71  (assume a3 (tptp.totalorderedP tptp.nil))
% 2.54/2.71  (assume a4 (tptp.strictorderP tptp.nil))
% 2.54/2.71  (assume a5 (tptp.totalorderP tptp.nil))
% 2.54/2.71  (assume a6 (tptp.cyclefreeP tptp.nil))
% 2.54/2.71  (assume a7 (tptp.ssList tptp.nil))
% 2.54/2.71  (assume a8 (tptp.ssItem tptp.skac3))
% 2.54/2.71  (assume a9 (tptp.ssItem tptp.skac2))
% 2.54/2.71  (assume a10 (not (tptp.singletonP tptp.nil)))
% 2.54/2.71  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 2.54/2.71  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 2.54/2.71  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 2.54/2.71  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 2.54/2.71  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 2.54/2.71  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 2.54/2.71  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 2.54/2.71  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 2.54/2.71  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 2.54/2.71  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 2.54/2.71  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 2.54/2.71  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 2.54/2.71  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 2.54/2.71  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 2.54/2.71  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 2.54/2.71  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 2.54/2.71  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 2.54/2.71  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 2.54/2.71  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 2.54/2.71  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 2.54/2.71  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 2.54/2.71  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 2.54/2.71  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 2.54/2.71  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 2.54/2.71  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 2.54/2.71  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 2.54/2.71  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 2.54/2.71  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 2.54/2.71  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 2.54/2.71  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 2.54/2.71  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 2.54/2.71  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 2.54/2.71  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 2.54/2.71  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 2.54/2.71  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 2.54/2.71  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 2.54/2.71  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 2.54/2.71  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 2.54/2.71  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 2.54/2.71  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 2.54/2.71  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 2.54/2.71  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 2.54/2.71  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 2.54/2.71  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 2.54/2.71  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 2.54/2.71  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 2.54/2.71  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 2.54/2.71  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 2.54/2.71  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 2.54/2.71  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 2.54/2.71  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 2.54/2.71  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 2.54/2.71  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 2.54/2.71  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 2.54/2.71  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 2.54/2.71  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 2.54/2.71  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 2.54/2.71  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 2.54/2.71  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 2.54/2.71  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 2.54/2.71  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 2.54/2.71  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 2.54/2.71  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 2.54/2.71  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.54/2.71  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.54/2.71  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.54/2.71  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.54/2.71  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 2.54/2.71  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.54/2.71  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 2.54/2.71  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.54/2.71  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 2.54/2.71  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.54/2.71  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 2.54/2.71  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.54/2.71  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 2.54/2.71  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 2.54/2.71  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 2.54/2.71  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 2.54/2.71  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 2.54/2.71  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.54/2.71  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.54/2.71  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.54/2.71  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.54/2.71  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 2.54/2.71  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 2.54/2.71  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.54/2.71  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.54/2.71  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 2.54/2.71  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 2.54/2.71  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 2.54/2.71  (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 2.54/2.71  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 2.54/2.71  (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 2.54/2.71  (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 2.54/2.71  (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 2.54/2.71  (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 2.54/2.71  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 2.54/2.71  (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 2.54/2.71  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.54/2.71  (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 2.54/2.71  (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 2.54/2.71  (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 2.54/2.71  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 2.54/2.71  (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 2.54/2.71  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.54/2.71  (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.54/2.71  (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 2.54/2.71  (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 2.54/2.71  (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 2.54/2.71  (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 2.54/2.71  (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 2.54/2.71  (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 2.54/2.71  (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 2.54/2.71  (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 2.54/2.71  (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 2.54/2.71  (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 2.54/2.71  (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 2.54/2.71  (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 2.54/2.71  (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 2.54/2.71  (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 2.54/2.71  (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 2.54/2.71  (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 2.54/2.71  (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 2.54/2.71  (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 2.54/2.71  (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 2.54/2.71  (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 2.54/2.71  (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 2.54/2.71  (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 2.54/2.71  (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 2.54/2.71  (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 2.54/2.71  (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 2.54/2.71  (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 2.54/2.71  (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 2.54/2.71  (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 2.54/2.71  (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 2.54/2.71  (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 2.54/2.71  (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 2.54/2.71  (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 2.54/2.71  (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 2.54/2.71  (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 2.54/2.71  (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 2.54/2.71  (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 2.54/2.71  (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 2.54/2.71  (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 2.54/2.71  (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 2.54/2.71  (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 2.54/2.71  (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 2.54/2.71  (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 2.54/2.71  (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 2.54/2.71  (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 2.54/2.71  (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 2.54/2.71  (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 2.54/2.71  (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 2.54/2.71  (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 2.54/2.71  (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 2.54/2.71  (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 2.54/2.71  (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 2.54/2.71  (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 2.54/2.71  (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 2.54/2.71  (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 2.54/2.71  (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 2.54/2.71  (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 2.54/2.71  (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 2.54/2.71  (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 2.54/2.71  (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 2.54/2.71  (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 2.54/2.71  (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 2.54/2.71  (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 2.54/2.71  (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 2.54/2.71  (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 2.54/2.71  (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 2.54/2.71  (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 2.54/2.71  (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 2.54/2.71  (assume a185 (tptp.ssList tptp.sk1))
% 2.54/2.71  (assume a186 (tptp.ssList tptp.sk2))
% 2.54/2.71  (assume a187 (tptp.ssList tptp.sk3))
% 2.54/2.71  (assume a188 (tptp.ssList tptp.sk4))
% 2.54/2.71  (assume a189 (= tptp.sk2 tptp.sk4))
% 2.54/2.71  (assume a190 (= tptp.sk1 tptp.sk3))
% 2.54/2.71  (assume a191 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 2.54/2.71  (assume a192 (or (tptp.ssItem tptp.sk5) (= tptp.nil tptp.sk2)))
% 2.54/2.71  (assume a193 (or (tptp.ssItem tptp.sk5) (not (= tptp.nil tptp.sk1))))
% 2.54/2.71  (assume a194 (or (tptp.ssList tptp.sk6) (= tptp.nil tptp.sk2)))
% 2.54/2.71  (assume a195 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (= tptp.nil tptp.sk2)))
% 2.54/2.71  (assume a196 (or (not (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk1)) (= tptp.nil tptp.sk2)))
% 2.54/2.71  (assume a197 (or (tptp.ssList tptp.sk6) (not (= tptp.nil tptp.sk1))))
% 2.54/2.71  (assume a198 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (not (= tptp.nil tptp.sk1))))
% 2.54/2.71  (assume a199 (or (not (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk1)) (not (= tptp.nil tptp.sk1))))
% 2.54/2.71  (assume a200 (or (tptp.ssItem tptp.sk7) (not (tptp.neq tptp.sk4 tptp.nil))))
% 2.54/2.71  (assume a201 (or (tptp.ssList tptp.sk8) (not (tptp.neq tptp.sk4 tptp.nil))))
% 2.54/2.71  (assume a202 (or (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 2.54/2.71  (assume a203 (or (= (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 2.54/2.71  (step t1 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 2.54/2.71  (step t2 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 2.54/2.71  (anchor :step t3)
% 2.54/2.71  (assume t3.a0 (= tptp.sk2 tptp.sk4))
% 2.54/2.71  (assume t3.a1 (= tptp.nil tptp.sk4))
% 2.54/2.71  (assume t3.a2 (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 2.54/2.71  (assume t3.a3 (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))
% 2.54/2.71  (step t3.t1 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) :rule implies_neg1)
% 2.54/2.71  (anchor :step t3.t2)
% 2.54/2.71  (assume t3.t2.a0 (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))
% 2.54/2.71  (assume t3.t2.a1 (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 2.54/2.71  (assume t3.t2.a2 (= tptp.sk2 tptp.sk4))
% 2.54/2.71  (assume t3.t2.a3 (= tptp.nil tptp.sk4))
% 2.54/2.71  (step t3.t2.t1 (cl (= (= (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 2.54/2.71  (step t3.t2.t2 (cl (not (= (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)) true)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule equiv1 :premises (t3.t2.t1))
% 2.54/2.71  (step t3.t2.t3 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t3.t2.a3))
% 2.54/2.71  (step t3.t2.t4 (cl (= tptp.nil tptp.sk4)) :rule symm :premises (t3.t2.t3))
% 2.54/2.71  (step t3.t2.t5 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t3.t2.a2))
% 2.54/2.71  (step t3.t2.t6 (cl (= tptp.nil tptp.sk2)) :rule trans :premises (t3.t2.t4 t3.t2.t5))
% 2.54/2.71  (step t3.t2.t7 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2)) :rule symm :premises (t3.t2.a1))
% 2.54/2.71  (step t3.t2.t8 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t3.t2.t7))
% 2.54/2.71  (step t3.t2.t9 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t3.t2.t6 t3.t2.t8))
% 2.54/2.71  (step t3.t2.t10 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 2.54/2.71  (step t3.t2.t11 (cl (= (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t3.t2.t9 t3.t2.t10))
% 2.54/2.71  (step t3.t2.t12 (cl (= (= (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 2.54/2.71  (step t3.t2.t13 (cl (= (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) true) (not (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv2 :premises (t3.t2.t12))
% 2.54/2.71  (step t3.t2.t14 (cl (= (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) true)) :rule resolution :premises (t3.t2.t13 t3.t2.a0))
% 2.54/2.71  (step t3.t2.t15 (cl (= (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)) true)) :rule trans :premises (t3.t2.t11 t3.t2.t14))
% 2.54/2.71  (step t3.t2.t16 (cl (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t3.t2.t2 t3.t2.t15))
% 2.54/2.71  (step t3.t2 (cl (not (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule subproof :discharge (t3.t2.a0 t3.t2.a1 t3.t2.a2 t3.t2.a3))
% 2.54/2.71  (step t3.t3 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 2.54/2.71  (step t3.t4 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 2.54/2.71  (step t3.t5 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.54/2.71  (step t3.t6 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.54/2.71  (step t3.t7 (cl (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t3.t2 t3.t3 t3.t4 t3.t5 t3.t6))
% 2.54/2.71  (step t3.t8 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t3.t7))
% 2.54/2.71  (step t3.t9 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule contraction :premises (t3.t8))
% 2.54/2.71  (step t3.t10 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t3.t1 t3.t9))
% 2.54/2.71  (step t3.t11 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg2)
% 2.54/2.71  (step t3.t12 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (=> (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t3.t10 t3.t11))
% 2.54/2.71  (step t3.t13 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t3.t12))
% 2.54/2.71  (step t3.t14 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule implies :premises (t3.t13))
% 2.54/2.71  (step t3.t15 (cl (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4)) (not (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule and_neg)
% 2.54/2.71  (step t3.t16 (cl (and (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4))) :rule resolution :premises (t3.t15 t3.a3 t3.a2 t3.a0 t3.a1))
% 2.54/2.71  (step t3.t17 (cl (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t3.t14 t3.t16))
% 2.54/2.71  (step t3 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule subproof :discharge (t3.a0 t3.a1 t3.a2 t3.a3))
% 2.54/2.71  (step t4 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.54/2.71  (step t5 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 2.54/2.71  (step t6 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 2.54/2.71  (step t7 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 2.54/2.71  (step t8 (cl (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t3 t4 t5 t6 t7))
% 2.54/2.71  (step t9 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t8))
% 2.54/2.71  (step t10 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule contraction :premises (t9))
% 2.54/2.71  (step t11 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t2 t10))
% 2.54/2.71  (step t12 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg2)
% 2.54/2.71  (step t13 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t11 t12))
% 2.54/2.71  (step t14 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t13))
% 2.54/2.71  (step t15 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk4) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule implies :premises (t14))
% 2.54/2.71  (step t16 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t1 t15))
% 2.54/2.71  (step t17 (cl (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t16))
% 2.54/2.71  (step t18 (cl (not (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 2.54/2.71  (step t19 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t18))
% 2.54/2.71  (step t20 (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)
% 2.54/2.71  (step t21 (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 (t20))
% 2.54/2.71  (step t22 (cl (tptp.ssItem tptp.sk5) (not (= tptp.nil tptp.sk1))) :rule or :premises (a193))
% 2.54/2.71  (step t23 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 2.54/2.71  (step t24 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 2.54/2.71  (step t25 (cl (= (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true) (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 2.54/2.71  (step t26 (cl (not (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true)) (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule equiv1 :premises (t25))
% 2.54/2.71  (step t27 (cl (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))))) :rule all_simplify)
% 2.54/2.71  (step t28 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 2.54/2.71  (step t29 (cl (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule all_simplify)
% 2.54/2.71  (step t30 (cl (= (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))) (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)))) :rule cong :premises (t28 t29))
% 2.54/2.71  (step t31 (cl (= (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)) true)) :rule all_simplify)
% 2.54/2.71  (step t32 (cl (= (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))) true)) :rule trans :premises (t30 t31))
% 2.54/2.71  (step t33 (cl (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true)) :rule trans :premises (t27 t32))
% 2.54/2.71  (step t34 (cl (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule resolution :premises (t26 t33))
% 2.54/2.71  (step t35 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 2.54/2.71  (step t36 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))))) :rule cong :premises (t24 t34 t35))
% 2.54/2.71  (step t37 (cl (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1)))) :rule and_neg)
% 2.54/2.71  (step t38 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) :rule implies_neg1)
% 2.54/2.71  (anchor :step t39)
% 2.54/2.71  (assume t39.a0 (= tptp.sk1 tptp.sk3))
% 2.54/2.71  (assume t39.a1 (not (= tptp.nil tptp.sk1)))
% 2.54/2.71  (step t39.t1 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 2.54/2.71  (anchor :step t39.t2)
% 2.54/2.71  (assume t39.t2.a0 (not (= tptp.nil tptp.sk1)))
% 2.54/2.71  (assume t39.t2.a1 (= tptp.sk1 tptp.sk3))
% 2.54/2.71  (step t39.t2.t1 (cl (= (= (= tptp.nil tptp.sk3) false) (not (= tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 2.54/2.71  (step t39.t2.t2 (cl (not (= (= tptp.nil tptp.sk3) false)) (not (= tptp.nil tptp.sk3))) :rule equiv1 :premises (t39.t2.t1))
% 2.54/2.71  (step t39.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 2.54/2.71  (step t39.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t39.t2.a1))
% 2.54/2.71  (step t39.t2.t5 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk1))) :rule cong :premises (t39.t2.t3 t39.t2.t4))
% 2.54/2.71  (step t39.t2.t6 (cl (= (= (= tptp.nil tptp.sk1) false) (not (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 2.54/2.71  (step t39.t2.t7 (cl (= (= tptp.nil tptp.sk1) false) (not (not (= tptp.nil tptp.sk1)))) :rule equiv2 :premises (t39.t2.t6))
% 2.54/2.71  (step t39.t2.t8 (cl (not (not (not (= tptp.nil tptp.sk1)))) (= tptp.nil tptp.sk1)) :rule not_not)
% 2.54/2.71  (step t39.t2.t9 (cl (= (= tptp.nil tptp.sk1) false) (= tptp.nil tptp.sk1)) :rule resolution :premises (t39.t2.t7 t39.t2.t8))
% 2.54/2.71  (step t39.t2.t10 (cl (= (= tptp.nil tptp.sk1) false)) :rule resolution :premises (t39.t2.t9 t39.t2.a0))
% 2.54/2.71  (step t39.t2.t11 (cl (= (= tptp.nil tptp.sk3) false)) :rule trans :premises (t39.t2.t5 t39.t2.t10))
% 2.54/2.71  (step t39.t2.t12 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t39.t2.t2 t39.t2.t11))
% 2.54/2.71  (step t39.t2 (cl (not (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t39.t2.a0 t39.t2.a1))
% 2.54/2.71  (step t39.t3 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule and_pos)
% 2.54/2.71  (step t39.t4 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.54/2.71  (step t39.t5 (cl (not (= tptp.nil tptp.sk3)) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t39.t2 t39.t3 t39.t4))
% 2.54/2.71  (step t39.t6 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t39.t5))
% 2.54/2.71  (step t39.t7 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t39.t6))
% 2.54/2.71  (step t39.t8 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t39.t1 t39.t7))
% 2.54/2.71  (step t39.t9 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 2.54/2.71  (step t39.t10 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t39.t8 t39.t9))
% 2.54/2.71  (step t39.t11 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t39.t10))
% 2.54/2.71  (step t39.t12 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t39.t11))
% 2.54/2.71  (step t39.t13 (cl (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 2.54/2.71  (step t39.t14 (cl (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t39.t13 t39.a1 t39.a0))
% 2.54/2.71  (step t39.t15 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t39.t12 t39.t14))
% 2.54/2.71  (step t39 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t39.a0 t39.a1))
% 2.54/2.71  (step t40 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.54/2.71  (step t41 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk1))) :rule and_pos)
% 2.54/2.71  (step t42 (cl (not (= tptp.nil tptp.sk3)) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))))) :rule resolution :premises (t39 t40 t41))
% 2.54/2.71  (step t43 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t42))
% 2.54/2.71  (step t44 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t43))
% 2.54/2.71  (step t45 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t38 t44))
% 2.54/2.71  (step t46 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 2.54/2.71  (step t47 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t45 t46))
% 2.54/2.71  (step t48 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t47))
% 2.54/2.71  (step t49 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t48))
% 2.54/2.71  (step t50 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t37 t49))
% 2.54/2.71  (step t51 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 2.54/2.71  (step t52 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (not (= tptp.nil tptp.sk1))))) :rule or_neg)
% 2.54/2.71  (step t53 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 2.54/2.71  (step t54 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t50 t51 t52 t53))
% 2.54/2.71  (step t55 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t54))
% 2.54/2.71  (step t56 (cl (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t23 t36 t55))
% 2.54/2.71  (step t57 (cl (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))) :rule or :premises (t56))
% 2.54/2.71  (step t58 (cl (= tptp.nil tptp.sk1) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t57))
% 2.54/2.71  (step t59 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a191))
% 2.54/2.71  (step t60 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) (not (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule and_neg)
% 2.54/2.71  (step t61 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule implies_neg1)
% 2.54/2.71  (anchor :step t62)
% 2.54/2.71  (assume t62.a0 (= tptp.sk2 tptp.sk4))
% 2.54/2.71  (assume t62.a1 (= tptp.sk1 tptp.sk3))
% 2.54/2.71  (assume t62.a2 (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 2.54/2.71  (assume t62.a3 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))
% 2.54/2.71  (assume t62.a4 (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.71  (assume t62.a5 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 2.54/2.71  (assume t62.a6 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 2.54/2.71  (assume t62.a7 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 2.54/2.71  (assume t62.a8 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 2.54/2.71  (assume t62.a9 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 2.54/2.71  (assume t62.a10 (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))
% 2.54/2.71  (assume t62.a11 (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.71  (assume t62.a12 (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.71  (assume t62.a13 (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))
% 2.54/2.71  (assume t62.a14 (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))
% 2.54/2.71  (assume t62.a15 (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))
% 2.54/2.71  (assume t62.a16 (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))
% 2.54/2.71  (assume t62.a17 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 2.54/2.71  (step t62.t1 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 2.54/2.71  (anchor :step t62.t2)
% 2.54/2.71  (assume t62.t2.a0 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 2.54/2.71  (assume t62.t2.a1 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 2.54/2.71  (assume t62.t2.a2 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 2.54/2.71  (assume t62.t2.a3 (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 2.54/2.71  (assume t62.t2.a4 (= tptp.sk2 tptp.sk4))
% 2.54/2.71  (assume t62.t2.a5 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))
% 2.54/2.71  (assume t62.t2.a6 (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))
% 2.54/2.71  (assume t62.t2.a7 (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.71  (assume t62.t2.a8 (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))
% 2.54/2.71  (assume t62.t2.a9 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 2.54/2.71  (assume t62.t2.a10 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 2.54/2.71  (assume t62.t2.a11 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 2.54/2.71  (assume t62.t2.a12 (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))
% 2.54/2.71  (assume t62.t2.a13 (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))
% 2.54/2.71  (assume t62.t2.a14 (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.71  (assume t62.t2.a15 (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))
% 2.54/2.71  (assume t62.t2.a16 (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.71  (assume t62.t2.a17 (= tptp.sk1 tptp.sk3))
% 2.54/2.71  (step t62.t2.t1 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t62.t2.a17))
% 2.54/2.71  (step t62.t2.t2 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t62.t2.t1))
% 2.54/2.71  (step t62.t2.t3 (cl (= (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk3)) :rule symm :premises (t62.t2.a16))
% 2.54/2.71  (step t62.t2.t4 (cl (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) :rule symm :premises (t62.t2.t3))
% 2.54/2.71  (step t62.t2.t5 (cl (= tptp.sk8 tptp.sk8)) :rule refl)
% 2.54/2.71  (step t62.t2.t6 (cl (= (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)) (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))) :rule cong :premises (t62.t2.t5 t62.t2.a15))
% 2.54/2.71  (step t62.t2.t7 (cl (= (tptp.app tptp.nil tptp.sk8) tptp.sk8)) :rule symm :premises (t62.t2.a8))
% 2.54/2.71  (step t62.t2.t8 (cl (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) :rule symm :premises (t62.t2.t7))
% 2.54/2.71  (step t62.t2.t9 (cl (= (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.nil)) :rule symm :premises (t62.t2.a7))
% 2.54/2.71  (step t62.t2.t10 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) :rule symm :premises (t62.t2.t9))
% 2.54/2.71  (step t62.t2.t11 (cl (= (tptp.app tptp.nil tptp.sk8) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) :rule cong :premises (t62.t2.t10 t62.t2.t5))
% 2.54/2.71  (step t62.t2.t12 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8) (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) :rule symm :premises (t62.t2.a6))
% 2.54/2.71  (step t62.t2.t13 (cl (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) tptp.sk4)) :rule symm :premises (t62.t2.a5))
% 2.54/2.71  (step t62.t2.t14 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t62.t2.a4))
% 2.54/2.71  (step t62.t2.t15 (cl (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) tptp.sk2)) :rule trans :premises (t62.t2.t13 t62.t2.t14))
% 2.54/2.71  (step t62.t2.t16 (cl (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.tl tptp.sk2))) :rule cong :premises (t62.t2.t15))
% 2.54/2.71  (step t62.t2.t17 (cl (= tptp.sk8 (tptp.tl tptp.sk2))) :rule trans :premises (t62.t2.t8 t62.t2.t11 t62.t2.t12 t62.t2.t16))
% 2.54/2.71  (step t62.t2.t18 (cl (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil))) :rule symm :premises (t62.t2.a15))
% 2.54/2.71  (step t62.t2.t19 (cl (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) tptp.sk7)) :rule symm :premises (t62.t2.a14))
% 2.54/2.71  (step t62.t2.t20 (cl (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) :rule symm :premises (t62.t2.t19))
% 2.54/2.71  (step t62.t2.t21 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) :rule symm :premises (t62.t2.a13))
% 2.54/2.71  (step t62.t2.t22 (cl (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) :rule symm :premises (t62.t2.t21))
% 2.54/2.71  (step t62.t2.t23 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2)) :rule symm :premises (t62.t2.a3))
% 2.54/2.71  (step t62.t2.t24 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t62.t2.t23))
% 2.54/2.71  (step t62.t2.t25 (cl (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t62.t2.t13 t62.t2.t14 t62.t2.t24))
% 2.54/2.71  (step t62.t2.t26 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t62.t2.t25))
% 2.54/2.71  (step t62.t2.t27 (cl (= (tptp.hd tptp.sk2) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t62.t2.t24))
% 2.54/2.71  (step t62.t2.t28 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd tptp.sk2))) :rule symm :premises (t62.t2.t27))
% 2.54/2.71  (step t62.t2.t29 (cl (= tptp.sk7 (tptp.hd tptp.sk2))) :rule trans :premises (t62.t2.t20 t62.t2.t22 t62.t2.t26 t62.t2.t28))
% 2.54/2.71  (step t62.t2.t30 (cl (= (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (tptp.skaf83 tptp.sk2))) :rule symm :premises (t62.t2.a12))
% 2.54/2.71  (step t62.t2.t31 (cl (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule symm :premises (t62.t2.t30))
% 2.54/2.71  (step t62.t2.t32 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule symm :premises (t62.t2.a11))
% 2.54/2.71  (step t62.t2.t33 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t62.t2.t32 t62.t2.t24))
% 2.54/2.71  (step t62.t2.t34 (cl (= (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t62.t2.t33))
% 2.54/2.71  (step t62.t2.t35 (cl (= (tptp.skaf83 tptp.sk2) (tptp.hd tptp.sk2))) :rule trans :premises (t62.t2.t31 t62.t2.t34 t62.t2.t28))
% 2.54/2.71  (step t62.t2.t36 (cl (= (tptp.hd tptp.sk2) (tptp.skaf83 tptp.sk2))) :rule symm :premises (t62.t2.t35))
% 2.54/2.71  (step t62.t2.t37 (cl (= tptp.sk7 (tptp.skaf83 tptp.sk2))) :rule trans :premises (t62.t2.t29 t62.t2.t36))
% 2.54/2.71  (step t62.t2.t38 (cl (= tptp.nil tptp.nil)) :rule refl)
% 2.54/2.71  (step t62.t2.t39 (cl (= (tptp.cons tptp.sk7 tptp.nil) (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule cong :premises (t62.t2.t37 t62.t2.t38))
% 2.54/2.71  (step t62.t2.t40 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t62.t2.a10))
% 2.54/2.71  (step t62.t2.t41 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule symm :premises (t62.t2.a9))
% 2.54/2.71  (step t62.t2.t42 (cl (= (tptp.hd tptp.sk2) tptp.sk5)) :rule trans :premises (t62.t2.t27 t62.t2.t40 t62.t2.t41))
% 2.54/2.71  (step t62.t2.t43 (cl (= (tptp.skaf83 tptp.sk2) tptp.sk5)) :rule trans :premises (t62.t2.t35 t62.t2.t42))
% 2.54/2.71  (step t62.t2.t44 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule cong :premises (t62.t2.t43 t62.t2.t38))
% 2.54/2.71  (step t62.t2.t45 (cl (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule trans :premises (t62.t2.t18 t62.t2.t39 t62.t2.t44))
% 2.54/2.71  (step t62.t2.t46 (cl (= (tptp.app tptp.sk8 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (tptp.app (tptp.tl tptp.sk2) (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t62.t2.t17 t62.t2.t45))
% 2.54/2.71  (step t62.t2.t47 (cl (= (tptp.tl tptp.sk2) (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t62.t2.t24))
% 2.54/2.71  (step t62.t2.t48 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule symm :premises (t62.t2.a2))
% 2.54/2.71  (step t62.t2.t49 (cl (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule symm :premises (t62.t2.t48))
% 2.54/2.71  (step t62.t2.t50 (cl (= (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) :rule symm :premises (t62.t2.a1))
% 2.54/2.71  (step t62.t2.t51 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 2.54/2.71  (step t62.t2.t52 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t62.t2.t50 t62.t2.t51))
% 2.54/2.71  (step t62.t2.t53 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t62.t2.a0))
% 2.54/2.71  (step t62.t2.t54 (cl (= (tptp.tl tptp.sk2) tptp.sk6)) :rule trans :premises (t62.t2.t47 t62.t2.t49 t62.t2.t52 t62.t2.t53))
% 2.54/2.71  (step t62.t2.t55 (cl (= (tptp.tl tptp.sk2) (tptp.app tptp.nil tptp.sk6))) :rule trans :premises (t62.t2.t54 t62.t2.a0))
% 2.54/2.71  (step t62.t2.t56 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 2.54/2.71  (step t62.t2.t57 (cl (= (tptp.app (tptp.tl tptp.sk2) (tptp.cons tptp.sk5 tptp.nil)) (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t62.t2.t55 t62.t2.t56))
% 2.54/2.71  (step t62.t2.t58 (cl (= (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t62.t2.t53 t62.t2.t56))
% 2.54/2.71  (step t62.t2.t59 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule trans :premises (t62.t2.t2 t62.t2.t4 t62.t2.t6 t62.t2.t46 t62.t2.t57 t62.t2.t58))
% 2.54/2.71  (step t62.t2 (cl (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) (not (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) (not (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t62.t2.a0 t62.t2.a1 t62.t2.a2 t62.t2.a3 t62.t2.a4 t62.t2.a5 t62.t2.a6 t62.t2.a7 t62.t2.a8 t62.t2.a9 t62.t2.a10 t62.t2.a11 t62.t2.a12 t62.t2.a13 t62.t2.a14 t62.t2.a15 t62.t2.a16 t62.t2.a17))
% 2.54/2.71  (step t62.t3 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 2.54/2.71  (step t62.t4 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 2.54/2.71  (step t62.t5 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_pos)
% 2.54/2.71  (step t62.t6 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 2.54/2.71  (step t62.t7 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.54/2.71  (step t62.t8 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) :rule and_pos)
% 2.54/2.71  (step t62.t9 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) :rule and_pos)
% 2.54/2.71  (step t62.t10 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) :rule and_pos)
% 2.54/2.71  (step t62.t11 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) :rule and_pos)
% 2.54/2.71  (step t62.t12 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 2.54/2.71  (step t62.t13 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 2.54/2.71  (step t62.t14 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 2.54/2.71  (step t62.t15 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule and_pos)
% 2.54/2.71  (step t62.t16 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) :rule and_pos)
% 2.54/2.71  (step t62.t17 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) :rule and_pos)
% 2.54/2.71  (step t62.t18 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) :rule and_pos)
% 2.54/2.71  (step t62.t19 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) :rule and_pos)
% 2.54/2.71  (step t62.t20 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.54/2.71  (step t62.t21 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t62.t2 t62.t3 t62.t4 t62.t5 t62.t6 t62.t7 t62.t8 t62.t9 t62.t10 t62.t11 t62.t12 t62.t13 t62.t14 t62.t15 t62.t16 t62.t17 t62.t18 t62.t19 t62.t20))
% 2.54/2.71  (step t62.t22 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t62.t21))
% 2.54/2.71  (step t62.t23 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t62.t22))
% 2.54/2.71  (step t62.t24 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t62.t1 t62.t23))
% 2.54/2.71  (step t62.t25 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 2.54/2.71  (step t62.t26 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t62.t24 t62.t25))
% 2.54/2.71  (step t62.t27 (cl (=> (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t62.t26))
% 2.54/2.72  (step t62.t28 (cl (not (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t62.t27))
% 2.54/2.72  (step t62.t29 (cl (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) (not (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) (not (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 2.54/2.72  (step t62.t30 (cl (and (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t62.t29 t62.a5 t62.a6 t62.a17 t62.a2 t62.a0 t62.a3 t62.a16 t62.a11 t62.a10 t62.a7 t62.a9 t62.a8 t62.a13 t62.a15 t62.a12 t62.a14 t62.a4 t62.a1))
% 2.54/2.72  (step t62.t31 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t62.t28 t62.t30))
% 2.54/2.72  (step t62 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) (not (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t62.a0 t62.a1 t62.a2 t62.a3 t62.a4 t62.a5 t62.a6 t62.a7 t62.a8 t62.a9 t62.a10 t62.a11 t62.a12 t62.a13 t62.a14 t62.a15 t62.a16 t62.a17))
% 2.54/2.72  (step t63 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.54/2.72  (step t64 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.54/2.72  (step t65 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 2.54/2.72  (step t66 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) :rule and_pos)
% 2.54/2.72  (step t67 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) :rule and_pos)
% 2.54/2.72  (step t68 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 2.54/2.72  (step t69 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 2.54/2.72  (step t70 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 2.54/2.72  (step t71 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 2.54/2.72  (step t72 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 2.54/2.72  (step t73 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) :rule and_pos)
% 2.54/2.72  (step t74 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) :rule and_pos)
% 2.54/2.72  (step t75 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) :rule and_pos)
% 2.54/2.72  (step t76 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule and_pos)
% 2.54/2.72  (step t77 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) :rule and_pos)
% 2.54/2.72  (step t78 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) :rule and_pos)
% 2.54/2.72  (step t79 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) :rule and_pos)
% 2.54/2.72  (step t80 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_pos)
% 2.54/2.72  (step t81 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule resolution :premises (t62 t63 t64 t65 t66 t67 t68 t69 t70 t71 t72 t73 t74 t75 t76 t77 t78 t79 t80))
% 2.54/2.72  (step t82 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t81))
% 2.54/2.72  (step t83 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule contraction :premises (t82))
% 2.54/2.72  (step t84 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t61 t83))
% 2.54/2.72  (step t85 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 2.54/2.72  (step t86 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t84 t85))
% 2.54/2.72  (step t87 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t86))
% 2.54/2.72  (step t88 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t87))
% 2.54/2.72  (step t89 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) (not (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t60 t88))
% 2.54/2.72  (step t90 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) (not (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule reordering :premises (t89))
% 2.54/2.72  (step t91 (cl (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) :rule or_pos)
% 2.54/2.72  (step t92 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))))) :rule reordering :premises (t91))
% 2.54/2.72  (step t93 (cl (=> (forall ((V $$unsorted)) (tptp.ssItem V)) (tptp.ssItem tptp.sk7)) (forall ((V $$unsorted)) (tptp.ssItem V))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t94)
% 2.54/2.72  (assume t94.a0 (forall ((V $$unsorted)) (tptp.ssItem V)))
% 2.54/2.72  (step t94.t1 (cl (or (not (forall ((V $$unsorted)) (tptp.ssItem V))) (tptp.ssItem tptp.sk7))) :rule forall_inst :args ((:= V tptp.sk7)))
% 2.54/2.72  (step t94.t2 (cl (not (forall ((V $$unsorted)) (tptp.ssItem V))) (tptp.ssItem tptp.sk7)) :rule or :premises (t94.t1))
% 2.54/2.72  (step t94.t3 (cl (tptp.ssItem tptp.sk7)) :rule resolution :premises (t94.t2 t94.a0))
% 2.54/2.72  (step t94 (cl (not (forall ((V $$unsorted)) (tptp.ssItem V))) (tptp.ssItem tptp.sk7)) :rule subproof :discharge (t94.a0))
% 2.54/2.72  (step t95 (cl (=> (forall ((V $$unsorted)) (tptp.ssItem V)) (tptp.ssItem tptp.sk7)) (tptp.ssItem tptp.sk7)) :rule resolution :premises (t93 t94))
% 2.54/2.72  (step t96 (cl (=> (forall ((V $$unsorted)) (tptp.ssItem V)) (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk7))) :rule implies_neg2)
% 2.54/2.72  (step t97 (cl (=> (forall ((V $$unsorted)) (tptp.ssItem V)) (tptp.ssItem tptp.sk7)) (=> (forall ((V $$unsorted)) (tptp.ssItem V)) (tptp.ssItem tptp.sk7))) :rule resolution :premises (t95 t96))
% 2.54/2.72  (step t98 (cl (=> (forall ((V $$unsorted)) (tptp.ssItem V)) (tptp.ssItem tptp.sk7))) :rule contraction :premises (t97))
% 2.54/2.72  (step t99 (cl (not (forall ((V $$unsorted)) (tptp.ssItem V))) (tptp.ssItem tptp.sk7)) :rule implies :premises (t98))
% 2.54/2.72  (step t100 (cl (tptp.ssItem tptp.sk7) (not (forall ((V $$unsorted)) (tptp.ssItem V)))) :rule reordering :premises (t99))
% 2.54/2.72  (step t101 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))) (or (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (forall ((V $$unsorted)) (tptp.ssItem V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V)))) (or (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (forall ((V $$unsorted)) (tptp.ssItem V)))) :rule equiv_pos2)
% 2.54/2.72  (step t102 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))) (or (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (forall ((V $$unsorted)) (tptp.ssItem V))))) :rule all_simplify)
% 2.54/2.72  (step t103 (cl (or (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (forall ((V $$unsorted)) (tptp.ssItem V)))) :rule resolution :premises (t101 t102 a71))
% 2.54/2.72  (step t104 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (forall ((V $$unsorted)) (tptp.ssItem V))) :rule or :premises (t103))
% 2.54/2.72  (step t105 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t106)
% 2.54/2.72  (assume t106.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))))
% 2.54/2.72  (step t106.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule forall_inst :args ((:= U (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))
% 2.54/2.72  (step t106.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule or :premises (t106.t1))
% 2.54/2.72  (step t106.t3 (cl (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t106.t2 t106.a0))
% 2.54/2.72  (step t106 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule subproof :discharge (t106.a0))
% 2.54/2.72  (step t107 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t105 t106))
% 2.54/2.72  (step t108 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule implies_neg2)
% 2.54/2.72  (step t109 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t107 t108))
% 2.54/2.72  (step t110 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule contraction :premises (t109))
% 2.54/2.72  (step t111 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U)))) (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies :premises (t110))
% 2.54/2.72  (step t112 (cl (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule or_pos)
% 2.54/2.72  (step t113 (cl (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule reordering :premises (t112))
% 2.54/2.72  (step t114 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule or_pos)
% 2.54/2.72  (step t115 (cl (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule reordering :premises (t114))
% 2.54/2.72  (step t116 (cl (not (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) :rule or_pos)
% 2.54/2.72  (step t117 (cl (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule reordering :premises (t116))
% 2.54/2.72  (step t118 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t119)
% 2.54/2.72  (assume t119.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 2.54/2.72  (step t119.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.54/2.72  (step t119.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule or :premises (t119.t1))
% 2.54/2.72  (step t119.t3 (cl (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule resolution :premises (t119.t2 t119.a0))
% 2.54/2.72  (step t119 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule subproof :discharge (t119.a0))
% 2.54/2.72  (step t120 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule resolution :premises (t118 t119))
% 2.54/2.72  (step t121 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule implies_neg2)
% 2.54/2.72  (step t122 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule resolution :premises (t120 t121))
% 2.54/2.72  (step t123 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))) (tptp.ssItem (tptp.skaf74 tptp.sk1)))) :rule contraction :premises (t122))
% 2.54/2.72  (step t124 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U)))) (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule implies :premises (t123))
% 2.54/2.72  (step t125 (cl (tptp.ssItem (tptp.skaf74 tptp.sk1))) :rule resolution :premises (t124 a20))
% 2.54/2.72  (step t126 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t127)
% 2.54/2.72  (assume t127.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 2.54/2.72  (step t127.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.54/2.72  (step t127.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule or :premises (t127.t1))
% 2.54/2.72  (step t127.t3 (cl (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule resolution :premises (t127.t2 t127.a0))
% 2.54/2.72  (step t127 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule subproof :discharge (t127.a0))
% 2.54/2.72  (step t128 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule resolution :premises (t126 t127))
% 2.54/2.72  (step t129 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule implies_neg2)
% 2.54/2.72  (step t130 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule resolution :premises (t128 t129))
% 2.54/2.72  (step t131 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))) (tptp.ssList (tptp.skaf77 tptp.sk1)))) :rule contraction :premises (t130))
% 2.54/2.72  (step t132 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U)))) (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule implies :premises (t131))
% 2.54/2.72  (step t133 (cl (tptp.ssList (tptp.skaf77 tptp.sk1))) :rule resolution :premises (t132 a17))
% 2.54/2.72  (step t134 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t135)
% 2.54/2.72  (assume t135.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.54/2.72  (step t135.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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule forall_inst :args ((:= U (tptp.skaf74 tptp.sk1)) (:= V (tptp.skaf77 tptp.sk1))))
% 2.54/2.72  (step t135.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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule or :premises (t135.t1))
% 2.54/2.72  (step t135.t3 (cl (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t135.t2 t135.a0))
% 2.54/2.72  (step t135 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule subproof :discharge (t135.a0))
% 2.54/2.72  (step t136 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t134 t135))
% 2.54/2.72  (step t137 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies_neg2)
% 2.54/2.72  (step t138 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (=> (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t136 t137))
% 2.54/2.72  (step t139 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule contraction :premises (t138))
% 2.54/2.72  (step t140 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule implies :premises (t139))
% 2.54/2.72  (step t141 (cl (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t140 a85))
% 2.54/2.72  (step t142 (cl (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) :rule resolution :premises (t117 t125 t133 t141))
% 2.54/2.72  (step t143 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule or_pos)
% 2.54/2.72  (step t144 (cl (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))))) :rule reordering :premises (t143))
% 2.54/2.72  (step t145 (cl (not (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) :rule or_pos)
% 2.54/2.72  (step t146 (cl (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule reordering :premises (t145))
% 2.54/2.72  (step t147 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t148)
% 2.54/2.72  (assume t148.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 2.54/2.72  (step t148.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.54/2.72  (step t148.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule or :premises (t148.t1))
% 2.54/2.72  (step t148.t3 (cl (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule resolution :premises (t148.t2 t148.a0))
% 2.54/2.72  (step t148 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule subproof :discharge (t148.a0))
% 2.54/2.72  (step t149 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule resolution :premises (t147 t148))
% 2.54/2.72  (step t150 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule implies_neg2)
% 2.54/2.72  (step t151 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule resolution :premises (t149 t150))
% 2.54/2.72  (step t152 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))) (tptp.ssList (tptp.skaf76 tptp.sk1)))) :rule contraction :premises (t151))
% 2.54/2.72  (step t153 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U)))) (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule implies :premises (t152))
% 2.54/2.72  (step t154 (cl (tptp.ssList (tptp.skaf76 tptp.sk1))) :rule resolution :premises (t153 a18))
% 2.54/2.72  (step t155 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t156)
% 2.54/2.72  (assume t156.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.54/2.72  (step t156.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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule forall_inst :args ((:= U (tptp.skaf74 tptp.sk1)) (:= V (tptp.skaf76 tptp.sk1))))
% 2.54/2.72  (step t156.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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule or :premises (t156.t1))
% 2.54/2.72  (step t156.t3 (cl (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule resolution :premises (t156.t2 t156.a0))
% 2.54/2.72  (step t156 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule subproof :discharge (t156.a0))
% 2.54/2.72  (step t157 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule resolution :premises (t155 t156))
% 2.54/2.72  (step t158 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (not (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule implies_neg2)
% 2.54/2.72  (step t159 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (=> (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule resolution :premises (t157 t158))
% 2.54/2.72  (step t160 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule contraction :premises (t159))
% 2.54/2.72  (step t161 (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.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule implies :premises (t160))
% 2.54/2.72  (step t162 (cl (or (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule resolution :premises (t161 a85))
% 2.54/2.72  (step t163 (cl (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) :rule resolution :premises (t146 t125 t154 t162))
% 2.54/2.72  (step t164 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t165)
% 2.54/2.72  (assume t165.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 2.54/2.72  (step t165.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.54/2.72  (step t165.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule or :premises (t165.t1))
% 2.54/2.72  (step t165.t3 (cl (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule resolution :premises (t165.t2 t165.a0))
% 2.54/2.72  (step t165 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule subproof :discharge (t165.a0))
% 2.54/2.72  (step t166 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule resolution :premises (t164 t165))
% 2.54/2.72  (step t167 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule implies_neg2)
% 2.54/2.72  (step t168 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule resolution :premises (t166 t167))
% 2.54/2.72  (step t169 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))) (tptp.ssList (tptp.skaf75 tptp.sk1)))) :rule contraction :premises (t168))
% 2.54/2.72  (step t170 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U)))) (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule implies :premises (t169))
% 2.54/2.72  (step t171 (cl (tptp.ssList (tptp.skaf75 tptp.sk1))) :rule resolution :premises (t170 a19))
% 2.54/2.72  (step t172 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t173)
% 2.54/2.72  (assume t173.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 2.54/2.72  (step t173.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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (:= V (tptp.skaf75 tptp.sk1))))
% 2.54/2.72  (step t173.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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule or :premises (t173.t1))
% 2.54/2.72  (step t173.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule resolution :premises (t173.t2 t173.a0))
% 2.54/2.72  (step t173 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule subproof :discharge (t173.a0))
% 2.54/2.72  (step t174 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule resolution :premises (t172 t173))
% 2.54/2.72  (step t175 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) (not (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))))) :rule implies_neg2)
% 2.54/2.72  (step t176 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) (=> (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))))) :rule resolution :premises (t174 t175))
% 2.54/2.72  (step t177 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))))) :rule contraction :premises (t176))
% 2.54/2.72  (step t178 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule implies :premises (t177))
% 2.54/2.72  (step t179 (cl (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1)))))) :rule resolution :premises (t178 a84))
% 2.54/2.72  (step t180 (cl (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) :rule resolution :premises (t144 t163 t171 t179))
% 2.54/2.72  (step t181 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t182)
% 2.54/2.72  (assume t182.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 2.54/2.72  (step t182.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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))) (:= V (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))))
% 2.54/2.72  (step t182.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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule or :premises (t182.t1))
% 2.54/2.72  (step t182.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t182.t2 t182.a0))
% 2.54/2.72  (step t182 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule subproof :discharge (t182.a0))
% 2.54/2.72  (step t183 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t181 t182))
% 2.54/2.72  (step t184 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (not (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule implies_neg2)
% 2.54/2.72  (step t185 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) (=> (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t183 t184))
% 2.54/2.72  (step t186 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule contraction :premises (t185))
% 2.54/2.72  (step t187 (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.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule implies :premises (t186))
% 2.54/2.72  (step t188 (cl (or (not (tptp.ssList (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))) (not (tptp.ssList (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))))) (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t187 a84))
% 2.54/2.72  (step t189 (cl (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) :rule resolution :premises (t115 t142 t180 t188))
% 2.54/2.72  (step t190 (cl (not (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule or_pos)
% 2.54/2.72  (step t191 (cl (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))))) :rule reordering :premises (t190))
% 2.54/2.72  (step t192 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t193)
% 2.54/2.72  (assume t193.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))
% 2.54/2.72  (step t193.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))))) :rule forall_inst :args ((:= U (tptp.skaf75 tptp.sk1)) (:= V (tptp.skaf74 tptp.sk1)) (:= W (tptp.skaf76 tptp.sk1)) (:= X (tptp.skaf77 tptp.sk1))))
% 2.54/2.72  (step t193.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule or :premises (t193.t1))
% 2.54/2.72  (step t193.t3 (cl (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t193.t2 t193.a0))
% 2.54/2.72  (step t193 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule subproof :discharge (t193.a0))
% 2.54/2.72  (step t194 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t192 t193))
% 2.54/2.72  (step t195 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) (not (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))))) :rule implies_neg2)
% 2.54/2.72  (step t196 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))))) :rule resolution :premises (t194 t195))
% 2.54/2.72  (step t197 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))))) :rule contraction :premises (t196))
% 2.54/2.72  (step t198 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule implies :premises (t197))
% 2.54/2.72  (step t199 (cl (not (= (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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) (not (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))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule equiv_pos2)
% 2.54/2.72  (anchor :step t200 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 2.54/2.72  (step t200.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t200.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t200.t3 (cl (= W W)) :rule refl)
% 2.54/2.72  (step t200.t4 (cl (= X X)) :rule refl)
% 2.54/2.72  (step t200.t5 (cl (= Y Y)) :rule refl)
% 2.54/2.72  (step t200.t6 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y) (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) :rule all_simplify)
% 2.54/2.72  (step t200.t7 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) :rule cong :premises (t200.t6))
% 2.54/2.72  (step t200.t8 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 2.54/2.72  (step t200.t9 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.54/2.72  (step t200.t10 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.54/2.72  (step t200.t11 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 2.54/2.72  (step t200.t12 (cl (= (not (tptp.duplicatefreeP Y)) (not (tptp.duplicatefreeP Y)))) :rule refl)
% 2.54/2.72  (step t200.t13 (cl (= (not (tptp.ssList Y)) (not (tptp.ssList Y)))) :rule refl)
% 2.54/2.72  (step t200.t14 (cl (= (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))) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y))))) :rule cong :premises (t200.t7 t200.t8 t200.t9 t200.t10 t200.t11 t200.t12 t200.t13))
% 2.54/2.72  (step t200 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons 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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))) :rule bind)
% 2.54/2.72  (step t201 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule all_simplify)
% 2.54/2.72  (anchor :step t202 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 2.54/2.72  (step t202.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t202.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t202.t3 (cl (= W W)) :rule refl)
% 2.54/2.72  (step t202.t4 (cl (= X X)) :rule refl)
% 2.54/2.72  (step t202.t5 (cl (= (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))) true)) :rule all_simplify)
% 2.54/2.72  (step t202.t6 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not true))) :rule cong :premises (t202.t5))
% 2.54/2.72  (step t202.t7 (cl (= (not true) false)) :rule all_simplify)
% 2.54/2.72  (step t202.t8 (cl (= (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) false)) :rule trans :premises (t202.t6 t202.t7))
% 2.54/2.72  (step t202.t9 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 2.54/2.72  (step t202.t10 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.54/2.72  (step t202.t11 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.54/2.72  (step t202.t12 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 2.54/2.72  (step t202.t13 (cl (= (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) :rule refl)
% 2.54/2.72  (step t202.t14 (cl (= (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) :rule refl)
% 2.54/2.72  (step t202.t15 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) (or false (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule cong :premises (t202.t8 t202.t9 t202.t10 t202.t11 t202.t12 t202.t13 t202.t14))
% 2.54/2.72  (step t202.t16 (cl (= (or false (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule all_simplify)
% 2.54/2.72  (step t202.t17 (cl (= (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule trans :premises (t202.t15 t202.t16))
% 2.54/2.72  (step t202 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule bind)
% 2.54/2.72  (step t203 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= Y (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule trans :premises (t201 t202))
% 2.54/2.72  (step t204 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons 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)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))))))) :rule trans :premises (t200 t203))
% 2.54/2.72  (step t205 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)))) (not (tptp.ssList (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X))))))) :rule resolution :premises (t199 t204 a178))
% 2.54/2.72  (step t206 (cl (or (not (tptp.ssList (tptp.skaf77 tptp.sk1))) (not (tptp.ssList (tptp.skaf76 tptp.sk1))) (not (tptp.ssList (tptp.skaf75 tptp.sk1))) (not (tptp.ssItem (tptp.skaf74 tptp.sk1))) (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t198 t205))
% 2.54/2.72  (step t207 (cl (not (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1)))))) :rule resolution :premises (t191 t171 t125 t154 t133 t189 t206))
% 2.54/2.72  (step t208 (cl (not (or (not (tptp.ssList (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))) (tptp.duplicatefreeP (tptp.app (tptp.app (tptp.skaf75 tptp.sk1) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf76 tptp.sk1))) (tptp.cons (tptp.skaf74 tptp.sk1) (tptp.skaf77 tptp.sk1))))))) :rule resolution :premises (t113 t189 t207))
% 2.54/2.72  (step t209 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U))))) :rule resolution :premises (t111 t208))
% 2.54/2.72  (step t210 (cl (forall ((V $$unsorted)) (tptp.ssItem V))) :rule resolution :premises (t104 t209))
% 2.54/2.72  (step t211 (cl (tptp.ssItem tptp.sk7)) :rule resolution :premises (t100 t210))
% 2.54/2.72  (step t212 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))))) :rule equiv_pos2)
% 2.54/2.72  (step t213 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))) :rule refl)
% 2.54/2.72  (step t214 (cl (= (not (tptp.ssItem tptp.sk7)) (not (tptp.ssItem tptp.sk7)))) :rule refl)
% 2.54/2.72  (step t215 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 2.54/2.72  (step t216 (cl (= (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))) :rule all_simplify)
% 2.54/2.72  (step t217 (cl (= (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))))) :rule cong :premises (t214 t215 t216))
% 2.54/2.72  (step t218 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))))) :rule cong :premises (t213 t217))
% 2.54/2.72  (step t219 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t220)
% 2.54/2.72  (assume t220.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 2.54/2.72  (step t220.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 2.54/2.72  (step t220.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) :rule or :premises (t220.t1))
% 2.54/2.72  (step t220.t3 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t220.t2 t220.a0))
% 2.54/2.72  (step t220 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) :rule subproof :discharge (t220.a0))
% 2.54/2.72  (step t221 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t219 t220))
% 2.54/2.72  (step t222 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil))))) :rule implies_neg2)
% 2.54/2.72  (step t223 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t221 t222))
% 2.54/2.72  (step t224 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil) (tptp.cons tptp.sk7 tptp.nil))))) :rule contraction :premises (t223))
% 2.54/2.72  (step t225 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))))) :rule resolution :premises (t212 t218 t224))
% 2.54/2.72  (step t226 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))) :rule implies :premises (t225))
% 2.54/2.72  (step t227 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil)))) :rule resolution :premises (t226 a119))
% 2.54/2.72  (step t228 (cl (= (tptp.cons tptp.sk7 tptp.nil) (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.nil))) :rule resolution :premises (t92 a7 t211 t227))
% 2.54/2.72  (step t229 (cl (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) :rule or_pos)
% 2.54/2.72  (step t230 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule reordering :premises (t229))
% 2.54/2.72  (step t231 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t232)
% 2.54/2.72  (assume t232.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 2.54/2.72  (step t232.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 2.54/2.72  (step t232.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule or :premises (t232.t1))
% 2.54/2.72  (step t232.t3 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t232.t2 t232.a0))
% 2.54/2.72  (step t232 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule subproof :discharge (t232.a0))
% 2.54/2.72  (step t233 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t231 t232))
% 2.54/2.72  (step t234 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule implies_neg2)
% 2.54/2.72  (step t235 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule resolution :premises (t233 t234))
% 2.54/2.72  (step t236 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule contraction :premises (t235))
% 2.54/2.72  (step t237 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule implies :premises (t236))
% 2.54/2.72  (step t238 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule equiv_pos2)
% 2.54/2.72  (anchor :step t239 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.54/2.72  (step t239.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t239.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t239.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 2.54/2.72  (step t239.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.54/2.72  (step t239.t5 (cl (= (= (tptp.hd (tptp.cons U V)) U) (= U (tptp.hd (tptp.cons U V))))) :rule all_simplify)
% 2.54/2.72  (step t239.t6 (cl (= (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule cong :premises (t239.t3 t239.t4 t239.t5))
% 2.54/2.72  (step t239 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) :rule bind)
% 2.54/2.72  (step t240 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule resolution :premises (t238 t239 a96))
% 2.54/2.72  (step t241 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t237 t240))
% 2.54/2.72  (step t242 (cl (= tptp.sk7 (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t230 a7 t211 t241))
% 2.54/2.72  (step t243 (cl (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) :rule or_pos)
% 2.54/2.72  (step t244 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))))) :rule reordering :premises (t243))
% 2.54/2.72  (step t245 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t246)
% 2.54/2.72  (assume t246.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))
% 2.54/2.72  (step t246.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 2.54/2.72  (step t246.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) :rule or :premises (t246.t1))
% 2.54/2.72  (step t246.t3 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t246.t2 t246.a0))
% 2.54/2.72  (step t246 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) :rule subproof :discharge (t246.a0))
% 2.54/2.72  (step t247 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t245 t246))
% 2.54/2.72  (step t248 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))))) :rule implies_neg2)
% 2.54/2.72  (step t249 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))))) :rule resolution :premises (t247 t248))
% 2.54/2.72  (step t250 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))))) :rule contraction :premises (t249))
% 2.54/2.72  (step t251 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) :rule implies :premises (t250))
% 2.54/2.72  (step t252 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule equiv_pos2)
% 2.54/2.72  (anchor :step t253 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.54/2.72  (step t253.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t253.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t253.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 2.54/2.72  (step t253.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.54/2.72  (step t253.t5 (cl (= (= (tptp.tl (tptp.cons U V)) V) (= V (tptp.tl (tptp.cons U V))))) :rule all_simplify)
% 2.54/2.72  (step t253.t6 (cl (= (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule cong :premises (t253.t3 t253.t4 t253.t5))
% 2.54/2.72  (step t253 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) :rule bind)
% 2.54/2.72  (step t254 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule resolution :premises (t252 t253 a95))
% 2.54/2.72  (step t255 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t251 t254))
% 2.54/2.72  (step t256 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t244 a7 t211 t255))
% 2.54/2.72  (step t257 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule or_pos)
% 2.54/2.72  (step t258 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule reordering :premises (t257))
% 2.54/2.72  (step t259 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t260)
% 2.54/2.72  (assume t260.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 2.54/2.72  (step t260.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 2.54/2.72  (step t260.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule or :premises (t260.t1))
% 2.54/2.72  (step t260.t3 (cl (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t260.t2 t260.a0))
% 2.54/2.72  (step t260 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule subproof :discharge (t260.a0))
% 2.54/2.72  (step t261 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t259 t260))
% 2.54/2.72  (step t262 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule implies_neg2)
% 2.54/2.72  (step t263 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule resolution :premises (t261 t262))
% 2.54/2.72  (step t264 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule contraction :premises (t263))
% 2.54/2.72  (step t265 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule implies :premises (t264))
% 2.54/2.72  (step t266 (cl (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t265 a11))
% 2.54/2.72  (step t267 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t268)
% 2.54/2.72  (assume t268.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 2.54/2.72  (step t268.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 2.54/2.72  (step t268.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule or :premises (t268.t1))
% 2.54/2.72  (step t268.t3 (cl (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t268.t2 t268.a0))
% 2.54/2.72  (step t268 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule subproof :discharge (t268.a0))
% 2.54/2.72  (step t269 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t267 t268))
% 2.54/2.72  (step t270 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule implies_neg2)
% 2.54/2.72  (step t271 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t269 t270))
% 2.54/2.72  (step t272 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t271))
% 2.54/2.72  (step t273 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule implies :premises (t272))
% 2.54/2.72  (step t274 (cl (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t273 a12))
% 2.54/2.72  (step t275 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t276)
% 2.54/2.72  (assume t276.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 2.54/2.72  (step t276.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk2)) (:= V (tptp.skaf82 tptp.sk2))))
% 2.54/2.72  (step t276.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule or :premises (t276.t1))
% 2.54/2.72  (step t276.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t276.t2 t276.a0))
% 2.54/2.72  (step t276 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule subproof :discharge (t276.a0))
% 2.54/2.72  (step t277 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t275 t276))
% 2.54/2.72  (step t278 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule implies_neg2)
% 2.54/2.72  (step t279 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule resolution :premises (t277 t278))
% 2.54/2.72  (step t280 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule contraction :premises (t279))
% 2.54/2.72  (step t281 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies :premises (t280))
% 2.54/2.72  (step t282 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t281 t240))
% 2.54/2.72  (step t283 (cl (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t258 t266 t274 t282))
% 2.54/2.72  (step t284 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a191))
% 2.54/2.72  (step t285 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule and_neg)
% 2.54/2.72  (step t286 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t287)
% 2.54/2.72  (assume t287.a0 (= tptp.sk2 tptp.sk4))
% 2.54/2.72  (assume t287.a1 (= tptp.nil tptp.sk2))
% 2.54/2.72  (step t287.t1 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t287.t2)
% 2.54/2.72  (assume t287.t2.a0 (= tptp.sk2 tptp.sk4))
% 2.54/2.72  (assume t287.t2.a1 (= tptp.nil tptp.sk2))
% 2.54/2.72  (step t287.t2.t1 (cl (= tptp.sk2 tptp.nil)) :rule symm :premises (t287.t2.a1))
% 2.54/2.72  (step t287.t2.t2 (cl (= tptp.nil tptp.sk2)) :rule symm :premises (t287.t2.t1))
% 2.54/2.72  (step t287.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t287.t2.a0))
% 2.54/2.72  (step t287.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t287.t2.t3))
% 2.54/2.72  (step t287.t2.t5 (cl (= tptp.nil tptp.sk4)) :rule trans :premises (t287.t2.t2 t287.t2.t4))
% 2.54/2.72  (step t287.t2 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule subproof :discharge (t287.t2.a0 t287.t2.a1))
% 2.54/2.72  (step t287.t3 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.54/2.72  (step t287.t4 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 2.54/2.72  (step t287.t5 (cl (= tptp.nil tptp.sk4) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t287.t2 t287.t3 t287.t4))
% 2.54/2.72  (step t287.t6 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule reordering :premises (t287.t5))
% 2.54/2.72  (step t287.t7 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule contraction :premises (t287.t6))
% 2.54/2.72  (step t287.t8 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t287.t1 t287.t7))
% 2.54/2.72  (step t287.t9 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule implies_neg2)
% 2.54/2.72  (step t287.t10 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t287.t8 t287.t9))
% 2.54/2.72  (step t287.t11 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule contraction :premises (t287.t10))
% 2.54/2.72  (step t287.t12 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule implies :premises (t287.t11))
% 2.54/2.72  (step t287.t13 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule and_neg)
% 2.54/2.72  (step t287.t14 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule resolution :premises (t287.t13 t287.a0 t287.a1))
% 2.54/2.72  (step t287.t15 (cl (= tptp.nil tptp.sk4)) :rule resolution :premises (t287.t12 t287.t14))
% 2.54/2.72  (step t287 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule subproof :discharge (t287.a0 t287.a1))
% 2.54/2.72  (step t288 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.54/2.72  (step t289 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 2.54/2.72  (step t290 (cl (= tptp.nil tptp.sk4) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t287 t288 t289))
% 2.54/2.72  (step t291 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule reordering :premises (t290))
% 2.54/2.72  (step t292 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule contraction :premises (t291))
% 2.54/2.72  (step t293 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t286 t292))
% 2.54/2.72  (step t294 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule implies_neg2)
% 2.54/2.72  (step t295 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t293 t294))
% 2.54/2.72  (step t296 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule contraction :premises (t295))
% 2.54/2.72  (step t297 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule implies :premises (t296))
% 2.54/2.72  (step t298 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t285 t297))
% 2.54/2.72  (step t299 (cl (= tptp.nil tptp.sk4) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule reordering :premises (t298))
% 2.54/2.72  (step t300 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (not (= tptp.nil tptp.sk1))) (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1))))) (not (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (not (= tptp.nil tptp.sk1)))) (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1)))) :rule equiv_pos2)
% 2.54/2.72  (step t301 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 2.54/2.72  (step t302 (cl (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk1)))) :rule refl)
% 2.54/2.72  (step t303 (cl (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (not (= tptp.nil tptp.sk1))) (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1))))) :rule cong :premises (t301 t302))
% 2.54/2.72  (step t304 (cl (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t300 t303 a198))
% 2.54/2.72  (step t305 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1))) :rule or :premises (t304))
% 2.54/2.72  (step t306 (cl (not (= tptp.nil tptp.sk1)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t305))
% 2.54/2.72  (step t307 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (= tptp.nil tptp.sk2)) (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk2)))) (not (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (= tptp.nil tptp.sk2))) (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk2))) :rule equiv_pos2)
% 2.54/2.72  (step t308 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule refl)
% 2.54/2.72  (step t309 (cl (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2) (= tptp.nil tptp.sk2)) (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk2)))) :rule cong :premises (t301 t308))
% 2.54/2.72  (step t310 (cl (or (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk2))) :rule resolution :premises (t307 t309 a195))
% 2.54/2.72  (step t311 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk2)) :rule or :premises (t310))
% 2.54/2.72  (step t312 (cl (= tptp.nil tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t311))
% 2.54/2.72  (step t313 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t284 t58 a190 t299 a189 t306 t312))
% 2.54/2.72  (step t314 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t313))
% 2.54/2.72  (step t315 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (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)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule or_pos)
% 2.54/2.72  (step t316 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule reordering :premises (t315))
% 2.54/2.72  (step t317 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (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))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t318)
% 2.54/2.72  (assume t318.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 2.54/2.72  (step t318.t1 (cl (or (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V (tptp.cons tptp.sk5 tptp.nil))))
% 2.54/2.72  (step t318.t2 (cl (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule or :premises (t318.t1))
% 2.54/2.72  (step t318.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t318.t2 t318.a0))
% 2.54/2.72  (step t318 (cl (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule subproof :discharge (t318.a0))
% 2.54/2.72  (step t319 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t317 t318))
% 2.54/2.72  (step t320 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule implies_neg2)
% 2.54/2.72  (step t321 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule resolution :premises (t319 t320))
% 2.54/2.72  (step t322 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule contraction :premises (t321))
% 2.54/2.72  (step t323 (cl (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule implies :premises (t322))
% 2.54/2.72  (step t324 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t323 a132))
% 2.54/2.72  (step t325 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (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)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule or_pos)
% 2.54/2.72  (step t326 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (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))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule reordering :premises (t325))
% 2.54/2.72  (step t327 (cl (not (= (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))))) (not (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule equiv_pos2)
% 2.54/2.72  (step t328 (cl (= (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)))) (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)))))) :rule refl)
% 2.54/2.72  (step t329 (cl (= (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)))) :rule refl)
% 2.54/2.72  (step t330 (cl (= (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule refl)
% 2.54/2.72  (step t331 (cl (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule refl)
% 2.54/2.72  (step t332 (cl (= (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule all_simplify)
% 2.54/2.72  (step t333 (cl (= (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule cong :premises (t329 t330 t331 t332))
% 2.54/2.72  (step t334 (cl (= (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))))) :rule cong :premises (t328 t333))
% 2.54/2.72  (step t335 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (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))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t336)
% 2.54/2.72  (assume t336.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 2.54/2.72  (step t336.t1 (cl (or (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V (tptp.cons tptp.sk5 tptp.nil))))
% 2.54/2.72  (step t336.t2 (cl (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t336.t1))
% 2.54/2.72  (step t336.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t336.t2 t336.a0))
% 2.54/2.72  (step t336 (cl (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t336.a0))
% 2.54/2.72  (step t337 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t335 t336))
% 2.54/2.72  (step t338 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 2.54/2.72  (step t339 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t337 t338))
% 2.54/2.72  (step t340 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t339))
% 2.54/2.72  (step t341 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule resolution :premises (t327 t334 t340))
% 2.54/2.72  (step t342 (cl (not (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))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule implies :premises (t341))
% 2.54/2.72  (step t343 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t342 a122))
% 2.54/2.72  (step t344 (cl (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))) :rule or_pos)
% 2.54/2.72  (step t345 (cl (not (tptp.ssList tptp.sk8)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))))) :rule reordering :premises (t344))
% 2.54/2.72  (step t346 (cl (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) :rule or_pos)
% 2.54/2.72  (step t347 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule reordering :premises (t346))
% 2.54/2.72  (step t348 (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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 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)
% 2.54/2.72  (anchor :step t349)
% 2.54/2.72  (assume t349.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.54/2.72  (step t349.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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 2.54/2.72  (step t349.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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule or :premises (t349.t1))
% 2.54/2.72  (step t349.t3 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t349.t2 t349.a0))
% 2.54/2.72  (step t349 (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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule subproof :discharge (t349.a0))
% 2.54/2.72  (step t350 (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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t348 t349))
% 2.54/2.72  (step t351 (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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule implies_neg2)
% 2.54/2.72  (step t352 (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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t350 t351))
% 2.54/2.72  (step t353 (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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule contraction :premises (t352))
% 2.54/2.72  (step t354 (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.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule implies :premises (t353))
% 2.54/2.72  (step t355 (cl (or (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t354 a85))
% 2.54/2.72  (step t356 (cl (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) :rule resolution :premises (t347 a7 t211 t355))
% 2.54/2.72  (step t357 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) (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))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t358)
% 2.54/2.72  (assume t358.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 2.54/2.72  (step t358.t1 (cl (or (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))))) :rule forall_inst :args ((:= U tptp.sk8) (:= V (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.72  (step t358.t2 (cl (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) :rule or :premises (t358.t1))
% 2.54/2.72  (step t358.t3 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t358.t2 t358.a0))
% 2.54/2.72  (step t358 (cl (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) :rule subproof :discharge (t358.a0))
% 2.54/2.72  (step t359 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t357 t358))
% 2.54/2.72  (step t360 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))))) :rule implies_neg2)
% 2.54/2.72  (step t361 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))))) :rule resolution :premises (t359 t360))
% 2.54/2.72  (step t362 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8))))) :rule contraction :premises (t361))
% 2.54/2.72  (step t363 (cl (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) :rule implies :premises (t362))
% 2.54/2.72  (step t364 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.app (tptp.tl (tptp.cons tptp.sk7 tptp.nil)) tptp.sk8)))) :rule resolution :premises (t363 a132))
% 2.54/2.72  (step t365 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 2.54/2.72  (step t366 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk7)) (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t365))
% 2.54/2.72  (step t367 (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (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)
% 2.54/2.72  (anchor :step t368)
% 2.54/2.72  (assume t368.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.54/2.72  (step t368.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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk7) (:= V tptp.nil)))
% 2.54/2.72  (step t368.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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t368.t1))
% 2.54/2.72  (step t368.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t368.t2 t368.a0))
% 2.54/2.72  (step t368 (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t368.a0))
% 2.54/2.72  (step t369 (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t367 t368))
% 2.54/2.72  (step t370 (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 2.54/2.72  (step t371 (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t369 t370))
% 2.54/2.72  (step t372 (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t371))
% 2.54/2.72  (step t373 (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.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t372))
% 2.54/2.72  (step t374 (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)
% 2.54/2.72  (anchor :step t375 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.54/2.72  (step t375.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t375.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t375.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 2.54/2.72  (step t375.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t375.t3))
% 2.54/2.72  (step t375.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 2.54/2.72  (step t375.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.54/2.72  (step t375.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 (t375.t4 t375.t5 t375.t6))
% 2.54/2.72  (step t375 (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)
% 2.54/2.72  (step t376 (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 (t374 t375 a97))
% 2.54/2.72  (step t377 (cl (or (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssItem tptp.sk7)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t373 t376))
% 2.54/2.72  (step t378 (cl (not (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule resolution :premises (t366 a7 t211 t377))
% 2.54/2.72  (step t379 (cl (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) :rule or_pos)
% 2.54/2.72  (step t380 (cl (not (tptp.ssList tptp.sk8)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))))) :rule reordering :premises (t379))
% 2.54/2.72  (step t381 (cl (not (= (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))))) (not (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))))) :rule equiv_pos2)
% 2.54/2.72  (step t382 (cl (= (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk8)))) :rule refl)
% 2.54/2.72  (step t383 (cl (= (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))))) :rule refl)
% 2.54/2.72  (step t384 (cl (= (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)))) :rule refl)
% 2.54/2.72  (step t385 (cl (= (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))) :rule all_simplify)
% 2.54/2.72  (step t386 (cl (= (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))))) :rule cong :premises (t382 t383 t384 t385))
% 2.54/2.72  (step t387 (cl (= (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))))) :rule cong :premises (t328 t386))
% 2.54/2.72  (step t388 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (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))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t389)
% 2.54/2.72  (assume t389.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 2.54/2.72  (step t389.t1 (cl (or (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk8) (:= V (tptp.cons tptp.sk7 tptp.nil))))
% 2.54/2.72  (step t389.t2 (cl (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule or :premises (t389.t1))
% 2.54/2.72  (step t389.t3 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t389.t2 t389.a0))
% 2.54/2.72  (step t389 (cl (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule subproof :discharge (t389.a0))
% 2.54/2.72  (step t390 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) :rule resolution :premises (t388 t389))
% 2.54/2.72  (step t391 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (not (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule implies_neg2)
% 2.54/2.72  (step t392 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil))))) (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule resolution :premises (t390 t391))
% 2.54/2.72  (step t393 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (tptp.hd (tptp.cons tptp.sk7 tptp.nil)))))) :rule contraction :premises (t392))
% 2.54/2.72  (step t394 (cl (=> (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)))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))))) :rule resolution :premises (t381 t387 t393))
% 2.54/2.72  (step t395 (cl (not (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))))) (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))) :rule implies :premises (t394))
% 2.54/2.72  (step t396 (cl (or (not (tptp.ssList tptp.sk8)) (not (tptp.ssList (tptp.cons tptp.sk7 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk7 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk7 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))))) :rule resolution :premises (t395 a122))
% 2.54/2.72  (step t397 (cl (not (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))) :rule or_pos)
% 2.54/2.72  (step t398 (cl (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)) (not (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))))) :rule reordering :premises (t397))
% 2.54/2.72  (step t399 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t400)
% 2.54/2.72  (assume t400.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 2.54/2.72  (step t400.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))))) :rule forall_inst :args ((:= U tptp.sk8)))
% 2.54/2.72  (step t400.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) :rule or :premises (t400.t1))
% 2.54/2.72  (step t400.t3 (cl (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) :rule resolution :premises (t400.t2 t400.a0))
% 2.54/2.72  (step t400 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) :rule subproof :discharge (t400.a0))
% 2.54/2.72  (step t401 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) :rule resolution :premises (t399 t400))
% 2.54/2.72  (step t402 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) (not (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))))) :rule implies_neg2)
% 2.54/2.72  (step t403 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))))) :rule resolution :premises (t401 t402))
% 2.54/2.72  (step t404 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8))))) :rule contraction :premises (t403))
% 2.54/2.72  (step t405 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) :rule implies :premises (t404))
% 2.54/2.72  (step t406 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 2.54/2.72  (anchor :step t407 :args ((U $$unsorted) (:= U U)))
% 2.54/2.72  (step t407.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t407.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.54/2.72  (step t407.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 2.54/2.72  (step t407.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule cong :premises (t407.t2 t407.t3))
% 2.54/2.72  (step t407 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 2.54/2.72  (step t408 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t406 t407 a73))
% 2.54/2.72  (step t409 (cl (or (not (tptp.ssList tptp.sk8)) (= tptp.sk8 (tptp.app tptp.nil tptp.sk8)))) :rule resolution :premises (t405 t408))
% 2.54/2.72  (step t410 (cl (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule or_pos)
% 2.54/2.72  (step t411 (cl (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule reordering :premises (t410))
% 2.54/2.72  (step t412 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t413)
% 2.54/2.72  (assume t413.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 2.54/2.72  (step t413.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 2.54/2.72  (step t413.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule or :premises (t413.t1))
% 2.54/2.72  (step t413.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t413.t2 t413.a0))
% 2.54/2.72  (step t413 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule subproof :discharge (t413.a0))
% 2.54/2.72  (step t414 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t412 t413))
% 2.54/2.72  (step t415 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule implies_neg2)
% 2.54/2.72  (step t416 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t414 t415))
% 2.54/2.72  (step t417 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule contraction :premises (t416))
% 2.54/2.72  (step t418 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies :premises (t417))
% 2.54/2.72  (step t419 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t418 t408))
% 2.54/2.72  (step t420 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssList tptp.sk6))) :rule resolution :premises (t90 t228 t242 t256 t283 t314 a190 a189 t316 t324 t326 t343 t345 t356 t364 t378 t380 t356 t396 t378 t398 t409 t411 t419))
% 2.54/2.72  (step t421 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) (not (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList tptp.sk8))) :rule contraction :premises (t420))
% 2.54/2.72  (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)
% 2.54/2.72  (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))
% 2.54/2.72  (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)
% 2.54/2.72  (anchor :step t425)
% 2.54/2.72  (assume t425.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.54/2.72  (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)))
% 2.54/2.72  (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))
% 2.54/2.72  (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))
% 2.54/2.72  (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))
% 2.54/2.72  (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))
% 2.54/2.72  (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)
% 2.54/2.72  (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))
% 2.54/2.72  (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))
% 2.54/2.72  (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))
% 2.54/2.72  (step t431 (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 t376))
% 2.54/2.72  (step t432 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 2.54/2.72  (step t433 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t432))
% 2.54/2.72  (step t434 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t435)
% 2.54/2.72  (assume t435.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 2.54/2.72  (step t435.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 2.54/2.72  (step t435.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t435.t1))
% 2.54/2.72  (step t435.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t435.t2 t435.a0))
% 2.54/2.72  (step t435 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t435.a0))
% 2.54/2.72  (step t436 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t434 t435))
% 2.54/2.72  (step t437 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 2.54/2.72  (step t438 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t436 t437))
% 2.54/2.72  (step t439 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t438))
% 2.54/2.72  (step t440 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t439))
% 2.54/2.72  (step t441 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t440 t240))
% 2.54/2.72  (step t442 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 2.54/2.72  (step t443 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t442))
% 2.54/2.72  (step t444 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t445)
% 2.54/2.72  (assume t445.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))
% 2.54/2.72  (step t445.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 2.54/2.72  (step t445.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t445.t1))
% 2.54/2.72  (step t445.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t445.t2 t445.a0))
% 2.54/2.72  (step t445 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t445.a0))
% 2.54/2.72  (step t446 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t444 t445))
% 2.54/2.72  (step t447 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 2.54/2.72  (step t448 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t446 t447))
% 2.54/2.72  (step t449 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t448))
% 2.54/2.72  (step t450 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t449))
% 2.54/2.72  (step t451 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t450 t254))
% 2.54/2.72  (step t452 (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)
% 2.54/2.72  (anchor :step t453)
% 2.54/2.72  (assume t453.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.54/2.72  (step t453.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)))
% 2.54/2.72  (step t453.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 (t453.t1))
% 2.54/2.72  (step t453.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t453.t2 t453.a0))
% 2.54/2.72  (step t453 (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 (t453.a0))
% 2.54/2.72  (step t454 (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 (t452 t453))
% 2.54/2.72  (step t455 (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)
% 2.54/2.72  (step t456 (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 (t454 t455))
% 2.54/2.72  (step t457 (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 (t456))
% 2.54/2.72  (step t458 (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 (t457))
% 2.54/2.72  (step t459 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t458 a85))
% 2.54/2.72  (step t460 (cl (not (= (or (= (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 2.54/2.72  (step t461 (cl (= (= (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))))) :rule all_simplify)
% 2.54/2.72  (step t462 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 2.54/2.72  (step t463 (cl (= (or (= (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t461 t462))
% 2.54/2.72  (step t464 (cl (or (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t460 t463 a203))
% 2.54/2.72  (step t465 (cl (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t464))
% 2.54/2.72  (step t466 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk8 (tptp.cons tptp.sk7 tptp.nil)))) :rule reordering :premises (t465))
% 2.54/2.72  (step t467 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 2.54/2.72  (step t468 (cl (= (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)))) :rule all_simplify)
% 2.54/2.72  (step t469 (cl (= (or (= (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t468 t462))
% 2.54/2.72  (step t470 (cl (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t467 t469 a202))
% 2.54/2.72  (step t471 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t470))
% 2.54/2.72  (step t472 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk7 tptp.nil) tptp.sk8))) :rule reordering :premises (t471))
% 2.54/2.72  (step t473 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t421 t423 t431 a7 t433 t441 a7 t443 t451 a7 t21 t459 a7 t466 t472))
% 2.54/2.72  (step t474 (cl (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk8)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t473))
% 2.54/2.72  (step t475 (cl (tptp.ssList tptp.sk8) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a201))
% 2.54/2.72  (step t476 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk8)) :rule reordering :premises (t475))
% 2.54/2.72  (step t477 (cl (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)) :rule or_pos)
% 2.54/2.72  (step t478 (cl (= tptp.nil tptp.sk2) (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule reordering :premises (t477))
% 2.54/2.72  (step t479 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t480)
% 2.54/2.72  (assume t480.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))
% 2.54/2.72  (step t480.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 2.54/2.72  (step t480.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule or :premises (t480.t1))
% 2.54/2.72  (step t480.t3 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t480.t2 t480.a0))
% 2.54/2.72  (step t480 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule subproof :discharge (t480.a0))
% 2.54/2.72  (step t481 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t479 t480))
% 2.54/2.72  (step t482 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule implies_neg2)
% 2.54/2.72  (step t483 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t481 t482))
% 2.54/2.72  (step t484 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule contraction :premises (t483))
% 2.54/2.72  (step t485 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule implies :premises (t484))
% 2.54/2.72  (step t486 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule equiv_pos2)
% 2.54/2.72  (anchor :step t487 :args ((U $$unsorted) (:= U U)))
% 2.54/2.72  (step t487.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t487.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.54/2.72  (step t487.t3 (cl (= (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))))) :rule all_simplify)
% 2.54/2.72  (step t487.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 2.54/2.72  (step t487.t5 (cl (= (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule cong :premises (t487.t2 t487.t3 t487.t4))
% 2.54/2.72  (step t487 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) :rule bind)
% 2.54/2.72  (step t488 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule resolution :premises (t486 t487 a108))
% 2.54/2.72  (step t489 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t485 t488))
% 2.54/2.72  (step t490 (cl (not (= (or (not (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk1)) (= tptp.nil tptp.sk2)) (or (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil tptp.sk2)))) (not (or (not (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk1)) (= tptp.nil tptp.sk2))) (or (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil tptp.sk2))) :rule equiv_pos2)
% 2.54/2.72  (step t491 (cl (= (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk1) (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule all_simplify)
% 2.54/2.72  (step t492 (cl (= (not (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk1)) (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule cong :premises (t491))
% 2.54/2.72  (step t493 (cl (= (or (not (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk1)) (= tptp.nil tptp.sk2)) (or (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil tptp.sk2)))) :rule cong :premises (t492 t308))
% 2.54/2.72  (step t494 (cl (or (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t490 t493 a196))
% 2.54/2.72  (step t495 (cl (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.nil tptp.sk2)) :rule or :premises (t494))
% 2.54/2.72  (step t496 (cl (= tptp.nil tptp.sk2) (not (= tptp.sk1 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t495))
% 2.54/2.72  (step t497 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)) :rule resolution :premises (t474 t476 t478 t489 a186 t496))
% 2.54/2.72  (step t498 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.nil tptp.sk2)) :rule contraction :premises (t497))
% 2.54/2.72  (step t499 (cl (tptp.ssList tptp.sk6) (= tptp.nil tptp.sk2)) :rule or :premises (a194))
% 2.54/2.72  (step t500 (cl (= tptp.nil tptp.sk2) (tptp.ssList tptp.sk6)) :rule reordering :premises (t499))
% 2.54/2.72  (step t501 (cl (tptp.ssItem tptp.sk5) (= tptp.nil tptp.sk2)) :rule or :premises (a192))
% 2.54/2.72  (step t502 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)) :rule resolution :premises (t498 t500 t501))
% 2.54/2.72  (step t503 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.nil tptp.sk2)) :rule contraction :premises (t502))
% 2.54/2.72  (step t504 (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)
% 2.54/2.72  (step t505 (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 (t504))
% 2.54/2.72  (step t506 (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)
% 2.54/2.72  (anchor :step t507)
% 2.54/2.72  (assume t507.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 2.54/2.72  (step t507.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)))
% 2.54/2.72  (step t507.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 (t507.t1))
% 2.54/2.72  (step t507.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 (t507.t2 t507.a0))
% 2.54/2.72  (step t507 (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 (t507.a0))
% 2.54/2.72  (step t508 (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 (t506 t507))
% 2.54/2.72  (step t509 (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)
% 2.54/2.72  (step t510 (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 (t508 t509))
% 2.54/2.72  (step t511 (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 (t510))
% 2.54/2.72  (step t512 (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 (t511))
% 2.54/2.72  (step t513 (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)
% 2.54/2.72  (anchor :step t514 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.54/2.72  (step t514.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t514.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t514.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.54/2.72  (step t514.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.54/2.72  (step t514.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 2.54/2.72  (step t514.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 2.54/2.72  (step t514.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 (t514.t3 t514.t4 t514.t5 t514.t6))
% 2.54/2.72  (step t514 (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)
% 2.54/2.72  (step t515 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t513 t514 a99))
% 2.54/2.72  (step t516 (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 (t512 t515))
% 2.54/2.72  (step t517 (cl (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)) :rule resolution :premises (t503 t505 t516 a188 a7 t299 a189))
% 2.54/2.72  (step t518 (cl (= tptp.nil tptp.sk4)) :rule contraction :premises (t517))
% 2.54/2.72  (step t519 (cl (= tptp.nil tptp.sk3)) :rule resolution :premises (t59 t518))
% 2.54/2.72  (step t520 (cl (= tptp.nil tptp.sk1)) :rule resolution :premises (t58 a190 t519))
% 2.54/2.72  (step t521 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t22 t520))
% 2.54/2.72  (step t522 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t21 a7 t521 t459))
% 2.54/2.72  (step t523 (cl (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t423 a7 t521 t431))
% 2.54/2.72  (step t524 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t525)
% 2.54/2.72  (assume t525.a0 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.54/2.72  (step t525.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (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))))
% 2.54/2.72  (step t525.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t525.t1))
% 2.54/2.72  (step t525.t3 (cl (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t525.t2 t525.a0))
% 2.54/2.72  (step t525 (cl (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t525.a0))
% 2.54/2.72  (step t526 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t524 t525))
% 2.54/2.72  (step t527 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 2.54/2.72  (step t528 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t526 t527))
% 2.54/2.72  (step t529 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t528))
% 2.54/2.72  (step t530 (cl (not (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t529))
% 2.54/2.72  (step t531 (cl (or (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t530 a83))
% 2.54/2.72  (step t532 (cl (not (tptp.frontsegP tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t19 t522 t523 t531))
% 2.54/2.72  (step t533 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 2.54/2.72  (step t534 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t533))
% 2.54/2.72  (step t535 (cl (tptp.ssList tptp.sk6) (not (= tptp.nil tptp.sk1))) :rule or :premises (a197))
% 2.54/2.72  (step t536 (cl (not (= tptp.nil tptp.sk1)) (tptp.ssList tptp.sk6)) :rule reordering :premises (t535))
% 2.54/2.72  (step t537 (cl (tptp.ssList tptp.sk6)) :rule resolution :premises (t536 t520))
% 2.54/2.72  (step t538 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_neg)
% 2.54/2.72  (step t539 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t540)
% 2.54/2.72  (assume t540.a0 (tptp.ssList tptp.sk2))
% 2.54/2.72  (assume t540.a1 (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 2.54/2.72  (step t540.t1 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t540.t2)
% 2.54/2.72  (assume t540.t2.a0 (tptp.ssList tptp.sk2))
% 2.54/2.72  (assume t540.t2.a1 (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 2.54/2.72  (step t540.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) true) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule equiv_simplify)
% 2.54/2.72  (step t540.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) true)) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule equiv1 :premises (t540.t2.t1))
% 2.54/2.72  (step t540.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2)) :rule symm :premises (t540.t2.a1))
% 2.54/2.72  (step t540.t2.t4 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t540.t2.t3))
% 2.54/2.72  (step t540.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2)) :rule symm :premises (t540.t2.t4))
% 2.54/2.72  (step t540.t2.t6 (cl (= (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList tptp.sk2))) :rule cong :premises (t540.t2.t5))
% 2.54/2.72  (step t540.t2.t7 (cl (= (= (tptp.ssList tptp.sk2) true) (tptp.ssList tptp.sk2))) :rule equiv_simplify)
% 2.54/2.72  (step t540.t2.t8 (cl (= (tptp.ssList tptp.sk2) true) (not (tptp.ssList tptp.sk2))) :rule equiv2 :premises (t540.t2.t7))
% 2.54/2.72  (step t540.t2.t9 (cl (= (tptp.ssList tptp.sk2) true)) :rule resolution :premises (t540.t2.t8 t540.t2.a0))
% 2.54/2.72  (step t540.t2.t10 (cl (= (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) true)) :rule trans :premises (t540.t2.t6 t540.t2.t9))
% 2.54/2.72  (step t540.t2.t11 (cl (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t540.t2.t2 t540.t2.t10))
% 2.54/2.72  (step t540.t2 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t540.t2.a0 t540.t2.a1))
% 2.54/2.72  (step t540.t3 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 2.54/2.72  (step t540.t4 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 2.54/2.72  (step t540.t5 (cl (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t540.t2 t540.t3 t540.t4))
% 2.54/2.72  (step t540.t6 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t540.t5))
% 2.54/2.72  (step t540.t7 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t540.t6))
% 2.54/2.72  (step t540.t8 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t540.t1 t540.t7))
% 2.54/2.72  (step t540.t9 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 2.54/2.72  (step t540.t10 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t540.t8 t540.t9))
% 2.54/2.72  (step t540.t11 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t540.t10))
% 2.54/2.72  (step t540.t12 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t540.t11))
% 2.54/2.72  (step t540.t13 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_neg)
% 2.54/2.72  (step t540.t14 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t540.t13 t540.a0 t540.a1))
% 2.54/2.72  (step t540.t15 (cl (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t540.t12 t540.t14))
% 2.54/2.72  (step t540 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t540.a0 t540.a1))
% 2.54/2.72  (step t541 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 2.54/2.72  (step t542 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 2.54/2.72  (step t543 (cl (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t540 t541 t542))
% 2.54/2.72  (step t544 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t543))
% 2.54/2.72  (step t545 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t544))
% 2.54/2.72  (step t546 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t539 t545))
% 2.54/2.72  (step t547 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 2.54/2.72  (step t548 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t546 t547))
% 2.54/2.72  (step t549 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t548))
% 2.54/2.72  (step t550 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t549))
% 2.54/2.72  (step t551 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t538 t550))
% 2.54/2.72  (step t552 (cl (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t551 a186 t314))
% 2.54/2.72  (step t553 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule implies_neg1)
% 2.54/2.72  (anchor :step t554)
% 2.54/2.72  (assume t554.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))
% 2.54/2.72  (step t554.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk6)))
% 2.54/2.72  (step t554.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t554.t1))
% 2.54/2.72  (step t554.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t554.t2 t554.a0))
% 2.54/2.72  (step t554 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t554.a0))
% 2.54/2.72  (step t555 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t553 t554))
% 2.54/2.72  (step t556 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 2.54/2.72  (step t557 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t555 t556))
% 2.54/2.72  (step t558 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t557))
% 2.54/2.72  (step t559 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t558))
% 2.54/2.72  (step t560 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule equiv_pos2)
% 2.54/2.72  (anchor :step t561 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 2.54/2.72  (step t561.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t561.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t561.t3 (cl (= W W)) :rule refl)
% 2.54/2.72  (step t561.t4 (cl (= (= (tptp.app U V) W) (= W (tptp.app U V)))) :rule all_simplify)
% 2.54/2.72  (step t561.t5 (cl (= (not (= (tptp.app U V) W)) (not (= W (tptp.app U V))))) :rule cong :premises (t561.t4))
% 2.54/2.72  (step t561.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.54/2.72  (step t561.t7 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.54/2.72  (step t561.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.54/2.72  (step t561.t9 (cl (= (tptp.frontsegP W U) (tptp.frontsegP W U))) :rule refl)
% 2.54/2.72  (step t561.t10 (cl (= (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)))) :rule cong :premises (t561.t5 t561.t6 t561.t7 t561.t8 t561.t9))
% 2.54/2.72  (step t561 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))) :rule bind)
% 2.54/2.72  (step t562 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule all_simplify)
% 2.54/2.72  (anchor :step t563 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.54/2.72  (step t563.t1 (cl (= U U)) :rule refl)
% 2.54/2.72  (step t563.t2 (cl (= V V)) :rule refl)
% 2.54/2.72  (step t563.t3 (cl (= (= (tptp.app U V) (tptp.app U V)) true)) :rule all_simplify)
% 2.54/2.72  (step t563.t4 (cl (= (not (= (tptp.app U V) (tptp.app U V))) (not true))) :rule cong :premises (t563.t3))
% 2.54/2.72  (step t563.t5 (cl (= (not true) false)) :rule all_simplify)
% 2.54/2.72  (step t563.t6 (cl (= (not (= (tptp.app U V) (tptp.app U V))) false)) :rule trans :premises (t563.t4 t563.t5))
% 2.54/2.72  (step t563.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.54/2.72  (step t563.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.54/2.72  (step t563.t9 (cl (= (not (tptp.ssList (tptp.app U V))) (not (tptp.ssList (tptp.app U V))))) :rule refl)
% 2.54/2.72  (step t563.t10 (cl (= (tptp.frontsegP (tptp.app U V) U) (tptp.frontsegP (tptp.app U V) U))) :rule refl)
% 2.54/2.72  (step t563.t11 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule cong :premises (t563.t6 t563.t7 t563.t8 t563.t9 t563.t10))
% 2.54/2.72  (step t563.t12 (cl (= (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule all_simplify)
% 2.54/2.72  (step t563.t13 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule trans :premises (t563.t11 t563.t12))
% 2.54/2.72  (step t563 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule bind)
% 2.54/2.72  (step t564 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t562 t563))
% 2.54/2.72  (step t565 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t561 t564))
% 2.54/2.72  (step t566 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule resolution :premises (t560 t565 a143))
% 2.54/2.72  (step t567 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t559 t566))
% 2.54/2.72  (step t568 (cl (tptp.frontsegP (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t534 t537 t522 t552 t567))
% 2.54/2.72  (step t569 (cl) :rule resolution :premises (t17 t532 t568 t518 t314 a189))
% 2.54/2.72  
% 2.54/2.73  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.azV6HVz3iO/cvc5---1.0.5_24318.smt2
% 2.54/2.74  % cvc5---1.0.5 exiting
% 2.54/2.74  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------