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