TSTP Solution File: SWC316-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC316-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n014.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:29 EDT 2024
% Result : Unsatisfiable 0.42s 0.72s
% Output : Proof 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.16 % Problem : SWC316-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.18 % Command : do_cvc5 %s %d
% 0.18/0.41 % Computer : n014.cluster.edu
% 0.18/0.41 % Model : x86_64 x86_64
% 0.18/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.41 % Memory : 8042.1875MB
% 0.18/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.41 % CPULimit : 300
% 0.18/0.41 % WCLimit : 300
% 0.18/0.41 % DateTime : Sun May 26 15:37:24 EDT 2024
% 0.18/0.41 % CPUTime :
% 0.27/0.58 %----Proving TF0_NAR, FOF, or CNF
% 0.42/0.59 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.42/0.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.fgqQlSWVbF/cvc5---1.0.5_30063.smt2
% 0.42/0.72 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.fgqQlSWVbF/cvc5---1.0.5_30063.smt2
% 0.42/0.81 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.42/0.81 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.42/0.81 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.42/0.81 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.42/0.81 (assume a4 (tptp.strictorderP tptp.nil))
% 0.42/0.81 (assume a5 (tptp.totalorderP tptp.nil))
% 0.42/0.81 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.42/0.81 (assume a7 (tptp.ssList tptp.nil))
% 0.42/0.81 (assume a8 (tptp.ssItem tptp.skac3))
% 0.42/0.81 (assume a9 (tptp.ssItem tptp.skac2))
% 0.42/0.81 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.42/0.81 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.42/0.81 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.42/0.81 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.42/0.81 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.42/0.81 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.42/0.81 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.42/0.81 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.42/0.81 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.42/0.81 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.42/0.81 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.42/0.81 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.42/0.81 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.42/0.81 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.42/0.81 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.42/0.81 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.42/0.81 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.42/0.81 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.42/0.81 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.42/0.81 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.42/0.81 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.42/0.81 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.42/0.81 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.42/0.81 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.42/0.81 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.42/0.81 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.42/0.81 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.42/0.81 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.42/0.81 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.42/0.81 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.42/0.81 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.42/0.81 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.42/0.81 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.42/0.81 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.42/0.81 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.42/0.81 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.42/0.81 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.42/0.81 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.42/0.81 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.42/0.81 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.42/0.81 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.42/0.81 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.42/0.81 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.42/0.81 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.42/0.81 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.42/0.81 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.42/0.81 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.42/0.81 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.42/0.81 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.42/0.81 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.42/0.81 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.42/0.81 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.42/0.81 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.42/0.81 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.42/0.81 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.42/0.81 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.42/0.81 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.42/0.81 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.42/0.81 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.42/0.81 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.42/0.81 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.42/0.81 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.42/0.81 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.42/0.81 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.42/0.81 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.42/0.81 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.42/0.81 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.42/0.81 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.42/0.81 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.42/0.81 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.81 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.42/0.81 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.81 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.42/0.81 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.81 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.42/0.81 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.42/0.81 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.42/0.81 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.42/0.81 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.42/0.81 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.42/0.81 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.42/0.81 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.42/0.81 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.42/0.81 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.42/0.81 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.42/0.81 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.42/0.81 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.42/0.81 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.42/0.81 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.42/0.81 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.42/0.81 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.42/0.81 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.42/0.81 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 0.42/0.81 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.42/0.81 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 0.42/0.81 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 0.42/0.81 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 0.42/0.81 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 0.42/0.81 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.42/0.81 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.42/0.81 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.42/0.81 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 0.42/0.81 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 0.42/0.81 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.42/0.81 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 0.42/0.81 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 0.42/0.81 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.42/0.81 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.81 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.42/0.81 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 0.42/0.81 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.42/0.81 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.42/0.81 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 0.42/0.81 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 0.42/0.81 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 0.42/0.81 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.42/0.81 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.42/0.81 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.42/0.81 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.42/0.81 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.42/0.81 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 0.42/0.81 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 0.42/0.81 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 0.42/0.81 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 0.42/0.81 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 0.42/0.81 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 0.42/0.81 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 0.42/0.81 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 0.42/0.81 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 0.42/0.81 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 0.42/0.81 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 0.42/0.81 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 0.42/0.81 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 0.42/0.81 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 0.42/0.81 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 0.42/0.81 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 0.42/0.81 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.42/0.81 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 0.42/0.81 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 0.42/0.81 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 0.42/0.81 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 0.42/0.81 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 0.42/0.81 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 0.42/0.81 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 0.42/0.81 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.42/0.81 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 0.42/0.81 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 0.42/0.81 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 0.42/0.81 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.42/0.81 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.42/0.81 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 0.42/0.81 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 0.42/0.81 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 0.42/0.81 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 0.42/0.81 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 0.42/0.81 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 0.42/0.81 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 0.42/0.81 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 0.42/0.81 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 0.42/0.81 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 0.42/0.81 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 0.42/0.81 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 0.42/0.81 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 0.42/0.81 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 0.42/0.81 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 0.42/0.81 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 0.42/0.81 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 0.42/0.81 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 0.42/0.81 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 0.42/0.81 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 0.42/0.81 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 0.42/0.81 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 0.42/0.81 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 0.42/0.81 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 0.42/0.81 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 0.42/0.81 (assume a185 (tptp.ssList tptp.sk1))
% 0.42/0.81 (assume a186 (tptp.ssList tptp.sk2))
% 0.42/0.81 (assume a187 (tptp.ssList tptp.sk3))
% 0.42/0.81 (assume a188 (tptp.ssList tptp.sk4))
% 0.42/0.81 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.42/0.81 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (assume a191 (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)))
% 0.42/0.81 (assume a192 (or (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.81 (assume a193 (or (tptp.ssItem tptp.sk5) (tptp.neq tptp.sk2 tptp.nil)))
% 0.42/0.81 (assume a194 (or (tptp.ssList tptp.sk6) (tptp.neq tptp.sk2 tptp.nil)))
% 0.42/0.81 (assume a195 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (tptp.neq tptp.sk2 tptp.nil)))
% 0.42/0.81 (assume a196 (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)))
% 0.42/0.81 (assume a197 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))))
% 0.42/0.81 (assume a198 (or (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.81 (assume a199 (or (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.81 (assume a200 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.81 (assume a201 (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.81 (assume a202 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))))
% 0.42/0.81 (step t1 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))))) :rule equiv_pos2)
% 0.42/0.81 (anchor :step t2 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D)))
% 0.42/0.81 (step t2.t1 (cl (= A A)) :rule refl)
% 0.42/0.81 (step t2.t2 (cl (= B B)) :rule refl)
% 0.42/0.81 (step t2.t3 (cl (= C C)) :rule refl)
% 0.42/0.81 (step t2.t4 (cl (= D D)) :rule refl)
% 0.42/0.81 (step t2.t5 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 0.42/0.81 (step t2.t6 (cl (= (not (= tptp.sk2 A)) (not (= tptp.sk2 A)))) :rule refl)
% 0.42/0.81 (step t2.t7 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 0.42/0.81 (step t2.t8 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.42/0.81 (step t2.t9 (cl (= (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.tl tptp.sk1) B)))) :rule refl)
% 0.42/0.81 (step t2.t10 (cl (= (= (tptp.app B C) A) (= A (tptp.app B C)))) :rule all_simplify)
% 0.42/0.81 (step t2.t11 (cl (= (not (= (tptp.app B C) A)) (not (= A (tptp.app B C))))) :rule cong :premises (t2.t10))
% 0.42/0.81 (step t2.t12 (cl (= (not (tptp.ssItem D)) (not (tptp.ssItem D)))) :rule refl)
% 0.42/0.81 (step t2.t13 (cl (= (= (tptp.cons D tptp.nil) C) (= C (tptp.cons D tptp.nil)))) :rule all_simplify)
% 0.42/0.81 (step t2.t14 (cl (= (not (= (tptp.cons D tptp.nil) C)) (not (= C (tptp.cons D tptp.nil))))) :rule cong :premises (t2.t13))
% 0.42/0.81 (step t2.t15 (cl (= (not (= (tptp.hd tptp.sk1) D)) (not (= (tptp.hd tptp.sk1) D)))) :rule refl)
% 0.42/0.81 (step t2.t16 (cl (= (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)))) :rule refl)
% 0.42/0.81 (step t2.t17 (cl (= (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk1 tptp.nil)))) :rule refl)
% 0.42/0.81 (step t2.t18 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 0.42/0.81 (step t2.t19 (cl (= (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t2.t5 t2.t6 t2.t7 t2.t8 t2.t9 t2.t11 t2.t12 t2.t14 t2.t15 t2.t16 t2.t16 t2.t17 t2.t18))
% 0.42/0.81 (step t2 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))))) :rule bind)
% 0.42/0.81 (step t3 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))))) :rule all_simplify)
% 0.42/0.81 (step t4 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (= (tptp.tl tptp.sk1) B)) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D))))))) :rule all_simplify)
% 0.42/0.81 (step t5 (cl (= (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)))) :rule refl)
% 0.42/0.81 (step t6 (cl (= (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk1 tptp.nil)))) :rule refl)
% 0.42/0.81 (step t7 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 0.42/0.81 (step t8 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (= (tptp.tl tptp.sk1) B)) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)))) (or (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (= (tptp.tl tptp.sk1) (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))) (not (= (tptp.cons (tptp.hd tptp.sk1) tptp.nil) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= (tptp.hd tptp.sk1) (tptp.hd tptp.sk1)))))) :rule all_simplify)
% 0.42/0.81 (step t9 (cl (= (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule refl)
% 0.42/0.81 (step t10 (cl (= (= tptp.sk2 tptp.sk2) true)) :rule all_simplify)
% 0.42/0.81 (step t11 (cl (= (not (= tptp.sk2 tptp.sk2)) (not true))) :rule cong :premises (t10))
% 0.42/0.81 (step t12 (cl (= (not true) false)) :rule all_simplify)
% 0.42/0.81 (step t13 (cl (= (not (= tptp.sk2 tptp.sk2)) false)) :rule trans :premises (t11 t12))
% 0.42/0.81 (step t14 (cl (= (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.tl tptp.sk1))))) :rule refl)
% 0.42/0.81 (step t15 (cl (= (= (tptp.tl tptp.sk1) (tptp.tl tptp.sk1)) true)) :rule all_simplify)
% 0.42/0.81 (step t16 (cl (= (not (= (tptp.tl tptp.sk1) (tptp.tl tptp.sk1))) (not true))) :rule cong :premises (t15))
% 0.42/0.81 (step t17 (cl (= (not (= (tptp.tl tptp.sk1) (tptp.tl tptp.sk1))) false)) :rule trans :premises (t16 t12))
% 0.42/0.81 (step t18 (cl (= (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))))) :rule refl)
% 0.42/0.81 (step t19 (cl (= (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))))) :rule refl)
% 0.42/0.81 (step t20 (cl (= (not (tptp.ssItem (tptp.hd tptp.sk1))) (not (tptp.ssItem (tptp.hd tptp.sk1))))) :rule refl)
% 0.42/0.81 (step t21 (cl (= (= (tptp.cons (tptp.hd tptp.sk1) tptp.nil) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) true)) :rule all_simplify)
% 0.42/0.81 (step t22 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk1) tptp.nil) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not true))) :rule cong :premises (t21))
% 0.42/0.81 (step t23 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk1) tptp.nil) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) false)) :rule trans :premises (t22 t12))
% 0.42/0.81 (step t24 (cl (= (= (tptp.hd tptp.sk1) (tptp.hd tptp.sk1)) true)) :rule all_simplify)
% 0.42/0.81 (step t25 (cl (= (not (= (tptp.hd tptp.sk1) (tptp.hd tptp.sk1))) (not true))) :rule cong :premises (t24))
% 0.42/0.81 (step t26 (cl (= (not (= (tptp.hd tptp.sk1) (tptp.hd tptp.sk1))) false)) :rule trans :premises (t25 t12))
% 0.42/0.81 (step t27 (cl (= (or (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (= (tptp.tl tptp.sk1) (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))) (not (= (tptp.cons (tptp.hd tptp.sk1) tptp.nil) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= (tptp.hd tptp.sk1) (tptp.hd tptp.sk1)))) (or (not (tptp.ssList tptp.sk2)) false (not (tptp.ssList (tptp.tl tptp.sk1))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))) false false))) :rule cong :premises (t9 t13 t14 t17 t18 t19 t20 t23 t26))
% 0.42/0.81 (step t28 (cl (= (or (not (tptp.ssList tptp.sk2)) false (not (tptp.ssList (tptp.tl tptp.sk1))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))) false false) (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule all_simplify)
% 0.42/0.81 (step t29 (cl (= (or (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (= (tptp.tl tptp.sk1) (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))) (not (= (tptp.cons (tptp.hd tptp.sk1) tptp.nil) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= (tptp.hd tptp.sk1) (tptp.hd tptp.sk1)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule trans :premises (t27 t28))
% 0.42/0.81 (step t30 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (= (tptp.tl tptp.sk1) B)) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule trans :premises (t8 t29))
% 0.42/0.81 (step t31 (cl (= (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (= (tptp.tl tptp.sk1) B)) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D))))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))))))) :rule cong :premises (t5 t6 t7 t30))
% 0.42/0.81 (step t32 (cl (= (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule all_simplify)
% 0.42/0.81 (step t33 (cl (= (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (= (tptp.tl tptp.sk1) B)) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D))))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule trans :premises (t31 t32))
% 0.42/0.81 (step t34 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule trans :premises (t4 t33))
% 0.42/0.81 (step t35 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule trans :premises (t3 t34))
% 0.42/0.81 (step t36 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk2 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk1) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk1) D)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))))) :rule trans :premises (t2 t35))
% 0.42/0.81 (step t37 (cl (or (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1))))) :rule resolution :premises (t1 t36 a202))
% 0.42/0.81 (step t38 (cl (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))) :rule or :premises (t37))
% 0.42/0.81 (step t39 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk1)))) :rule reordering :premises (t38))
% 0.42/0.81 (step t40 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)) :rule or_pos)
% 0.42/0.81 (step t41 (cl (tptp.neq tptp.sk1 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule reordering :premises (t40))
% 0.42/0.81 (step t42 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1)))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1)))) :rule equiv_pos2)
% 0.42/0.81 (step t43 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.42/0.81 (step t44 (cl (= (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule refl)
% 0.42/0.81 (step t45 (cl (= (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true) (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule equiv_simplify)
% 0.42/0.81 (step t46 (cl (not (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true)) (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule equiv1 :premises (t45))
% 0.42/0.81 (step t47 (cl (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))))) :rule all_simplify)
% 0.42/0.81 (step t48 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule refl)
% 0.42/0.81 (step t49 (cl (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 0.42/0.81 (step t50 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule cong :premises (t48 t49))
% 0.42/0.81 (step t51 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true)) :rule all_simplify)
% 0.42/0.81 (step t52 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) true)) :rule trans :premises (t50 t51))
% 0.42/0.81 (step t53 (cl (= (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) true)) :rule trans :premises (t47 t52))
% 0.42/0.81 (step t54 (cl (= (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t46 t53))
% 0.42/0.81 (step t55 (cl (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk1)))) :rule refl)
% 0.42/0.81 (step t56 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1))))) :rule cong :premises (t43 t44 t54 t55))
% 0.42/0.81 (step t57 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule and_neg)
% 0.42/0.81 (step t58 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t59)
% 0.42/0.81 (assume t59.a0 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (assume t59.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t59.a2 (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (step t59.t1 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t59.t2)
% 0.42/0.81 (assume t59.t2.a0 (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (assume t59.t2.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t59.t2.a2 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (step t59.t2.t1 (cl (= (= (= tptp.nil tptp.sk1) false) (not (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 0.42/0.81 (step t59.t2.t2 (cl (not (= (= tptp.nil tptp.sk1) false)) (not (= tptp.nil tptp.sk1))) :rule equiv1 :premises (t59.t2.t1))
% 0.42/0.81 (step t59.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.81 (step t59.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t59.t2.a2))
% 0.42/0.81 (step t59.t2.t5 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t59.t2.t4))
% 0.42/0.81 (step t59.t2.t6 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t59.t2.a1))
% 0.42/0.81 (step t59.t2.t7 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t59.t2.t6))
% 0.42/0.81 (step t59.t2.t8 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t59.t2.t5 t59.t2.t7))
% 0.42/0.81 (step t59.t2.t9 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t59.t2.t3 t59.t2.t8))
% 0.42/0.81 (step t59.t2.t10 (cl (= (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule equiv_simplify)
% 0.42/0.81 (step t59.t2.t11 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule equiv2 :premises (t59.t2.t10))
% 0.42/0.81 (step t59.t2.t12 (cl (not (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule not_not)
% 0.42/0.81 (step t59.t2.t13 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t59.t2.t11 t59.t2.t12))
% 0.42/0.81 (step t59.t2.t14 (cl (= (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) false)) :rule resolution :premises (t59.t2.t13 t59.t2.a0))
% 0.42/0.81 (step t59.t2.t15 (cl (= (= tptp.nil tptp.sk1) false)) :rule trans :premises (t59.t2.t9 t59.t2.t14))
% 0.42/0.81 (step t59.t2.t16 (cl (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t59.t2.t2 t59.t2.t15))
% 0.42/0.81 (step t59.t2 (cl (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) :rule subproof :discharge (t59.t2.a0 t59.t2.a1 t59.t2.a2))
% 0.42/0.81 (step t59.t3 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.81 (step t59.t4 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t59.t5 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t59.t6 (cl (not (= tptp.nil tptp.sk1)) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t59.t2 t59.t3 t59.t4 t59.t5))
% 0.42/0.81 (step t59.t7 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t59.t6))
% 0.42/0.81 (step t59.t8 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule contraction :premises (t59.t7))
% 0.42/0.81 (step t59.t9 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t59.t1 t59.t8))
% 0.42/0.81 (step t59.t10 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 0.42/0.81 (step t59.t11 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t59.t9 t59.t10))
% 0.42/0.81 (step t59.t12 (cl (=> (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)))) :rule contraction :premises (t59.t11))
% 0.42/0.81 (step t59.t13 (cl (not (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule implies :premises (t59.t12))
% 0.42/0.81 (step t59.t14 (cl (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.42/0.81 (step t59.t15 (cl (and (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t59.t14 t59.a2 t59.a1 t59.a0))
% 0.42/0.81 (step t59.t16 (cl (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t59.t13 t59.t15))
% 0.42/0.81 (step t59 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) :rule subproof :discharge (t59.a0 t59.a1 t59.a2))
% 0.42/0.81 (step t60 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t61 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t62 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.81 (step t63 (cl (not (= tptp.nil tptp.sk1)) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule resolution :premises (t59 t60 t61 t62))
% 0.42/0.81 (step t64 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t63))
% 0.42/0.81 (step t65 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil tptp.sk1))) :rule contraction :premises (t64))
% 0.42/0.81 (step t66 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t58 t65))
% 0.42/0.81 (step t67 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 0.42/0.81 (step t68 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t66 t67))
% 0.42/0.81 (step t69 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1)))) :rule contraction :premises (t68))
% 0.42/0.81 (step t70 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (= tptp.nil tptp.sk1))) :rule implies :premises (t69))
% 0.42/0.81 (step t71 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t57 t70))
% 0.42/0.81 (step t72 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.42/0.81 (step t73 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule or_neg)
% 0.42/0.81 (step t74 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (not (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule or_neg)
% 0.42/0.81 (step t75 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.nil tptp.sk1)))) :rule or_neg)
% 0.42/0.81 (step t76 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t71 t72 t73 t74 t75))
% 0.42/0.81 (step t77 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.nil tptp.sk1)))) :rule contraction :premises (t76))
% 0.42/0.81 (step t78 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t42 t56 t77))
% 0.42/0.81 (step t79 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (= tptp.nil tptp.sk1))) :rule or :premises (t78))
% 0.42/0.81 (step t80 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 0.42/0.81 (step t81 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 0.42/0.81 (step t82 (cl (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t81 t7))
% 0.42/0.81 (step t83 (cl (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t80 t82 a200))
% 0.42/0.81 (step t84 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t83))
% 0.42/0.81 (step t85 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t84))
% 0.42/0.81 (step t86 (cl (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule and_neg)
% 0.42/0.81 (step t87 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t88)
% 0.42/0.81 (assume t88.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.81 (assume t88.a1 (tptp.neq tptp.sk2 tptp.nil))
% 0.42/0.81 (step t88.t1 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t88.t2)
% 0.42/0.81 (assume t88.t2.a0 (tptp.neq tptp.sk2 tptp.nil))
% 0.42/0.81 (assume t88.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.42/0.81 (step t88.t2.t1 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) true) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_simplify)
% 0.42/0.81 (step t88.t2.t2 (cl (not (= (tptp.neq tptp.sk4 tptp.nil) true)) (tptp.neq tptp.sk4 tptp.nil)) :rule equiv1 :premises (t88.t2.t1))
% 0.42/0.81 (step t88.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t88.t2.a1))
% 0.42/0.81 (step t88.t2.t4 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.81 (step t88.t2.t5 (cl (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) :rule cong :premises (t88.t2.t3 t88.t2.t4))
% 0.42/0.81 (step t88.t2.t6 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 0.42/0.81 (step t88.t2.t7 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t88.t2.t6))
% 0.42/0.81 (step t88.t2.t8 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t88.t2.t7 t88.t2.a0))
% 0.42/0.81 (step t88.t2.t9 (cl (= (tptp.neq tptp.sk4 tptp.nil) true)) :rule trans :premises (t88.t2.t5 t88.t2.t8))
% 0.42/0.81 (step t88.t2.t10 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t88.t2.t2 t88.t2.t9))
% 0.42/0.81 (step t88.t2 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t88.t2.a0 t88.t2.a1))
% 0.42/0.81 (step t88.t3 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.42/0.81 (step t88.t4 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.81 (step t88.t5 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t88.t2 t88.t3 t88.t4))
% 0.42/0.81 (step t88.t6 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t88.t5))
% 0.42/0.81 (step t88.t7 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t88.t6))
% 0.42/0.81 (step t88.t8 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t88.t1 t88.t7))
% 0.42/0.81 (step t88.t9 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 0.42/0.81 (step t88.t10 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t88.t8 t88.t9))
% 0.42/0.81 (step t88.t11 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t88.t10))
% 0.42/0.81 (step t88.t12 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t88.t11))
% 0.42/0.81 (step t88.t13 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.42/0.81 (step t88.t14 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t88.t13 t88.a1 t88.a0))
% 0.42/0.81 (step t88.t15 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t88.t12 t88.t14))
% 0.42/0.81 (step t88 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t88.a0 t88.a1))
% 0.42/0.81 (step t89 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.81 (step t90 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.42/0.81 (step t91 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t88 t89 t90))
% 0.42/0.81 (step t92 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t91))
% 0.42/0.81 (step t93 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t92))
% 0.42/0.81 (step t94 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t87 t93))
% 0.42/0.81 (step t95 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 0.42/0.81 (step t96 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t94 t95))
% 0.42/0.81 (step t97 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t96))
% 0.42/0.81 (step t98 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t97))
% 0.42/0.81 (step t99 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t86 t98))
% 0.42/0.81 (step t100 (cl (tptp.neq tptp.sk4 tptp.nil) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t99))
% 0.42/0.81 (step t101 (cl (not (= (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))) (not (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule equiv_pos2)
% 0.42/0.81 (step t102 (cl (= (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))) :rule all_simplify)
% 0.42/0.81 (step t103 (cl (tptp.neq tptp.sk2 tptp.nil)) :rule resolution :premises (t101 t102 a191))
% 0.42/0.81 (step t104 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t100 a189 t103))
% 0.42/0.81 (step t105 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t85 t104))
% 0.42/0.81 (step t106 (cl (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 0.42/0.81 (step t107 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t106))
% 0.42/0.81 (step t108 (cl (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a199))
% 0.42/0.81 (step t109 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk6)) :rule reordering :premises (t108))
% 0.42/0.81 (step t110 (cl (tptp.ssList tptp.sk6)) :rule resolution :premises (t109 t104))
% 0.42/0.81 (step t111 (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)
% 0.42/0.81 (step t112 (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 (t111))
% 0.42/0.81 (step t113 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a198))
% 0.42/0.81 (step t114 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssItem tptp.sk5)) :rule reordering :premises (t113))
% 0.42/0.81 (step t115 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t114 t104))
% 0.42/0.81 (step t116 (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)
% 0.42/0.81 (anchor :step t117)
% 0.42/0.81 (assume t117.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.42/0.81 (step t117.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)))
% 0.42/0.81 (step t117.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 (t117.t1))
% 0.42/0.81 (step t117.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 (t117.t2 t117.a0))
% 0.42/0.81 (step t117 (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 (t117.a0))
% 0.42/0.81 (step t118 (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 (t116 t117))
% 0.42/0.81 (step t119 (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)
% 0.42/0.81 (step t120 (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 (t118 t119))
% 0.42/0.81 (step t121 (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 (t120))
% 0.42/0.81 (step t122 (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 (t121))
% 0.42/0.81 (step t123 (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)
% 0.42/0.81 (anchor :step t124 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.81 (step t124.t1 (cl (= U U)) :rule refl)
% 0.42/0.81 (step t124.t2 (cl (= V V)) :rule refl)
% 0.42/0.81 (step t124.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 0.42/0.81 (step t124.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t124.t3))
% 0.42/0.81 (step t124.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.42/0.81 (step t124.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.81 (step t124.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 (t124.t4 t124.t5 t124.t6))
% 0.42/0.81 (step t124 (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)
% 0.42/0.81 (step t125 (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 (t123 t124 a97))
% 0.42/0.81 (step t126 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t122 t125))
% 0.42/0.81 (step t127 (cl (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t112 a7 t115 t126))
% 0.42/0.81 (step t128 (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)
% 0.42/0.81 (step t129 (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 (t128))
% 0.42/0.81 (step t130 (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)
% 0.42/0.81 (anchor :step t131)
% 0.42/0.81 (assume t131.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.42/0.81 (step t131.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)))
% 0.42/0.81 (step t131.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 (t131.t1))
% 0.42/0.81 (step t131.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t131.t2 t131.a0))
% 0.42/0.81 (step t131 (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 (t131.a0))
% 0.42/0.81 (step t132 (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 (t130 t131))
% 0.42/0.81 (step t133 (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)
% 0.42/0.81 (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.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 (t132 t133))
% 0.42/0.81 (step t135 (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 (t134))
% 0.42/0.81 (step t136 (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 (t135))
% 0.42/0.81 (step t137 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t136 a85))
% 0.42/0.81 (step t138 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t129 a7 t115 t137))
% 0.42/0.81 (step t139 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t140)
% 0.42/0.81 (assume t140.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.81 (step t140.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk6)))
% 0.42/0.81 (step t140.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t140.t1))
% 0.42/0.81 (step t140.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t140.t2 t140.a0))
% 0.42/0.81 (step t140 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t140.a0))
% 0.42/0.81 (step t141 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t139 t140))
% 0.42/0.81 (step t142 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 0.42/0.81 (step t143 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t141 t142))
% 0.42/0.81 (step t144 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t143))
% 0.42/0.81 (step t145 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t144))
% 0.42/0.81 (step t146 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 0.42/0.81 (anchor :step t147 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.81 (step t147.t1 (cl (= U U)) :rule refl)
% 0.42/0.81 (step t147.t2 (cl (= V V)) :rule refl)
% 0.42/0.81 (step t147.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 0.42/0.81 (step t147.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t147.t3))
% 0.42/0.81 (step t147.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.81 (step t147.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.42/0.81 (step t147.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 0.42/0.81 (step t147.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t147.t4 t147.t5 t147.t6 t147.t7))
% 0.42/0.81 (step t147 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 0.42/0.81 (step t148 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t146 t147 a117))
% 0.42/0.81 (step t149 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t145 t148))
% 0.42/0.81 (step t150 (cl (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t107 t110 t127 t138 t149))
% 0.42/0.81 (step t151 (cl (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t79 a190 t105 t150))
% 0.42/0.81 (step t152 (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t153)
% 0.42/0.81 (assume t153.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 0.42/0.81 (step t153.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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk1)))
% 0.42/0.81 (step t153.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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule or :premises (t153.t1))
% 0.42/0.81 (step t153.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t153.t2 t153.a0))
% 0.42/0.81 (step t153 (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule subproof :discharge (t153.a0))
% 0.42/0.81 (step t154 (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t152 t153))
% 0.42/0.81 (step t155 (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 0.42/0.81 (step t156 (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (=> (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t154 t155))
% 0.42/0.81 (step t157 (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule contraction :premises (t156))
% 0.42/0.81 (step t158 (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.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule implies :premises (t157))
% 0.42/0.81 (step t159 (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)
% 0.42/0.81 (anchor :step t160 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.81 (step t160.t1 (cl (= U U)) :rule refl)
% 0.42/0.81 (step t160.t2 (cl (= V V)) :rule refl)
% 0.42/0.81 (step t160.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.42/0.81 (step t160.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.81 (step t160.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 0.42/0.81 (step t160.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 0.42/0.81 (step t160.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 (t160.t3 t160.t4 t160.t5 t160.t6))
% 0.42/0.81 (step t160 (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)
% 0.42/0.81 (step t161 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t159 t160 a99))
% 0.42/0.81 (step t162 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t158 t161))
% 0.42/0.81 (step t163 (cl (tptp.neq tptp.sk1 tptp.nil)) :rule resolution :premises (t41 a7 a185 t151 t162))
% 0.42/0.81 (step t164 (cl (not (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)) :rule or_pos)
% 0.42/0.81 (step t165 (cl (tptp.neq tptp.nil tptp.sk1) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1) (not (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)))) :rule reordering :premises (t164))
% 0.42/0.81 (step t166 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) (=> (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))))) (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil)))) (=> (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)))) :rule equiv_pos2)
% 0.42/0.81 (step t167 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule refl)
% 0.42/0.81 (step t168 (cl (= (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule refl)
% 0.42/0.81 (step t169 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 0.42/0.81 (step t170 (cl (= (tptp.neq tptp.nil tptp.sk1) (tptp.neq tptp.nil tptp.sk1))) :rule refl)
% 0.42/0.81 (step t171 (cl (= (= tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule all_simplify)
% 0.42/0.81 (step t172 (cl (= (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil)) (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)))) :rule cong :premises (t168 t169 t170 t171))
% 0.42/0.81 (step t173 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) (=> (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))))) :rule cong :premises (t167 t172))
% 0.42/0.81 (step t174 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t175)
% 0.42/0.81 (assume t175.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 0.42/0.81 (step t175.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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk1) (:= V tptp.nil)))
% 0.42/0.81 (step t175.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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) :rule or :premises (t175.t1))
% 0.42/0.81 (step t175.t3 (cl (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) :rule resolution :premises (t175.t2 t175.a0))
% 0.42/0.81 (step t175 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) :rule subproof :discharge (t175.a0))
% 0.42/0.81 (step t176 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) :rule resolution :premises (t174 t175))
% 0.42/0.81 (step t177 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) (not (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil)))) :rule implies_neg2)
% 0.42/0.81 (step t178 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil))) (=> (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil)))) :rule resolution :premises (t176 t177))
% 0.42/0.81 (step t179 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.sk1 tptp.nil)))) :rule contraction :premises (t178))
% 0.42/0.81 (step t180 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t166 t173 t179))
% 0.42/0.81 (step t181 (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.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule implies :premises (t180))
% 0.42/0.81 (step t182 (cl (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule resolution :premises (t181 t161))
% 0.42/0.81 (step t183 (cl (tptp.neq tptp.nil tptp.sk1)) :rule resolution :premises (t165 a7 a185 t151 t182))
% 0.42/0.81 (step t184 (cl (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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)))) :rule and_neg)
% 0.42/0.81 (step t185 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1))) (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t186)
% 0.42/0.81 (assume t186.a0 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (assume t186.a1 (tptp.ssList tptp.sk6))
% 0.42/0.81 (assume t186.a2 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t186.a3 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.81 (assume t186.a4 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t186.a5 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 0.42/0.81 (step t186.t1 (cl (=> (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk1))) (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t186.t2)
% 0.42/0.81 (assume t186.t2.a0 (tptp.ssList tptp.sk6))
% 0.42/0.81 (assume t186.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.81 (assume t186.t2.a2 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t186.t2.a3 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 0.42/0.81 (assume t186.t2.a4 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t186.t2.a5 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (step t186.t2.t1 (cl (= (= (tptp.ssList (tptp.tl tptp.sk1)) true) (tptp.ssList (tptp.tl tptp.sk1)))) :rule equiv_simplify)
% 0.42/0.81 (step t186.t2.t2 (cl (not (= (tptp.ssList (tptp.tl tptp.sk1)) true)) (tptp.ssList (tptp.tl tptp.sk1))) :rule equiv1 :premises (t186.t2.t1))
% 0.42/0.81 (step t186.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t186.t2.a5))
% 0.42/0.81 (step t186.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t186.t2.t3))
% 0.42/0.81 (step t186.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t186.t2.a4))
% 0.42/0.81 (step t186.t2.t6 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t186.t2.t5))
% 0.42/0.81 (step t186.t2.t7 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t186.t2.t4 t186.t2.t6))
% 0.42/0.81 (step t186.t2.t8 (cl (= (tptp.tl tptp.sk1) (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t186.t2.t7))
% 0.42/0.81 (step t186.t2.t9 (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 (t186.t2.a3))
% 0.42/0.81 (step t186.t2.t10 (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 (t186.t2.t9))
% 0.42/0.81 (step t186.t2.t11 (cl (= (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) :rule symm :premises (t186.t2.a2))
% 0.42/0.81 (step t186.t2.t12 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 0.42/0.81 (step t186.t2.t13 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t186.t2.t11 t186.t2.t12))
% 0.42/0.81 (step t186.t2.t14 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t186.t2.a1))
% 0.42/0.81 (step t186.t2.t15 (cl (= (tptp.tl tptp.sk1) tptp.sk6)) :rule trans :premises (t186.t2.t8 t186.t2.t10 t186.t2.t13 t186.t2.t14))
% 0.42/0.81 (step t186.t2.t16 (cl (= (tptp.ssList (tptp.tl tptp.sk1)) (tptp.ssList tptp.sk6))) :rule cong :premises (t186.t2.t15))
% 0.42/0.81 (step t186.t2.t17 (cl (= (= (tptp.ssList tptp.sk6) true) (tptp.ssList tptp.sk6))) :rule equiv_simplify)
% 0.42/0.81 (step t186.t2.t18 (cl (= (tptp.ssList tptp.sk6) true) (not (tptp.ssList tptp.sk6))) :rule equiv2 :premises (t186.t2.t17))
% 0.42/0.81 (step t186.t2.t19 (cl (= (tptp.ssList tptp.sk6) true)) :rule resolution :premises (t186.t2.t18 t186.t2.a0))
% 0.42/0.81 (step t186.t2.t20 (cl (= (tptp.ssList (tptp.tl tptp.sk1)) true)) :rule trans :premises (t186.t2.t16 t186.t2.t19))
% 0.42/0.81 (step t186.t2.t21 (cl (tptp.ssList (tptp.tl tptp.sk1))) :rule resolution :premises (t186.t2.t2 t186.t2.t20))
% 0.42/0.81 (step t186.t2 (cl (not (tptp.ssList tptp.sk6)) (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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk1))) :rule subproof :discharge (t186.t2.a0 t186.t2.a1 t186.t2.a2 t186.t2.a3 t186.t2.a4 t186.t2.a5))
% 0.42/0.81 (step t186.t3 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList tptp.sk6)) :rule and_pos)
% 0.42/0.81 (step t186.t4 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t186.t5 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t186.t6 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)
% 0.42/0.81 (step t186.t7 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t186.t8 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t186.t9 (cl (tptp.ssList (tptp.tl tptp.sk1)) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t186.t2 t186.t3 t186.t4 t186.t5 t186.t6 t186.t7 t186.t8))
% 0.42/0.81 (step t186.t10 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList (tptp.tl tptp.sk1))) :rule reordering :premises (t186.t9))
% 0.42/0.81 (step t186.t11 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList (tptp.tl tptp.sk1))) :rule contraction :premises (t186.t10))
% 0.42/0.81 (step t186.t12 (cl (=> (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk1))) (tptp.ssList (tptp.tl tptp.sk1))) :rule resolution :premises (t186.t1 t186.t11))
% 0.42/0.81 (step t186.t13 (cl (=> (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.tl tptp.sk1)))) :rule implies_neg2)
% 0.42/0.81 (step t186.t14 (cl (=> (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk1))) (=> (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk1)))) :rule resolution :premises (t186.t12 t186.t13))
% 0.42/0.81 (step t186.t15 (cl (=> (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk1)))) :rule contraction :premises (t186.t14))
% 0.42/0.81 (step t186.t16 (cl (not (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList (tptp.tl tptp.sk1))) :rule implies :premises (t186.t15))
% 0.42/0.81 (step t186.t17 (cl (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.ssList tptp.sk6)) (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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.42/0.81 (step t186.t18 (cl (and (tptp.ssList tptp.sk6) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t186.t17 t186.a1 t186.a3 t186.a4 t186.a5 t186.a2 t186.a0))
% 0.42/0.81 (step t186.t19 (cl (tptp.ssList (tptp.tl tptp.sk1))) :rule resolution :premises (t186.t16 t186.t18))
% 0.42/0.81 (step t186 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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))) (tptp.ssList (tptp.tl tptp.sk1))) :rule subproof :discharge (t186.a0 t186.a1 t186.a2 t186.a3 t186.a4 t186.a5))
% 0.42/0.81 (step t187 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t188 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList tptp.sk6)) :rule and_pos)
% 0.42/0.81 (step t189 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t190 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t191 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t192 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.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)
% 0.42/0.81 (step t193 (cl (tptp.ssList (tptp.tl tptp.sk1)) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) :rule resolution :premises (t186 t187 t188 t189 t190 t191 t192))
% 0.42/0.81 (step t194 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1))) :rule reordering :premises (t193))
% 0.42/0.81 (step t195 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1))) :rule contraction :premises (t194))
% 0.42/0.81 (step t196 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1))) (tptp.ssList (tptp.tl tptp.sk1))) :rule resolution :premises (t185 t195))
% 0.42/0.81 (step t197 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1))) (not (tptp.ssList (tptp.tl tptp.sk1)))) :rule implies_neg2)
% 0.42/0.81 (step t198 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1))) (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1)))) :rule resolution :premises (t196 t197))
% 0.42/0.81 (step t199 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1)))) :rule contraction :premises (t198))
% 0.42/0.81 (step t200 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssList tptp.sk6) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssList (tptp.tl tptp.sk1))) :rule implies :premises (t199))
% 0.42/0.81 (step t201 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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))) (tptp.ssList (tptp.tl tptp.sk1))) :rule resolution :premises (t184 t200))
% 0.42/0.81 (step t202 (cl (tptp.ssList (tptp.tl tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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)))) :rule reordering :premises (t201))
% 0.42/0.81 (step t203 (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)
% 0.42/0.81 (step t204 (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 (t203))
% 0.42/0.81 (step t205 (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)
% 0.42/0.81 (anchor :step t206)
% 0.42/0.81 (assume t206.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 0.42/0.81 (step t206.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)))
% 0.42/0.81 (step t206.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 (t206.t1))
% 0.42/0.81 (step t206.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t206.t2 t206.a0))
% 0.42/0.81 (step t206 (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 (t206.a0))
% 0.42/0.81 (step t207 (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 (t205 t206))
% 0.42/0.81 (step t208 (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)
% 0.42/0.81 (step t209 (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 (t207 t208))
% 0.42/0.81 (step t210 (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 (t209))
% 0.42/0.81 (step t211 (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 (t210))
% 0.42/0.81 (step t212 (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)
% 0.42/0.81 (anchor :step t213 :args ((U $$unsorted) (:= U U)))
% 0.42/0.81 (step t213.t1 (cl (= U U)) :rule refl)
% 0.42/0.81 (step t213.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.42/0.81 (step t213.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 0.42/0.81 (step t213.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 (t213.t2 t213.t3))
% 0.42/0.81 (step t213 (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)
% 0.42/0.81 (step t214 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t212 t213 a73))
% 0.42/0.81 (step t215 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t211 t214))
% 0.42/0.81 (step t216 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule resolution :premises (t204 t110 t215))
% 0.42/0.81 (step t217 (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)
% 0.42/0.81 (step t218 (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 (t217))
% 0.42/0.81 (step t219 (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)
% 0.42/0.81 (anchor :step t220)
% 0.42/0.81 (assume t220.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))
% 0.42/0.81 (step t220.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)))
% 0.42/0.81 (step t220.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 (t220.t1))
% 0.42/0.81 (step t220.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 (t220.t2 t220.a0))
% 0.42/0.81 (step t220 (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 (t220.a0))
% 0.42/0.81 (step t221 (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 (t219 t220))
% 0.42/0.81 (step t222 (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)
% 0.42/0.81 (step t223 (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 (t221 t222))
% 0.42/0.81 (step t224 (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 (t223))
% 0.42/0.81 (step t225 (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 (t224))
% 0.42/0.81 (step t226 (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)
% 0.42/0.81 (anchor :step t227 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.81 (step t227.t1 (cl (= U U)) :rule refl)
% 0.42/0.81 (step t227.t2 (cl (= V V)) :rule refl)
% 0.42/0.81 (step t227.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.42/0.81 (step t227.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.81 (step t227.t5 (cl (= (= (tptp.tl (tptp.cons U V)) V) (= V (tptp.tl (tptp.cons U V))))) :rule all_simplify)
% 0.42/0.81 (step t227.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 (t227.t3 t227.t4 t227.t5))
% 0.42/0.81 (step t227 (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)
% 0.42/0.81 (step t228 (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 (t226 t227 a95))
% 0.42/0.81 (step t229 (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 (t225 t228))
% 0.42/0.81 (step t230 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t218 a7 t115 t229))
% 0.42/0.81 (step t231 (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)
% 0.42/0.81 (step t232 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (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 (t231))
% 0.42/0.81 (step t233 (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)
% 0.42/0.81 (anchor :step t234)
% 0.42/0.81 (assume t234.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)))))
% 0.42/0.81 (step t234.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))))
% 0.42/0.81 (step t234.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 (t234.t1))
% 0.42/0.81 (step t234.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 (t234.t2 t234.a0))
% 0.42/0.81 (step t234 (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 (t234.a0))
% 0.42/0.81 (step t235 (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 (t233 t234))
% 0.42/0.81 (step t236 (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)
% 0.42/0.81 (step t237 (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 (t235 t236))
% 0.42/0.81 (step t238 (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 (t237))
% 0.42/0.81 (step t239 (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 (t238))
% 0.42/0.81 (step t240 (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 (t239 a132))
% 0.42/0.81 (step t241 (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 resolution :premises (t232 t110 t127 t138 t240))
% 0.42/0.81 (step t242 (cl (tptp.ssList (tptp.tl tptp.sk1))) :rule resolution :premises (t202 a190 t110 t105 t216 t230 t241))
% 0.42/0.81 (step t243 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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)))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (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))))) :rule and_neg)
% 0.42/0.81 (step t244 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t245)
% 0.42/0.81 (assume t245.a0 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (assume t245.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t245.a2 (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))
% 0.42/0.81 (assume t245.a3 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t245.a4 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (step t245.t1 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t245.t2)
% 0.42/0.81 (assume t245.t2.a0 (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))
% 0.42/0.81 (assume t245.t2.a1 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t245.t2.a2 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (assume t245.t2.a3 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t245.t2.a4 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (step t245.t2.t1 (cl (= (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) true) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule equiv_simplify)
% 0.42/0.81 (step t245.t2.t2 (cl (not (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) true)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule equiv1 :premises (t245.t2.t1))
% 0.42/0.81 (step t245.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t245.t2.a4))
% 0.42/0.81 (step t245.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t245.t2.t3))
% 0.42/0.81 (step t245.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t245.t2.a3))
% 0.42/0.81 (step t245.t2.t6 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t245.t2.t5))
% 0.42/0.81 (step t245.t2.t7 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t245.t2.t4 t245.t2.t6))
% 0.42/0.81 (step t245.t2.t8 (cl (= (tptp.hd tptp.sk1) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t245.t2.t7))
% 0.42/0.81 (step t245.t2.t9 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t245.t2.a2))
% 0.42/0.81 (step t245.t2.t10 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule symm :premises (t245.t2.a1))
% 0.42/0.81 (step t245.t2.t11 (cl (= (tptp.hd tptp.sk1) tptp.sk5)) :rule trans :premises (t245.t2.t8 t245.t2.t9 t245.t2.t10))
% 0.42/0.81 (step t245.t2.t12 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.81 (step t245.t2.t13 (cl (= (tptp.cons (tptp.hd tptp.sk1) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule cong :premises (t245.t2.t11 t245.t2.t12))
% 0.42/0.81 (step t245.t2.t14 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t245.t2.t13))
% 0.42/0.81 (step t245.t2.t15 (cl (= (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 0.42/0.81 (step t245.t2.t16 (cl (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv2 :premises (t245.t2.t15))
% 0.42/0.81 (step t245.t2.t17 (cl (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true)) :rule resolution :premises (t245.t2.t16 t245.t2.a0))
% 0.42/0.81 (step t245.t2.t18 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) true)) :rule trans :premises (t245.t2.t14 t245.t2.t17))
% 0.42/0.81 (step t245.t2.t19 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule resolution :premises (t245.t2.t2 t245.t2.t18))
% 0.42/0.81 (step t245.t2 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule subproof :discharge (t245.t2.a0 t245.t2.a1 t245.t2.a2 t245.t2.a3 t245.t2.a4))
% 0.42/0.81 (step t245.t3 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 0.42/0.81 (step t245.t4 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t245.t5 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)
% 0.42/0.81 (step t245.t6 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t245.t7 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t245.t8 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t245.t2 t245.t3 t245.t4 t245.t5 t245.t6 t245.t7))
% 0.42/0.81 (step t245.t9 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule reordering :premises (t245.t8))
% 0.42/0.81 (step t245.t10 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule contraction :premises (t245.t9))
% 0.42/0.81 (step t245.t11 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule resolution :premises (t245.t1 t245.t10))
% 0.42/0.81 (step t245.t12 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule implies_neg2)
% 0.42/0.81 (step t245.t13 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule resolution :premises (t245.t11 t245.t12))
% 0.42/0.81 (step t245.t14 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule contraction :premises (t245.t13))
% 0.42/0.81 (step t245.t15 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule implies :premises (t245.t14))
% 0.42/0.81 (step t245.t16 (cl (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.42/0.81 (step t245.t17 (cl (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t245.t16 t245.a2 t245.a3 t245.a4 t245.a1 t245.a0))
% 0.42/0.81 (step t245.t18 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule resolution :premises (t245.t15 t245.t17))
% 0.42/0.81 (step t245 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (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)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule subproof :discharge (t245.a0 t245.a1 t245.a2 t245.a3 t245.a4))
% 0.42/0.81 (step t246 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t247 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t248 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 0.42/0.81 (step t249 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t250 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.81 (step t251 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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)))))) :rule resolution :premises (t245 t246 t247 t248 t249 t250))
% 0.42/0.81 (step t252 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule reordering :premises (t251))
% 0.42/0.81 (step t253 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule contraction :premises (t252))
% 0.42/0.81 (step t254 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule resolution :premises (t244 t253))
% 0.42/0.81 (step t255 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule implies_neg2)
% 0.42/0.81 (step t256 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule resolution :premises (t254 t255))
% 0.42/0.81 (step t257 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule contraction :premises (t256))
% 0.42/0.81 (step t258 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= 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.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule implies :premises (t257))
% 0.42/0.81 (step t259 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (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)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule resolution :premises (t243 t258))
% 0.42/0.81 (step t260 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (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))))) :rule reordering :premises (t259))
% 0.42/0.81 (step t261 (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)
% 0.42/0.81 (step t262 (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 (t261))
% 0.42/0.81 (step t263 (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)
% 0.42/0.81 (anchor :step t264)
% 0.42/0.81 (assume t264.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 0.42/0.81 (step t264.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)))
% 0.42/0.81 (step t264.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 (t264.t1))
% 0.42/0.81 (step t264.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 (t264.t2 t264.a0))
% 0.42/0.81 (step t264 (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 (t264.a0))
% 0.42/0.81 (step t265 (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 (t263 t264))
% 0.42/0.81 (step t266 (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)
% 0.42/0.81 (step t267 (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 (t265 t266))
% 0.42/0.81 (step t268 (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 (t267))
% 0.42/0.81 (step t269 (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 (t268))
% 0.42/0.81 (step t270 (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)
% 0.42/0.81 (anchor :step t271 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.81 (step t271.t1 (cl (= U U)) :rule refl)
% 0.42/0.81 (step t271.t2 (cl (= V V)) :rule refl)
% 0.42/0.81 (step t271.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.42/0.81 (step t271.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.81 (step t271.t5 (cl (= (= (tptp.hd (tptp.cons U V)) U) (= U (tptp.hd (tptp.cons U V))))) :rule all_simplify)
% 0.42/0.81 (step t271.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 (t271.t3 t271.t4 t271.t5))
% 0.42/0.81 (step t271 (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)
% 0.42/0.81 (step t272 (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 (t270 t271 a96))
% 0.42/0.81 (step t273 (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 (t269 t272))
% 0.42/0.81 (step t274 (cl (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t262 a7 t115 t273))
% 0.42/0.81 (step t275 (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)
% 0.42/0.81 (step t276 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (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 (t275))
% 0.42/0.81 (step t277 (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)
% 0.42/0.81 (step t278 (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)
% 0.42/0.81 (step t279 (cl (= (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)))) :rule refl)
% 0.42/0.81 (step t280 (cl (= (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule refl)
% 0.42/0.81 (step t281 (cl (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule refl)
% 0.42/0.81 (step t282 (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)
% 0.42/0.81 (step t283 (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 (t279 t280 t281 t282))
% 0.42/0.81 (step t284 (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 (t278 t283))
% 0.42/0.81 (step t285 (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)
% 0.42/0.81 (anchor :step t286)
% 0.42/0.81 (assume t286.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)))))
% 0.42/0.81 (step t286.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))))
% 0.42/0.81 (step t286.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 (t286.t1))
% 0.42/0.81 (step t286.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 (t286.t2 t286.a0))
% 0.42/0.81 (step t286 (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 (t286.a0))
% 0.42/0.81 (step t287 (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 (t285 t286))
% 0.42/0.81 (step t288 (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)
% 0.42/0.81 (step t289 (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 (t287 t288))
% 0.42/0.81 (step t290 (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 (t289))
% 0.42/0.81 (step t291 (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 (t277 t284 t290))
% 0.42/0.81 (step t292 (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 (t291))
% 0.42/0.81 (step t293 (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 (t292 a122))
% 0.42/0.81 (step t294 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t276 t110 t127 t138 t293))
% 0.42/0.81 (step t295 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule resolution :premises (t260 a190 t105 t138 t274 t294))
% 0.42/0.81 (step t296 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (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)
% 0.42/0.81 (step t297 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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 implies_neg1)
% 0.42/0.81 (anchor :step t298)
% 0.42/0.81 (assume t298.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.81 (assume t298.a1 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (assume t298.a2 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t298.a3 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t298.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.81 (assume t298.a5 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t298.a6 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t298.a7 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (assume t298.a8 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 0.42/0.81 (step t298.t1 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t298.t2)
% 0.42/0.81 (assume t298.t2.a0 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (assume t298.t2.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t298.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)))
% 0.42/0.81 (assume t298.t2.a3 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t298.t2.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.81 (assume t298.t2.a5 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (assume t298.t2.a6 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t298.t2.a7 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t298.t2.a8 (= tptp.sk2 tptp.sk4))
% 0.42/0.81 (step t298.t2.t1 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t298.t2.a8))
% 0.42/0.81 (step t298.t2.t2 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t298.t2.t1))
% 0.42/0.81 (step t298.t2.t3 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4)) :rule symm :premises (t298.t2.a7))
% 0.42/0.81 (step t298.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t298.t2.t3))
% 0.42/0.81 (step t298.t2.t5 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t298.t2.a4))
% 0.42/0.81 (step t298.t2.t6 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t298.t2.t5))
% 0.42/0.81 (step t298.t2.t7 (cl (= (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) :rule symm :premises (t298.t2.a3))
% 0.42/0.81 (step t298.t2.t8 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t298.t2.t7))
% 0.42/0.81 (step t298.t2.t9 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 0.42/0.81 (step t298.t2.t10 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule cong :premises (t298.t2.t8 t298.t2.t9))
% 0.42/0.81 (step t298.t2.t11 (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 (t298.t2.a2))
% 0.42/0.81 (step t298.t2.t12 (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 (t298.t2.t11))
% 0.42/0.81 (step t298.t2.t13 (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 (t298.t2.t12))
% 0.42/0.81 (step t298.t2.t14 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t298.t2.a1))
% 0.42/0.81 (step t298.t2.t15 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t298.t2.t14))
% 0.42/0.81 (step t298.t2.t16 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t298.t2.t15))
% 0.42/0.81 (step t298.t2.t17 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t298.t2.a0))
% 0.42/0.81 (step t298.t2.t18 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t298.t2.t17))
% 0.42/0.81 (step t298.t2.t19 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t298.t2.t18))
% 0.42/0.81 (step t298.t2.t20 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk1)) :rule trans :premises (t298.t2.t16 t298.t2.t19))
% 0.42/0.81 (step t298.t2.t21 (cl (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.tl tptp.sk1))) :rule cong :premises (t298.t2.t20))
% 0.42/0.81 (step t298.t2.t22 (cl (= tptp.sk6 (tptp.tl tptp.sk1))) :rule trans :premises (t298.t2.t6 t298.t2.t10 t298.t2.t13 t298.t2.t21))
% 0.42/0.81 (step t298.t2.t23 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule symm :premises (t298.t2.a6))
% 0.42/0.81 (step t298.t2.t24 (cl (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t298.t2.t23))
% 0.42/0.81 (step t298.t2.t25 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t298.t2.a5))
% 0.42/0.81 (step t298.t2.t26 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule symm :premises (t298.t2.t25))
% 0.42/0.81 (step t298.t2.t27 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd tptp.sk1))) :rule cong :premises (t298.t2.t20))
% 0.42/0.81 (step t298.t2.t28 (cl (= tptp.sk5 (tptp.hd tptp.sk1))) :rule trans :premises (t298.t2.t24 t298.t2.t26 t298.t2.t27))
% 0.42/0.81 (step t298.t2.t29 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.81 (step t298.t2.t30 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) :rule cong :premises (t298.t2.t28 t298.t2.t29))
% 0.42/0.81 (step t298.t2.t31 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule cong :premises (t298.t2.t22 t298.t2.t30))
% 0.42/0.81 (step t298.t2.t32 (cl (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule trans :premises (t298.t2.t2 t298.t2.t4 t298.t2.t31))
% 0.42/0.81 (step t298.t2 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule subproof :discharge (t298.t2.a0 t298.t2.a1 t298.t2.a2 t298.t2.a3 t298.t2.a4 t298.t2.a5 t298.t2.a6 t298.t2.a7 t298.t2.a8))
% 0.42/0.81 (step t298.t3 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t298.t4 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t298.t5 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= (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)
% 0.42/0.81 (step t298.t6 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t298.t7 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t298.t8 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.81 (step t298.t9 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t298.t10 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t298.t11 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.81 (step t298.t12 (cl (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t298.t2 t298.t3 t298.t4 t298.t5 t298.t6 t298.t7 t298.t8 t298.t9 t298.t10 t298.t11))
% 0.42/0.81 (step t298.t13 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule reordering :premises (t298.t12))
% 0.42/0.81 (step t298.t14 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule contraction :premises (t298.t13))
% 0.42/0.81 (step t298.t15 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule resolution :premises (t298.t1 t298.t14))
% 0.42/0.81 (step t298.t16 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))))) :rule implies_neg2)
% 0.42/0.81 (step t298.t17 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))))) :rule resolution :premises (t298.t15 t298.t16))
% 0.42/0.81 (step t298.t18 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))))) :rule contraction :premises (t298.t17))
% 0.42/0.81 (step t298.t19 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule implies :premises (t298.t18))
% 0.42/0.81 (step t298.t20 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.42/0.81 (step t298.t21 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (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)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t298.t20 t298.a1 t298.a2 t298.a8 t298.a5 t298.a4 t298.a7 t298.a6 t298.a3 t298.a0))
% 0.42/0.81 (step t298.t22 (cl (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule resolution :premises (t298.t19 t298.t21))
% 0.42/0.81 (step t298 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (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.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule subproof :discharge (t298.a0 t298.a1 t298.a2 t298.a3 t298.a4 t298.a5 t298.a6 t298.a7 t298.a8))
% 0.42/0.81 (step t299 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.81 (step t300 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t301 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t302 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t303 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t304 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t305 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t306 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.81 (step t307 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= (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)
% 0.42/0.81 (step t308 (cl (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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 resolution :premises (t298 t299 t300 t301 t302 t303 t304 t305 t306 t307))
% 0.42/0.81 (step t309 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule reordering :premises (t308))
% 0.42/0.81 (step t310 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule contraction :premises (t309))
% 0.42/0.81 (step t311 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule resolution :premises (t297 t310))
% 0.42/0.81 (step t312 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (not (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))))) :rule implies_neg2)
% 0.42/0.81 (step t313 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))))) :rule resolution :premises (t311 t312))
% 0.42/0.81 (step t314 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))))) :rule contraction :premises (t313))
% 0.42/0.81 (step t315 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (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)))) (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule implies :premises (t314))
% 0.42/0.81 (step t316 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (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.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule resolution :premises (t296 t315))
% 0.42/0.81 (step t317 (cl (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (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 (t316))
% 0.42/0.81 (step t318 (cl (not (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 0.42/0.81 (step t319 (cl (= (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule all_simplify)
% 0.42/0.81 (step t320 (cl (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t319 t7))
% 0.42/0.81 (step t321 (cl (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t318 t320 a201))
% 0.42/0.81 (step t322 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t321))
% 0.42/0.81 (step t323 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t322))
% 0.42/0.81 (step t324 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t323 t104))
% 0.42/0.81 (step t325 (cl (= tptp.sk2 (tptp.app (tptp.tl tptp.sk1) (tptp.cons (tptp.hd tptp.sk1) tptp.nil)))) :rule resolution :premises (t317 a189 a190 t105 t324 t216 t230 t274 t294 t241))
% 0.42/0.81 (step t326 (cl (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))) (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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))))) :rule and_neg)
% 0.42/0.81 (step t327 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1))) (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t328)
% 0.42/0.81 (assume t328.a0 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (assume t328.a1 (tptp.ssItem tptp.sk5))
% 0.42/0.81 (assume t328.a2 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t328.a3 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t328.a4 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (step t328.t1 (cl (=> (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk1))) (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.42/0.81 (anchor :step t328.t2)
% 0.42/0.81 (assume t328.t2.a0 (tptp.ssItem tptp.sk5))
% 0.42/0.81 (assume t328.t2.a1 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.81 (assume t328.t2.a2 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.81 (assume t328.t2.a3 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.81 (assume t328.t2.a4 (= tptp.sk1 tptp.sk3))
% 0.42/0.81 (step t328.t2.t1 (cl (= (= (tptp.ssItem (tptp.hd tptp.sk1)) true) (tptp.ssItem (tptp.hd tptp.sk1)))) :rule equiv_simplify)
% 0.42/0.81 (step t328.t2.t2 (cl (not (= (tptp.ssItem (tptp.hd tptp.sk1)) true)) (tptp.ssItem (tptp.hd tptp.sk1))) :rule equiv1 :premises (t328.t2.t1))
% 0.42/0.81 (step t328.t2.t3 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t328.t2.a4))
% 0.42/0.81 (step t328.t2.t4 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t328.t2.t3))
% 0.42/0.81 (step t328.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t328.t2.a3))
% 0.42/0.81 (step t328.t2.t6 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t328.t2.t5))
% 0.42/0.81 (step t328.t2.t7 (cl (= tptp.sk1 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t328.t2.t4 t328.t2.t6))
% 0.42/0.81 (step t328.t2.t8 (cl (= (tptp.hd tptp.sk1) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t328.t2.t7))
% 0.42/0.81 (step t328.t2.t9 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t328.t2.a2))
% 0.42/0.81 (step t328.t2.t10 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule symm :premises (t328.t2.a1))
% 0.42/0.81 (step t328.t2.t11 (cl (= (tptp.hd tptp.sk1) tptp.sk5)) :rule trans :premises (t328.t2.t8 t328.t2.t9 t328.t2.t10))
% 0.42/0.81 (step t328.t2.t12 (cl (= (tptp.ssItem (tptp.hd tptp.sk1)) (tptp.ssItem tptp.sk5))) :rule cong :premises (t328.t2.t11))
% 0.42/0.81 (step t328.t2.t13 (cl (= (= (tptp.ssItem tptp.sk5) true) (tptp.ssItem tptp.sk5))) :rule equiv_simplify)
% 0.42/0.81 (step t328.t2.t14 (cl (= (tptp.ssItem tptp.sk5) true) (not (tptp.ssItem tptp.sk5))) :rule equiv2 :premises (t328.t2.t13))
% 0.42/0.81 (step t328.t2.t15 (cl (= (tptp.ssItem tptp.sk5) true)) :rule resolution :premises (t328.t2.t14 t328.t2.a0))
% 0.42/0.81 (step t328.t2.t16 (cl (= (tptp.ssItem (tptp.hd tptp.sk1)) true)) :rule trans :premises (t328.t2.t12 t328.t2.t15))
% 0.42/0.81 (step t328.t2.t17 (cl (tptp.ssItem (tptp.hd tptp.sk1))) :rule resolution :premises (t328.t2.t2 t328.t2.t16))
% 0.42/0.81 (step t328.t2 (cl (not (tptp.ssItem tptp.sk5)) (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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk1))) :rule subproof :discharge (t328.t2.a0 t328.t2.a1 t328.t2.a2 t328.t2.a3 t328.t2.a4))
% 0.42/0.81 (step t328.t3 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssItem tptp.sk5)) :rule and_pos)
% 0.42/0.81 (step t328.t4 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t328.t5 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)
% 0.42/0.81 (step t328.t6 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t328.t7 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t328.t8 (cl (tptp.ssItem (tptp.hd tptp.sk1)) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t328.t2 t328.t3 t328.t4 t328.t5 t328.t6 t328.t7))
% 0.42/0.81 (step t328.t9 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssItem (tptp.hd tptp.sk1))) :rule reordering :premises (t328.t8))
% 0.42/0.81 (step t328.t10 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssItem (tptp.hd tptp.sk1))) :rule contraction :premises (t328.t9))
% 0.42/0.81 (step t328.t11 (cl (=> (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk1))) (tptp.ssItem (tptp.hd tptp.sk1))) :rule resolution :premises (t328.t1 t328.t10))
% 0.42/0.81 (step t328.t12 (cl (=> (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk1))) (not (tptp.ssItem (tptp.hd tptp.sk1)))) :rule implies_neg2)
% 0.42/0.81 (step t328.t13 (cl (=> (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk1))) (=> (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk1)))) :rule resolution :premises (t328.t11 t328.t12))
% 0.42/0.81 (step t328.t14 (cl (=> (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk1)))) :rule contraction :premises (t328.t13))
% 0.42/0.81 (step t328.t15 (cl (not (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) (tptp.ssItem (tptp.hd tptp.sk1))) :rule implies :premises (t328.t14))
% 0.42/0.81 (step t328.t16 (cl (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.42/0.81 (step t328.t17 (cl (and (tptp.ssItem tptp.sk5) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t328.t16 t328.a1 t328.a3 t328.a4 t328.a2 t328.a0))
% 0.42/0.81 (step t328.t18 (cl (tptp.ssItem (tptp.hd tptp.sk1))) :rule resolution :premises (t328.t15 t328.t17))
% 0.42/0.81 (step t328 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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)))) (tptp.ssItem (tptp.hd tptp.sk1))) :rule subproof :discharge (t328.a0 t328.a1 t328.a2 t328.a3 t328.a4))
% 0.42/0.81 (step t329 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.81 (step t330 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem tptp.sk5)) :rule and_pos)
% 0.42/0.81 (step t331 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.81 (step t332 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.81 (step t333 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.81 (step t334 (cl (tptp.ssItem (tptp.hd tptp.sk1)) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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)))))) :rule resolution :premises (t328 t329 t330 t331 t332 t333))
% 0.42/0.81 (step t335 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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))))) (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1))) :rule reordering :premises (t334))
% 0.42/0.81 (step t336 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1))) :rule contraction :premises (t335))
% 0.42/0.81 (step t337 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1))) (tptp.ssItem (tptp.hd tptp.sk1))) :rule resolution :premises (t327 t336))
% 0.42/0.81 (step t338 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1))) (not (tptp.ssItem (tptp.hd tptp.sk1)))) :rule implies_neg2)
% 0.42/0.81 (step t339 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1))) (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1)))) :rule resolution :premises (t337 t338))
% 0.42/0.81 (step t340 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1)))) :rule contraction :premises (t339))
% 0.42/0.81 (step t341 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.ssItem tptp.sk5) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= 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.ssItem (tptp.hd tptp.sk1))) :rule implies :premises (t340))
% 0.42/0.81 (step t342 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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)))) (tptp.ssItem (tptp.hd tptp.sk1))) :rule resolution :premises (t326 t341))
% 0.42/0.81 (step t343 (cl (tptp.ssItem (tptp.hd tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (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))))) :rule reordering :premises (t342))
% 0.42/0.81 (step t344 (cl (tptp.ssItem (tptp.hd tptp.sk1))) :rule resolution :premises (t343 a190 t115 t105 t274 t294))
% 0.42/0.81 (step t345 (cl) :rule resolution :premises (t39 t163 t183 t104 t242 t295 t325 t344 a186))
% 0.42/0.81
% 0.42/0.81 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.fgqQlSWVbF/cvc5---1.0.5_30063.smt2
% 0.42/0.81 % cvc5---1.0.5 exiting
% 0.42/0.81 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------