TSTP Solution File: SWC310-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC310-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:01:26 EDT 2024
% Result : Unsatisfiable 0.42s 0.70s
% Output : Proof 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SWC310-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.16 % Command : do_cvc5 %s %d
% 0.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 26 14:46:09 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.23/0.57 %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.42/0.70 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.XoOFnNr2ZJ/cvc5---1.0.5_8747.smt2
% 0.42/0.70 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.XoOFnNr2ZJ/cvc5---1.0.5_8747.smt2
% 0.42/0.76 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.42/0.76 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.42/0.76 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.42/0.76 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.42/0.76 (assume a4 (tptp.strictorderP tptp.nil))
% 0.42/0.76 (assume a5 (tptp.totalorderP tptp.nil))
% 0.42/0.76 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.42/0.76 (assume a7 (tptp.ssList tptp.nil))
% 0.42/0.76 (assume a8 (tptp.ssItem tptp.skac3))
% 0.42/0.76 (assume a9 (tptp.ssItem tptp.skac2))
% 0.42/0.76 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.42/0.76 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.42/0.76 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.42/0.76 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.42/0.76 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.42/0.76 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.42/0.76 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.42/0.76 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.42/0.76 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.42/0.76 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.42/0.76 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.42/0.76 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.42/0.76 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.42/0.76 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.42/0.76 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.42/0.76 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.42/0.76 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.42/0.76 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.42/0.76 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.42/0.76 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.42/0.76 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.42/0.76 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.42/0.76 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.42/0.76 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.42/0.76 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.42/0.76 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.42/0.76 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.42/0.76 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.42/0.76 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.42/0.76 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.42/0.76 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.42/0.76 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.42/0.76 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.42/0.76 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.42/0.76 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.42/0.76 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.42/0.76 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.42/0.76 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.42/0.76 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.42/0.76 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.42/0.76 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.42/0.76 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.42/0.76 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.42/0.76 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.42/0.76 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.42/0.76 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.42/0.76 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.42/0.76 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.42/0.76 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.42/0.76 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.42/0.76 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.42/0.76 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.42/0.76 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.42/0.76 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.42/0.76 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.42/0.76 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.42/0.76 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.42/0.76 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.42/0.76 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.42/0.76 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.42/0.76 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.42/0.76 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.42/0.76 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.42/0.76 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.42/0.76 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.42/0.76 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.42/0.76 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.42/0.76 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.42/0.76 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.42/0.76 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.76 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.42/0.76 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.76 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.42/0.76 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.76 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.42/0.76 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.42/0.76 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.42/0.76 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.42/0.76 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.42/0.76 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.42/0.76 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.42/0.76 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.42/0.76 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.42/0.76 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.42/0.76 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.42/0.76 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.42/0.76 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.42/0.76 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.42/0.76 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.42/0.76 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.42/0.76 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.42/0.76 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.42/0.76 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 0.42/0.76 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.42/0.76 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 0.42/0.76 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 0.42/0.76 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 0.42/0.76 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 0.42/0.76 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.42/0.76 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.42/0.76 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.42/0.76 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 0.42/0.76 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 0.42/0.76 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.42/0.76 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 0.42/0.76 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 0.42/0.76 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.42/0.76 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.42/0.76 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.42/0.76 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 0.42/0.76 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.42/0.76 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.42/0.76 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 0.42/0.76 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 0.42/0.76 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 0.42/0.76 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.42/0.76 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.42/0.76 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.42/0.76 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.42/0.76 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.42/0.76 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 0.42/0.76 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 0.42/0.76 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 0.42/0.76 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 0.42/0.76 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 0.42/0.76 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 0.42/0.76 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 0.42/0.76 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 0.42/0.76 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 0.42/0.76 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 0.42/0.76 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 0.42/0.76 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 0.42/0.76 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 0.42/0.76 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 0.42/0.76 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 0.42/0.76 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 0.42/0.76 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.42/0.76 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 0.42/0.76 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 0.42/0.76 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 0.42/0.76 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 0.42/0.76 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 0.42/0.76 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 0.42/0.76 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 0.42/0.76 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.42/0.76 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 0.42/0.76 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 0.42/0.76 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 0.42/0.76 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.42/0.76 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.42/0.76 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 0.42/0.76 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 0.42/0.76 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 0.42/0.76 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 0.42/0.76 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 0.42/0.76 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 0.42/0.76 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 0.42/0.76 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 0.42/0.76 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 0.42/0.76 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 0.42/0.76 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 0.42/0.76 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 0.42/0.76 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 0.42/0.76 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 0.42/0.76 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 0.42/0.76 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 0.42/0.76 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 0.42/0.76 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 0.42/0.76 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 0.42/0.76 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 0.42/0.76 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 0.42/0.76 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 0.42/0.76 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 0.42/0.76 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 0.42/0.76 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 0.42/0.76 (assume a185 (tptp.ssList tptp.sk1))
% 0.42/0.76 (assume a186 (tptp.ssList tptp.sk2))
% 0.42/0.76 (assume a187 (tptp.ssList tptp.sk3))
% 0.42/0.76 (assume a188 (tptp.ssList tptp.sk4))
% 0.42/0.76 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.42/0.76 (assume a191 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 0.42/0.76 (assume a192 (or (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.76 (assume a193 (or (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.76 (assume a194 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.76 (assume a195 (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 0.42/0.76 (assume a196 (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))
% 0.42/0.76 (assume a197 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk2) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk2) D)) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))))
% 0.42/0.76 (assume a198 (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)))
% 0.42/0.76 (assume a199 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk2) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk2) D)) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))))
% 0.42/0.76 (step t1 (cl (not (= (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.sk2)))) (not (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.sk2))) :rule equiv_pos2)
% 0.42/0.76 (step t2 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 0.42/0.76 (step t3 (cl (= (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule refl)
% 0.42/0.76 (step t4 (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)
% 0.42/0.76 (step t5 (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 (t4))
% 0.42/0.76 (step t6 (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)
% 0.42/0.76 (step t7 (cl (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2))) :rule refl)
% 0.42/0.76 (step t8 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule all_simplify)
% 0.42/0.76 (step t9 (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 (t7 t8))
% 0.42/0.76 (step t10 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule all_simplify)
% 0.42/0.76 (step t11 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) true)) :rule trans :premises (t9 t10))
% 0.42/0.76 (step t12 (cl (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule trans :premises (t6 t11))
% 0.42/0.76 (step t13 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t5 t12))
% 0.42/0.76 (step t14 (cl (= (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.sk2)))) :rule cong :premises (t2 t3 t13))
% 0.42/0.76 (step t15 (cl (not (= (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))))) (not (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule equiv_pos2)
% 0.42/0.76 (step t16 (cl (= (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule refl)
% 0.42/0.76 (step t17 (cl (= (= (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))))) :rule equiv_simplify)
% 0.42/0.76 (step t18 (cl (= (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) (not (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))))) :rule equiv2 :premises (t17))
% 0.42/0.76 (step t19 (cl (not (not (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule not_not)
% 0.42/0.76 (step t20 (cl (= (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t18 t19))
% 0.42/0.76 (step t21 (cl (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t22)
% 0.42/0.76 (assume t22.a0 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 0.42/0.76 (assume t22.a1 (= tptp.nil tptp.sk2))
% 0.42/0.76 (assume t22.a2 (tptp.neq tptp.sk2 tptp.nil))
% 0.42/0.76 (step t22.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 0.42/0.76 (step t22.t2 (cl (= (= true false) false)) :rule all_simplify)
% 0.42/0.76 (step t22.t3 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 0.42/0.76 (step t22.t4 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t22.t3))
% 0.42/0.76 (step t22.t5 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t22.t4 t22.a2))
% 0.42/0.76 (step t22.t6 (cl (= true (tptp.neq tptp.sk2 tptp.nil))) :rule symm :premises (t22.t5))
% 0.42/0.76 (step t22.t7 (cl (= tptp.sk2 tptp.sk2)) :rule refl)
% 0.42/0.76 (step t22.t8 (cl (= tptp.sk2 tptp.nil)) :rule symm :premises (t22.a1))
% 0.42/0.76 (step t22.t9 (cl (= tptp.nil tptp.sk2)) :rule symm :premises (t22.t8))
% 0.42/0.76 (step t22.t10 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.sk2))) :rule cong :premises (t22.t7 t22.t9))
% 0.42/0.76 (step t22.t11 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv_simplify)
% 0.42/0.76 (step t22.t12 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv2 :premises (t22.t11))
% 0.42/0.76 (step t22.t13 (cl (not (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.sk2)) :rule not_not)
% 0.42/0.76 (step t22.t14 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (tptp.neq tptp.sk2 tptp.sk2)) :rule resolution :premises (t22.t12 t22.t13))
% 0.42/0.76 (step t22.t15 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false)) :rule resolution :premises (t22.t14 t22.a0))
% 0.42/0.76 (step t22.t16 (cl (= true false)) :rule trans :premises (t22.t6 t22.t10 t22.t15))
% 0.42/0.76 (step t22.t17 (cl false) :rule resolution :premises (t22.t1 t22.t2 t22.t16))
% 0.42/0.76 (step t22 (cl (not (not (tptp.neq tptp.sk2 tptp.sk2))) (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) false) :rule subproof :discharge (t22.a0 t22.a1 t22.a2))
% 0.42/0.76 (step t23 (cl (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 0.42/0.76 (step t24 (cl (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 0.42/0.76 (step t25 (cl (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.42/0.76 (step t26 (cl false (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t22 t23 t24 t25))
% 0.42/0.76 (step t27 (cl (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) false) :rule reordering :premises (t26))
% 0.42/0.76 (step t28 (cl (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) false) :rule contraction :premises (t27))
% 0.42/0.76 (step t29 (cl (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) false) :rule resolution :premises (t21 t28))
% 0.42/0.76 (step t30 (cl (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) (not false)) :rule implies_neg2)
% 0.42/0.76 (step t31 (cl (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false)) :rule resolution :premises (t29 t30))
% 0.42/0.76 (step t32 (cl (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false)) :rule contraction :premises (t31))
% 0.42/0.76 (step t33 (cl (= (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))))) :rule implies_simplify)
% 0.42/0.76 (step t34 (cl (not (=> (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false)) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))) :rule equiv1 :premises (t33))
% 0.42/0.76 (step t35 (cl (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t32 t34))
% 0.42/0.76 (step t36 (cl (= (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) false)) :rule resolution :premises (t20 t35))
% 0.42/0.76 (step t37 (cl (= (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) false))) :rule cong :premises (t16 t36))
% 0.42/0.76 (step t38 (cl (= (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule all_simplify)
% 0.42/0.76 (step t39 (cl (= (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule trans :premises (t37 t38))
% 0.42/0.76 (step t40 (cl (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t41)
% 0.42/0.76 (assume t41.a0 (= tptp.nil tptp.sk2))
% 0.42/0.76 (assume t41.a1 (tptp.neq tptp.sk2 tptp.nil))
% 0.42/0.76 (assume t41.a2 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 0.42/0.76 (step t41.t1 (cl (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule and_neg)
% 0.42/0.76 (step t41.t2 (cl (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t41.t1 t41.a2 t41.a0 t41.a1))
% 0.42/0.76 (step t41 (cl (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule subproof :discharge (t41.a0 t41.a1 t41.a2))
% 0.42/0.76 (step t42 (cl (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 0.42/0.76 (step t43 (cl (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.42/0.76 (step t44 (cl (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 0.42/0.76 (step t45 (cl (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t41 t42 t43 t44))
% 0.42/0.76 (step t46 (cl (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t45))
% 0.42/0.76 (step t47 (cl (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule contraction :premises (t46))
% 0.42/0.76 (step t48 (cl (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t40 t47))
% 0.42/0.76 (step t49 (cl (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (not (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 0.42/0.76 (step t50 (cl (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t48 t49))
% 0.42/0.76 (step t51 (cl (=> (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (not (tptp.neq tptp.sk2 tptp.sk2)) (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t50))
% 0.42/0.76 (step t52 (cl (not (and (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t15 t39 t51))
% 0.42/0.76 (step t53 (cl (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule not_and :premises (t52))
% 0.42/0.76 (step t54 (cl (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (= tptp.nil tptp.sk2)))) :rule or_neg)
% 0.42/0.76 (step t55 (cl (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule or_neg)
% 0.42/0.76 (step t56 (cl (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule or_neg)
% 0.42/0.76 (step t57 (cl (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t53 t54 t55 t56))
% 0.42/0.76 (step t58 (cl (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule contraction :premises (t57))
% 0.42/0.76 (step t59 (cl (or (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t1 t14 t58))
% 0.42/0.76 (step t60 (cl (not (= tptp.nil tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.sk2)) :rule or :premises (t59))
% 0.42/0.76 (step t61 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk2) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk2) D)) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk2) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk2) D)) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2))))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))))) :rule equiv_pos2)
% 0.42/0.76 (anchor :step t62 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D)))
% 0.42/0.76 (step t62.t1 (cl (= A A)) :rule refl)
% 0.42/0.76 (step t62.t2 (cl (= B B)) :rule refl)
% 0.42/0.76 (step t62.t3 (cl (= C C)) :rule refl)
% 0.42/0.76 (step t62.t4 (cl (= D D)) :rule refl)
% 0.42/0.76 (step t62.t5 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule refl)
% 0.42/0.76 (step t62.t6 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 0.42/0.76 (step t62.t7 (cl (= (not (= tptp.sk1 A)) (not (= tptp.sk1 A)))) :rule refl)
% 0.42/0.76 (step t62.t8 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 0.42/0.76 (step t62.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 0.42/0.76 (step t62.t10 (cl (= (= (tptp.tl tptp.sk2) B) (= B (tptp.tl tptp.sk2)))) :rule all_simplify)
% 0.42/0.76 (step t62.t11 (cl (= (not (= (tptp.tl tptp.sk2) B)) (not (= B (tptp.tl tptp.sk2))))) :rule cong :premises (t62.t10))
% 0.42/0.76 (step t62.t12 (cl (= (= (tptp.app B C) A) (= A (tptp.app B C)))) :rule all_simplify)
% 0.42/0.76 (step t62.t13 (cl (= (not (= (tptp.app B C) A)) (not (= A (tptp.app B C))))) :rule cong :premises (t62.t12))
% 0.42/0.76 (step t62.t14 (cl (= (not (tptp.ssItem D)) (not (tptp.ssItem D)))) :rule refl)
% 0.42/0.76 (step t62.t15 (cl (= (= (tptp.cons D tptp.nil) C) (= C (tptp.cons D tptp.nil)))) :rule all_simplify)
% 0.42/0.76 (step t62.t16 (cl (= (not (= (tptp.cons D tptp.nil) C)) (not (= C (tptp.cons D tptp.nil))))) :rule cong :premises (t62.t15))
% 0.42/0.76 (step t62.t17 (cl (= (= (tptp.hd tptp.sk2) D) (= D (tptp.hd tptp.sk2)))) :rule all_simplify)
% 0.42/0.76 (step t62.t18 (cl (= (not (= (tptp.hd tptp.sk2) D)) (not (= D (tptp.hd tptp.sk2))))) :rule cong :premises (t62.t17))
% 0.42/0.76 (step t62.t19 (cl (= (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))) :rule refl)
% 0.42/0.76 (step t62.t20 (cl (= (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk2) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk2) D)) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2))) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk2))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2))))) :rule cong :premises (t62.t5 t62.t6 t62.t7 t62.t8 t62.t9 t62.t11 t62.t13 t62.t14 t62.t16 t62.t18 t62.t19 t62.t19))
% 0.42/0.76 (step t62 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk2) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk2) D)) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk2))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))))) :rule bind)
% 0.42/0.76 (step t63 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk2))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk2))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))) (not (tptp.neq tptp.nil tptp.sk2)))))) :rule all_simplify)
% 0.42/0.76 (step t64 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk2))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))) (not (tptp.neq tptp.nil tptp.sk2)))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk2))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2)))))))) :rule all_simplify)
% 0.42/0.76 (step t65 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule refl)
% 0.42/0.76 (step t66 (cl (= (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))) :rule refl)
% 0.42/0.76 (step t67 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk2))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))))) (or (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (= (tptp.tl tptp.sk2) (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))) (not (= (tptp.cons (tptp.hd tptp.sk2) tptp.nil) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= (tptp.hd tptp.sk2) (tptp.hd tptp.sk2)))))) :rule all_simplify)
% 0.42/0.76 (step t68 (cl (= (not (tptp.ssList tptp.sk1)) (not (tptp.ssList tptp.sk1)))) :rule refl)
% 0.42/0.76 (step t69 (cl (= (= tptp.sk1 tptp.sk1) true)) :rule all_simplify)
% 0.42/0.76 (step t70 (cl (= (not (= tptp.sk1 tptp.sk1)) (not true))) :rule cong :premises (t69))
% 0.42/0.76 (step t71 (cl (= (not true) false)) :rule all_simplify)
% 0.42/0.76 (step t72 (cl (= (not (= tptp.sk1 tptp.sk1)) false)) :rule trans :premises (t70 t71))
% 0.42/0.76 (step t73 (cl (= (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.tl tptp.sk2))))) :rule refl)
% 0.42/0.76 (step t74 (cl (= (= (tptp.tl tptp.sk2) (tptp.tl tptp.sk2)) true)) :rule all_simplify)
% 0.42/0.76 (step t75 (cl (= (not (= (tptp.tl tptp.sk2) (tptp.tl tptp.sk2))) (not true))) :rule cong :premises (t74))
% 0.42/0.76 (step t76 (cl (= (not (= (tptp.tl tptp.sk2) (tptp.tl tptp.sk2))) false)) :rule trans :premises (t75 t71))
% 0.42/0.76 (step t77 (cl (= (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))))) :rule refl)
% 0.42/0.76 (step t78 (cl (= (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))))) :rule refl)
% 0.42/0.76 (step t79 (cl (= (not (tptp.ssItem (tptp.hd tptp.sk2))) (not (tptp.ssItem (tptp.hd tptp.sk2))))) :rule refl)
% 0.42/0.76 (step t80 (cl (= (= (tptp.cons (tptp.hd tptp.sk2) tptp.nil) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) true)) :rule all_simplify)
% 0.42/0.76 (step t81 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk2) tptp.nil) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not true))) :rule cong :premises (t80))
% 0.42/0.76 (step t82 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk2) tptp.nil) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) false)) :rule trans :premises (t81 t71))
% 0.42/0.76 (step t83 (cl (= (= (tptp.hd tptp.sk2) (tptp.hd tptp.sk2)) true)) :rule all_simplify)
% 0.42/0.76 (step t84 (cl (= (not (= (tptp.hd tptp.sk2) (tptp.hd tptp.sk2))) (not true))) :rule cong :premises (t83))
% 0.42/0.76 (step t85 (cl (= (not (= (tptp.hd tptp.sk2) (tptp.hd tptp.sk2))) false)) :rule trans :premises (t84 t71))
% 0.42/0.76 (step t86 (cl (= (or (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (= (tptp.tl tptp.sk2) (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))) (not (= (tptp.cons (tptp.hd tptp.sk2) tptp.nil) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= (tptp.hd tptp.sk2) (tptp.hd tptp.sk2)))) (or (not (tptp.ssList tptp.sk1)) false (not (tptp.ssList (tptp.tl tptp.sk2))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))) false false))) :rule cong :premises (t68 t72 t73 t76 t77 t78 t79 t82 t85))
% 0.42/0.76 (step t87 (cl (= (or (not (tptp.ssList tptp.sk1)) false (not (tptp.ssList (tptp.tl tptp.sk2))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))) false false) (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule all_simplify)
% 0.42/0.76 (step t88 (cl (= (or (not (tptp.ssList tptp.sk1)) (not (= tptp.sk1 tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (= (tptp.tl tptp.sk2) (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))) (not (= (tptp.cons (tptp.hd tptp.sk2) tptp.nil) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= (tptp.hd tptp.sk2) (tptp.hd tptp.sk2)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule trans :premises (t86 t87))
% 0.42/0.76 (step t89 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk2))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule trans :premises (t67 t88))
% 0.42/0.76 (step t90 (cl (= (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk2))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2)))))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))))))) :rule cong :premises (t65 t66 t89))
% 0.42/0.76 (step t91 (cl (= (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (or (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule all_simplify)
% 0.42/0.76 (step t92 (cl (= (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk2))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2)))))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule trans :premises (t90 t91))
% 0.42/0.76 (step t93 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk2))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))) (not (tptp.neq tptp.nil tptp.sk2)))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule trans :premises (t64 t92))
% 0.42/0.76 (step t94 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk2))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk2))) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule trans :premises (t63 t93))
% 0.42/0.76 (step t95 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (= tptp.sk1 A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk2) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk2) D)) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.neq tptp.nil tptp.sk2)))) (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))))) :rule trans :premises (t62 t94))
% 0.42/0.76 (step t96 (cl (or (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2))))) :rule resolution :premises (t61 t95 a197))
% 0.42/0.76 (step t97 (cl (= tptp.nil tptp.sk2) (not (tptp.neq tptp.nil tptp.sk2)) (not (tptp.ssList tptp.sk1)) (not (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk2)))) :rule or :premises (t96))
% 0.42/0.76 (step t98 (cl (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule and_neg)
% 0.42/0.76 (step t99 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2))) (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t100)
% 0.42/0.76 (assume t100.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t100.a1 (tptp.ssList tptp.sk6))
% 0.42/0.76 (assume t100.a2 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t100.a3 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.76 (assume t100.a4 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t100.a5 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 0.42/0.76 (step t100.t1 (cl (=> (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.tl tptp.sk2))) (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t100.t2)
% 0.42/0.76 (assume t100.t2.a0 (tptp.ssList tptp.sk6))
% 0.42/0.76 (assume t100.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.76 (assume t100.t2.a2 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t100.t2.a3 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 0.42/0.76 (assume t100.t2.a4 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t100.t2.a5 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (step t100.t2.t1 (cl (= (= (tptp.ssList (tptp.tl tptp.sk2)) true) (tptp.ssList (tptp.tl tptp.sk2)))) :rule equiv_simplify)
% 0.42/0.76 (step t100.t2.t2 (cl (not (= (tptp.ssList (tptp.tl tptp.sk2)) true)) (tptp.ssList (tptp.tl tptp.sk2))) :rule equiv1 :premises (t100.t2.t1))
% 0.42/0.76 (step t100.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t100.t2.a5))
% 0.42/0.76 (step t100.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t100.t2.t3))
% 0.42/0.76 (step t100.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4)) :rule symm :premises (t100.t2.a4))
% 0.42/0.76 (step t100.t2.t6 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t100.t2.t5))
% 0.42/0.76 (step t100.t2.t7 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t100.t2.t4 t100.t2.t6))
% 0.42/0.76 (step t100.t2.t8 (cl (= (tptp.tl tptp.sk2) (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t100.t2.t7))
% 0.42/0.76 (step t100.t2.t9 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule symm :premises (t100.t2.a3))
% 0.42/0.76 (step t100.t2.t10 (cl (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule symm :premises (t100.t2.t9))
% 0.42/0.76 (step t100.t2.t11 (cl (= (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) :rule symm :premises (t100.t2.a2))
% 0.42/0.76 (step t100.t2.t12 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 0.42/0.76 (step t100.t2.t13 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (tptp.app tptp.nil tptp.sk6))) :rule cong :premises (t100.t2.t11 t100.t2.t12))
% 0.42/0.76 (step t100.t2.t14 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t100.t2.a1))
% 0.42/0.76 (step t100.t2.t15 (cl (= (tptp.tl tptp.sk2) tptp.sk6)) :rule trans :premises (t100.t2.t8 t100.t2.t10 t100.t2.t13 t100.t2.t14))
% 0.42/0.76 (step t100.t2.t16 (cl (= (tptp.ssList (tptp.tl tptp.sk2)) (tptp.ssList tptp.sk6))) :rule cong :premises (t100.t2.t15))
% 0.42/0.76 (step t100.t2.t17 (cl (= (= (tptp.ssList tptp.sk6) true) (tptp.ssList tptp.sk6))) :rule equiv_simplify)
% 0.42/0.76 (step t100.t2.t18 (cl (= (tptp.ssList tptp.sk6) true) (not (tptp.ssList tptp.sk6))) :rule equiv2 :premises (t100.t2.t17))
% 0.42/0.76 (step t100.t2.t19 (cl (= (tptp.ssList tptp.sk6) true)) :rule resolution :premises (t100.t2.t18 t100.t2.a0))
% 0.42/0.76 (step t100.t2.t20 (cl (= (tptp.ssList (tptp.tl tptp.sk2)) true)) :rule trans :premises (t100.t2.t16 t100.t2.t19))
% 0.42/0.76 (step t100.t2.t21 (cl (tptp.ssList (tptp.tl tptp.sk2))) :rule resolution :premises (t100.t2.t2 t100.t2.t20))
% 0.42/0.76 (step t100.t2 (cl (not (tptp.ssList tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.tl tptp.sk2))) :rule subproof :discharge (t100.t2.a0 t100.t2.a1 t100.t2.a2 t100.t2.a3 t100.t2.a4 t100.t2.a5))
% 0.42/0.76 (step t100.t3 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList tptp.sk6)) :rule and_pos)
% 0.42/0.76 (step t100.t4 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t100.t5 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t100.t6 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t100.t7 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t100.t8 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t100.t9 (cl (tptp.ssList (tptp.tl tptp.sk2)) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t100.t2 t100.t3 t100.t4 t100.t5 t100.t6 t100.t7 t100.t8))
% 0.42/0.76 (step t100.t10 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList (tptp.tl tptp.sk2))) :rule reordering :premises (t100.t9))
% 0.42/0.76 (step t100.t11 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList (tptp.tl tptp.sk2))) :rule contraction :premises (t100.t10))
% 0.42/0.76 (step t100.t12 (cl (=> (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.tl tptp.sk2))) (tptp.ssList (tptp.tl tptp.sk2))) :rule resolution :premises (t100.t1 t100.t11))
% 0.42/0.76 (step t100.t13 (cl (=> (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.tl tptp.sk2)))) :rule implies_neg2)
% 0.42/0.76 (step t100.t14 (cl (=> (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.tl tptp.sk2))) (=> (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.tl tptp.sk2)))) :rule resolution :premises (t100.t12 t100.t13))
% 0.42/0.76 (step t100.t15 (cl (=> (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.tl tptp.sk2)))) :rule contraction :premises (t100.t14))
% 0.42/0.76 (step t100.t16 (cl (not (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList (tptp.tl tptp.sk2))) :rule implies :premises (t100.t15))
% 0.42/0.76 (step t100.t17 (cl (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.42/0.76 (step t100.t18 (cl (and (tptp.ssList tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t100.t17 t100.a1 t100.a3 t100.a4 t100.a5 t100.a2 t100.a0))
% 0.42/0.76 (step t100.t19 (cl (tptp.ssList (tptp.tl tptp.sk2))) :rule resolution :premises (t100.t16 t100.t18))
% 0.42/0.76 (step t100 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2))) :rule subproof :discharge (t100.a0 t100.a1 t100.a2 t100.a3 t100.a4 t100.a5))
% 0.42/0.76 (step t101 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t102 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (tptp.ssList tptp.sk6)) :rule and_pos)
% 0.42/0.76 (step t103 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t104 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t105 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t106 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t107 (cl (tptp.ssList (tptp.tl tptp.sk2)) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule resolution :premises (t100 t101 t102 t103 t104 t105 t106))
% 0.42/0.76 (step t108 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (tptp.ssList (tptp.tl tptp.sk2))) :rule reordering :premises (t107))
% 0.42/0.76 (step t109 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (tptp.ssList (tptp.tl tptp.sk2))) :rule contraction :premises (t108))
% 0.42/0.76 (step t110 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2))) (tptp.ssList (tptp.tl tptp.sk2))) :rule resolution :premises (t99 t109))
% 0.42/0.76 (step t111 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2))) (not (tptp.ssList (tptp.tl tptp.sk2)))) :rule implies_neg2)
% 0.42/0.76 (step t112 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2)))) :rule resolution :premises (t110 t111))
% 0.42/0.76 (step t113 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2)))) :rule contraction :premises (t112))
% 0.42/0.76 (step t114 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList tptp.sk6) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (tptp.ssList (tptp.tl tptp.sk2))) :rule implies :premises (t113))
% 0.42/0.76 (step t115 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.ssList (tptp.tl tptp.sk2))) :rule resolution :premises (t98 t114))
% 0.42/0.76 (step t116 (cl (tptp.ssList (tptp.tl tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssList tptp.sk6)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule reordering :premises (t115))
% 0.42/0.76 (step t117 (cl (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a193))
% 0.42/0.76 (step t118 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk6)) :rule reordering :premises (t117))
% 0.42/0.76 (step t119 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule equiv_pos2)
% 0.42/0.76 (step t120 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 0.42/0.76 (step t121 (cl (= (= (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) true) (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_simplify)
% 0.42/0.76 (step t122 (cl (not (= (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) true)) (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv1 :premises (t121))
% 0.42/0.76 (step t123 (cl (= (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) (= (tptp.neq tptp.sk4 tptp.nil) (not (not (tptp.neq tptp.sk4 tptp.nil)))))) :rule all_simplify)
% 0.42/0.76 (step t124 (cl (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule refl)
% 0.42/0.76 (step t125 (cl (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil))) :rule all_simplify)
% 0.42/0.76 (step t126 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) (not (not (tptp.neq tptp.sk4 tptp.nil)))) (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk4 tptp.nil)))) :rule cong :premises (t124 t125))
% 0.42/0.76 (step t127 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk4 tptp.nil)) true)) :rule all_simplify)
% 0.42/0.76 (step t128 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) (not (not (tptp.neq tptp.sk4 tptp.nil)))) true)) :rule trans :premises (t126 t127))
% 0.42/0.76 (step t129 (cl (= (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) true)) :rule trans :premises (t123 t128))
% 0.42/0.76 (step t130 (cl (= (not (not (tptp.neq tptp.sk4 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t122 t129))
% 0.42/0.76 (step t131 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil))))) :rule cong :premises (t120 t130 t3))
% 0.42/0.76 (step t132 (cl (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil)))) :rule and_neg)
% 0.42/0.76 (step t133 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t134)
% 0.42/0.76 (assume t134.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t134.a1 (not (tptp.neq tptp.sk4 tptp.nil)))
% 0.42/0.76 (step t134.t1 (cl (=> (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t134.t2)
% 0.42/0.76 (assume t134.t2.a0 (not (tptp.neq tptp.sk4 tptp.nil)))
% 0.42/0.76 (assume t134.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (step t134.t2.t1 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) false) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule equiv_simplify)
% 0.42/0.76 (step t134.t2.t2 (cl (not (= (tptp.neq tptp.sk2 tptp.nil) false)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv1 :premises (t134.t2.t1))
% 0.42/0.76 (step t134.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t134.t2.a1))
% 0.42/0.76 (step t134.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t134.t2.t3))
% 0.42/0.76 (step t134.t2.t5 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.76 (step t134.t2.t6 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t134.t2.t4 t134.t2.t5))
% 0.42/0.76 (step t134.t2.t7 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) false) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_simplify)
% 0.42/0.76 (step t134.t2.t8 (cl (= (tptp.neq tptp.sk4 tptp.nil) false) (not (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv2 :premises (t134.t2.t7))
% 0.42/0.76 (step t134.t2.t9 (cl (not (not (not (tptp.neq tptp.sk4 tptp.nil)))) (tptp.neq tptp.sk4 tptp.nil)) :rule not_not)
% 0.42/0.76 (step t134.t2.t10 (cl (= (tptp.neq tptp.sk4 tptp.nil) false) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t134.t2.t8 t134.t2.t9))
% 0.42/0.76 (step t134.t2.t11 (cl (= (tptp.neq tptp.sk4 tptp.nil) false)) :rule resolution :premises (t134.t2.t10 t134.t2.a0))
% 0.42/0.76 (step t134.t2.t12 (cl (= (tptp.neq tptp.sk2 tptp.nil) false)) :rule trans :premises (t134.t2.t6 t134.t2.t11))
% 0.42/0.76 (step t134.t2.t13 (cl (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t134.t2.t2 t134.t2.t12))
% 0.42/0.76 (step t134.t2 (cl (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule subproof :discharge (t134.t2.a0 t134.t2.a1))
% 0.42/0.76 (step t134.t3 (cl (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule and_pos)
% 0.42/0.76 (step t134.t4 (cl (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t134.t5 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t134.t2 t134.t3 t134.t4))
% 0.42/0.76 (step t134.t6 (cl (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t134.t5))
% 0.42/0.76 (step t134.t7 (cl (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule contraction :premises (t134.t6))
% 0.42/0.76 (step t134.t8 (cl (=> (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t134.t1 t134.t7))
% 0.42/0.76 (step t134.t9 (cl (=> (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 0.42/0.76 (step t134.t10 (cl (=> (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) (=> (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t134.t8 t134.t9))
% 0.42/0.76 (step t134.t11 (cl (=> (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t134.t10))
% 0.42/0.76 (step t134.t12 (cl (not (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule implies :premises (t134.t11))
% 0.42/0.76 (step t134.t13 (cl (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.42/0.76 (step t134.t14 (cl (and (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t134.t13 t134.a1 t134.a0))
% 0.42/0.76 (step t134.t15 (cl (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t134.t12 t134.t14))
% 0.42/0.76 (step t134 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule subproof :discharge (t134.a0 t134.a1))
% 0.42/0.76 (step t135 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t136 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule and_pos)
% 0.42/0.76 (step t137 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule resolution :premises (t134 t135 t136))
% 0.42/0.76 (step t138 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t137))
% 0.42/0.76 (step t139 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule contraction :premises (t138))
% 0.42/0.76 (step t140 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t133 t139))
% 0.42/0.76 (step t141 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 0.42/0.76 (step t142 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t140 t141))
% 0.42/0.76 (step t143 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t142))
% 0.42/0.76 (step t144 (cl (not (and (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule implies :premises (t143))
% 0.42/0.76 (step t145 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) :rule resolution :premises (t132 t144))
% 0.42/0.76 (step t146 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.42/0.76 (step t147 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (not (tptp.neq tptp.sk4 tptp.nil))))) :rule or_neg)
% 0.42/0.76 (step t148 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule or_neg)
% 0.42/0.76 (step t149 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t145 t146 t147 t148))
% 0.42/0.76 (step t150 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule contraction :premises (t149))
% 0.42/0.76 (step t151 (cl (or (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t119 t131 t150))
% 0.42/0.76 (step t152 (cl (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.neq tptp.sk2 tptp.nil))) :rule or :premises (t151))
% 0.42/0.76 (step t153 (cl (tptp.neq tptp.sk4 tptp.nil) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t152))
% 0.42/0.76 (step t154 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a191))
% 0.42/0.76 (step t155 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 0.42/0.76 (step t156 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 0.42/0.76 (step t157 (cl (= (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true) (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 0.42/0.76 (step t158 (cl (not (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true)) (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule equiv1 :premises (t157))
% 0.42/0.76 (step t159 (cl (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))))) :rule all_simplify)
% 0.42/0.76 (step t160 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1))) :rule refl)
% 0.42/0.76 (step t161 (cl (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule all_simplify)
% 0.42/0.76 (step t162 (cl (= (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))) (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)))) :rule cong :premises (t160 t161))
% 0.42/0.76 (step t163 (cl (= (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk1)) true)) :rule all_simplify)
% 0.42/0.76 (step t164 (cl (= (= (= tptp.nil tptp.sk1) (not (not (= tptp.nil tptp.sk1)))) true)) :rule trans :premises (t162 t163))
% 0.42/0.76 (step t165 (cl (= (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1)) true)) :rule trans :premises (t159 t164))
% 0.42/0.76 (step t166 (cl (= (not (not (= tptp.nil tptp.sk1))) (= tptp.nil tptp.sk1))) :rule resolution :premises (t158 t165))
% 0.42/0.76 (step t167 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 0.42/0.76 (step t168 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))))) :rule cong :premises (t156 t166 t167))
% 0.42/0.76 (step t169 (cl (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1)))) :rule and_neg)
% 0.42/0.76 (step t170 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t171)
% 0.42/0.76 (assume t171.a0 (= tptp.sk1 tptp.sk3))
% 0.42/0.76 (assume t171.a1 (not (= tptp.nil tptp.sk1)))
% 0.42/0.76 (step t171.t1 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t171.t2)
% 0.42/0.76 (assume t171.t2.a0 (not (= tptp.nil tptp.sk1)))
% 0.42/0.76 (assume t171.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.42/0.76 (step t171.t2.t1 (cl (= (= (= tptp.nil tptp.sk3) false) (not (= tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 0.42/0.76 (step t171.t2.t2 (cl (not (= (= tptp.nil tptp.sk3) false)) (not (= tptp.nil tptp.sk3))) :rule equiv1 :premises (t171.t2.t1))
% 0.42/0.76 (step t171.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.76 (step t171.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t171.t2.a1))
% 0.42/0.76 (step t171.t2.t5 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk1))) :rule cong :premises (t171.t2.t3 t171.t2.t4))
% 0.42/0.76 (step t171.t2.t6 (cl (= (= (= tptp.nil tptp.sk1) false) (not (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 0.42/0.76 (step t171.t2.t7 (cl (= (= tptp.nil tptp.sk1) false) (not (not (= tptp.nil tptp.sk1)))) :rule equiv2 :premises (t171.t2.t6))
% 0.42/0.76 (step t171.t2.t8 (cl (not (not (not (= tptp.nil tptp.sk1)))) (= tptp.nil tptp.sk1)) :rule not_not)
% 0.42/0.76 (step t171.t2.t9 (cl (= (= tptp.nil tptp.sk1) false) (= tptp.nil tptp.sk1)) :rule resolution :premises (t171.t2.t7 t171.t2.t8))
% 0.42/0.76 (step t171.t2.t10 (cl (= (= tptp.nil tptp.sk1) false)) :rule resolution :premises (t171.t2.t9 t171.t2.a0))
% 0.42/0.76 (step t171.t2.t11 (cl (= (= tptp.nil tptp.sk3) false)) :rule trans :premises (t171.t2.t5 t171.t2.t10))
% 0.42/0.76 (step t171.t2.t12 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t171.t2.t2 t171.t2.t11))
% 0.42/0.76 (step t171.t2 (cl (not (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t171.t2.a0 t171.t2.a1))
% 0.42/0.76 (step t171.t3 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule and_pos)
% 0.42/0.76 (step t171.t4 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.76 (step t171.t5 (cl (not (= tptp.nil tptp.sk3)) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t171.t2 t171.t3 t171.t4))
% 0.42/0.76 (step t171.t6 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t171.t5))
% 0.42/0.76 (step t171.t7 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t171.t6))
% 0.42/0.76 (step t171.t8 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t171.t1 t171.t7))
% 0.42/0.76 (step t171.t9 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 0.42/0.76 (step t171.t10 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t171.t8 t171.t9))
% 0.42/0.76 (step t171.t11 (cl (=> (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t171.t10))
% 0.42/0.76 (step t171.t12 (cl (not (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t171.t11))
% 0.42/0.76 (step t171.t13 (cl (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.42/0.76 (step t171.t14 (cl (and (not (= tptp.nil tptp.sk1)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t171.t13 t171.a1 t171.a0))
% 0.42/0.76 (step t171.t15 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t171.t12 t171.t14))
% 0.42/0.76 (step t171 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) :rule subproof :discharge (t171.a0 t171.a1))
% 0.42/0.76 (step t172 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.76 (step t173 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk1))) :rule and_pos)
% 0.42/0.76 (step t174 (cl (not (= tptp.nil tptp.sk3)) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))))) :rule resolution :premises (t171 t172 t173))
% 0.42/0.76 (step t175 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t174))
% 0.42/0.76 (step t176 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t175))
% 0.42/0.76 (step t177 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t170 t176))
% 0.42/0.76 (step t178 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 0.42/0.76 (step t179 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t177 t178))
% 0.42/0.76 (step t180 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t179))
% 0.42/0.76 (step t181 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk1)))) (not (= tptp.nil tptp.sk3))) :rule implies :premises (t180))
% 0.42/0.76 (step t182 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t169 t181))
% 0.42/0.76 (step t183 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 0.42/0.76 (step t184 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (not (= tptp.nil tptp.sk1))))) :rule or_neg)
% 0.42/0.76 (step t185 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 0.42/0.76 (step t186 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t182 t183 t184 t185))
% 0.42/0.76 (step t187 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3)))) :rule contraction :premises (t186))
% 0.42/0.76 (step t188 (cl (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3)))) :rule resolution :premises (t155 t168 t187))
% 0.42/0.76 (step t189 (cl (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk1) (not (= tptp.nil tptp.sk3))) :rule or :premises (t188))
% 0.42/0.76 (step t190 (cl (= tptp.nil tptp.sk1) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t189))
% 0.42/0.76 (step t191 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule and_neg)
% 0.42/0.76 (step t192 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t193)
% 0.42/0.76 (assume t193.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t193.a1 (= tptp.nil tptp.sk2))
% 0.42/0.76 (step t193.t1 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t193.t2)
% 0.42/0.76 (assume t193.t2.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t193.t2.a1 (= tptp.nil tptp.sk2))
% 0.42/0.76 (step t193.t2.t1 (cl (= tptp.sk2 tptp.nil)) :rule symm :premises (t193.t2.a1))
% 0.42/0.76 (step t193.t2.t2 (cl (= tptp.nil tptp.sk2)) :rule symm :premises (t193.t2.t1))
% 0.42/0.76 (step t193.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t193.t2.a0))
% 0.42/0.76 (step t193.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t193.t2.t3))
% 0.42/0.76 (step t193.t2.t5 (cl (= tptp.nil tptp.sk4)) :rule trans :premises (t193.t2.t2 t193.t2.t4))
% 0.42/0.76 (step t193.t2 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule subproof :discharge (t193.t2.a0 t193.t2.a1))
% 0.42/0.76 (step t193.t3 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t193.t4 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 0.42/0.76 (step t193.t5 (cl (= tptp.nil tptp.sk4) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t193.t2 t193.t3 t193.t4))
% 0.42/0.76 (step t193.t6 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule reordering :premises (t193.t5))
% 0.42/0.76 (step t193.t7 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule contraction :premises (t193.t6))
% 0.42/0.76 (step t193.t8 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t193.t1 t193.t7))
% 0.42/0.76 (step t193.t9 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule implies_neg2)
% 0.42/0.76 (step t193.t10 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t193.t8 t193.t9))
% 0.42/0.76 (step t193.t11 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule contraction :premises (t193.t10))
% 0.42/0.76 (step t193.t12 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule implies :premises (t193.t11))
% 0.42/0.76 (step t193.t13 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule and_neg)
% 0.42/0.76 (step t193.t14 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) :rule resolution :premises (t193.t13 t193.a0 t193.a1))
% 0.42/0.76 (step t193.t15 (cl (= tptp.nil tptp.sk4)) :rule resolution :premises (t193.t12 t193.t14))
% 0.42/0.76 (step t193 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule subproof :discharge (t193.a0 t193.a1))
% 0.42/0.76 (step t194 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t195 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 0.42/0.76 (step t196 (cl (= tptp.nil tptp.sk4) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t193 t194 t195))
% 0.42/0.76 (step t197 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule reordering :premises (t196))
% 0.42/0.76 (step t198 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule contraction :premises (t197))
% 0.42/0.76 (step t199 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t192 t198))
% 0.42/0.76 (step t200 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule implies_neg2)
% 0.42/0.76 (step t201 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t199 t200))
% 0.42/0.76 (step t202 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4))) :rule contraction :premises (t201))
% 0.42/0.76 (step t203 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk4)) :rule implies :premises (t202))
% 0.42/0.76 (step t204 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (= tptp.nil tptp.sk4)) :rule resolution :premises (t191 t203))
% 0.42/0.76 (step t205 (cl (= tptp.nil tptp.sk4) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2))) :rule reordering :premises (t204))
% 0.42/0.76 (step t206 (cl (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)) :rule or :premises (a198))
% 0.42/0.76 (step t207 (cl (tptp.neq tptp.sk2 tptp.nil) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t206))
% 0.42/0.76 (step t208 (cl (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) :rule or :premises (a196))
% 0.42/0.76 (step t209 (cl (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)) :rule resolution :premises (t154 t190 a190 t205 a189 t207 t208))
% 0.42/0.76 (step t210 (cl (tptp.neq tptp.sk2 tptp.nil)) :rule contraction :premises (t209))
% 0.42/0.76 (step t211 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t153 a189 t210))
% 0.42/0.76 (step t212 (cl (tptp.ssList tptp.sk6)) :rule resolution :premises (t118 t211))
% 0.42/0.76 (step t213 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 0.42/0.76 (step t214 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 0.42/0.76 (step t215 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 0.42/0.76 (step t216 (cl (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t214 t215))
% 0.42/0.76 (step t217 (cl (or (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t213 t216 a194))
% 0.42/0.76 (step t218 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t217))
% 0.42/0.76 (step t219 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t218))
% 0.42/0.76 (step t220 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t219 t211))
% 0.42/0.76 (step t221 (cl (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule or_pos)
% 0.42/0.76 (step t222 (cl (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule reordering :premises (t221))
% 0.42/0.76 (step t223 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t224)
% 0.42/0.76 (assume t224.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 0.42/0.76 (step t224.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 0.42/0.76 (step t224.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule or :premises (t224.t1))
% 0.42/0.76 (step t224.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t224.t2 t224.a0))
% 0.42/0.76 (step t224 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule subproof :discharge (t224.a0))
% 0.42/0.76 (step t225 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t223 t224))
% 0.42/0.76 (step t226 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule implies_neg2)
% 0.42/0.76 (step t227 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t225 t226))
% 0.42/0.76 (step t228 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule contraction :premises (t227))
% 0.42/0.76 (step t229 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies :premises (t228))
% 0.42/0.76 (step t230 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 0.42/0.76 (anchor :step t231 :args ((U $$unsorted) (:= U U)))
% 0.42/0.76 (step t231.t1 (cl (= U U)) :rule refl)
% 0.42/0.76 (step t231.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.42/0.76 (step t231.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 0.42/0.76 (step t231.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule cong :premises (t231.t2 t231.t3))
% 0.42/0.76 (step t231 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 0.42/0.76 (step t232 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t230 t231 a73))
% 0.42/0.76 (step t233 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t229 t232))
% 0.42/0.76 (step t234 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule resolution :premises (t222 t212 t233))
% 0.42/0.76 (step t235 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 0.42/0.76 (step t236 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t235))
% 0.42/0.76 (step t237 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a192))
% 0.42/0.76 (step t238 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t237 t211))
% 0.42/0.76 (step t239 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t240)
% 0.42/0.76 (assume t240.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))
% 0.42/0.76 (step t240.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 0.42/0.76 (step t240.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t240.t1))
% 0.42/0.76 (step t240.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t240.t2 t240.a0))
% 0.42/0.76 (step t240 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t240.a0))
% 0.42/0.76 (step t241 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t239 t240))
% 0.42/0.76 (step t242 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 0.42/0.76 (step t243 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t241 t242))
% 0.42/0.76 (step t244 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t243))
% 0.42/0.76 (step t245 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t244))
% 0.42/0.76 (step t246 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule equiv_pos2)
% 0.42/0.76 (anchor :step t247 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.76 (step t247.t1 (cl (= U U)) :rule refl)
% 0.42/0.76 (step t247.t2 (cl (= V V)) :rule refl)
% 0.42/0.76 (step t247.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.42/0.76 (step t247.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.76 (step t247.t5 (cl (= (= (tptp.tl (tptp.cons U V)) V) (= V (tptp.tl (tptp.cons U V))))) :rule all_simplify)
% 0.42/0.76 (step t247.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 (t247.t3 t247.t4 t247.t5))
% 0.42/0.76 (step t247 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) :rule bind)
% 0.42/0.76 (step t248 (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 (t246 t247 a95))
% 0.42/0.76 (step t249 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t245 t248))
% 0.42/0.76 (step t250 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t236 a7 t238 t249))
% 0.42/0.76 (step t251 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule or_pos)
% 0.42/0.76 (step t252 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule reordering :premises (t251))
% 0.42/0.76 (step t253 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 0.42/0.76 (step t254 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t253))
% 0.42/0.76 (step t255 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t256)
% 0.42/0.76 (assume t256.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.42/0.76 (step t256.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 0.42/0.76 (step t256.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t256.t1))
% 0.42/0.76 (step t256.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t256.t2 t256.a0))
% 0.42/0.76 (step t256 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t256.a0))
% 0.42/0.76 (step t257 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t255 t256))
% 0.42/0.76 (step t258 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 0.42/0.76 (step t259 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t257 t258))
% 0.42/0.76 (step t260 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t259))
% 0.42/0.76 (step t261 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t260))
% 0.42/0.76 (step t262 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 0.42/0.76 (anchor :step t263 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.76 (step t263.t1 (cl (= U U)) :rule refl)
% 0.42/0.76 (step t263.t2 (cl (= V V)) :rule refl)
% 0.42/0.76 (step t263.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 0.42/0.76 (step t263.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t263.t3))
% 0.42/0.76 (step t263.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.42/0.76 (step t263.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.76 (step t263.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 (t263.t4 t263.t5 t263.t6))
% 0.42/0.76 (step t263 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 0.42/0.76 (step t264 (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 (t262 t263 a97))
% 0.42/0.76 (step t265 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t261 t264))
% 0.42/0.76 (step t266 (cl (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t254 a7 t238 t265))
% 0.42/0.76 (step t267 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 0.42/0.76 (step t268 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t267))
% 0.42/0.76 (step t269 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t270)
% 0.42/0.76 (assume t270.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.42/0.76 (step t270.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 0.42/0.76 (step t270.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t270.t1))
% 0.42/0.76 (step t270.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t270.t2 t270.a0))
% 0.42/0.76 (step t270 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t270.a0))
% 0.42/0.76 (step t271 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t269 t270))
% 0.42/0.76 (step t272 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 0.42/0.76 (step t273 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t271 t272))
% 0.42/0.76 (step t274 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t273))
% 0.42/0.76 (step t275 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t274))
% 0.42/0.76 (step t276 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t275 a85))
% 0.42/0.76 (step t277 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t268 a7 t238 t276))
% 0.42/0.76 (step t278 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t279)
% 0.42/0.76 (assume t279.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 0.42/0.76 (step t279.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (step t279.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule or :premises (t279.t1))
% 0.42/0.76 (step t279.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t279.t2 t279.a0))
% 0.42/0.76 (step t279 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule subproof :discharge (t279.a0))
% 0.42/0.76 (step t280 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t278 t279))
% 0.42/0.76 (step t281 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule implies_neg2)
% 0.42/0.76 (step t282 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule resolution :premises (t280 t281))
% 0.42/0.76 (step t283 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule contraction :premises (t282))
% 0.42/0.76 (step t284 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule implies :premises (t283))
% 0.42/0.76 (step t285 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t284 a132))
% 0.42/0.76 (step t286 (cl (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule resolution :premises (t252 t212 t266 t277 t285))
% 0.42/0.76 (step t287 (cl (tptp.ssList (tptp.tl tptp.sk2))) :rule resolution :premises (t116 a189 t212 t220 t234 t250 t286))
% 0.42/0.76 (step t288 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule and_neg)
% 0.42/0.76 (step t289 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t290)
% 0.42/0.76 (assume t290.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t290.a1 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t290.a2 (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))
% 0.42/0.76 (assume t290.a3 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t290.a4 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.76 (step t290.t1 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t290.t2)
% 0.42/0.76 (assume t290.t2.a0 (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))
% 0.42/0.76 (assume t290.t2.a1 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t290.t2.a2 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.76 (assume t290.t2.a3 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t290.t2.a4 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (step t290.t2.t1 (cl (= (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) true) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule equiv_simplify)
% 0.42/0.76 (step t290.t2.t2 (cl (not (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) true)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule equiv1 :premises (t290.t2.t1))
% 0.42/0.76 (step t290.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t290.t2.a4))
% 0.42/0.76 (step t290.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t290.t2.t3))
% 0.42/0.76 (step t290.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4)) :rule symm :premises (t290.t2.a3))
% 0.42/0.76 (step t290.t2.t6 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t290.t2.t5))
% 0.42/0.76 (step t290.t2.t7 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t290.t2.t4 t290.t2.t6))
% 0.42/0.76 (step t290.t2.t8 (cl (= (tptp.hd tptp.sk2) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t290.t2.t7))
% 0.42/0.76 (step t290.t2.t9 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t290.t2.a2))
% 0.42/0.76 (step t290.t2.t10 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule symm :premises (t290.t2.a1))
% 0.42/0.76 (step t290.t2.t11 (cl (= (tptp.hd tptp.sk2) tptp.sk5)) :rule trans :premises (t290.t2.t8 t290.t2.t9 t290.t2.t10))
% 0.42/0.76 (step t290.t2.t12 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.76 (step t290.t2.t13 (cl (= (tptp.cons (tptp.hd tptp.sk2) tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule cong :premises (t290.t2.t11 t290.t2.t12))
% 0.42/0.76 (step t290.t2.t14 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t290.t2.t13))
% 0.42/0.76 (step t290.t2.t15 (cl (= (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 0.42/0.76 (step t290.t2.t16 (cl (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv2 :premises (t290.t2.t15))
% 0.42/0.76 (step t290.t2.t17 (cl (= (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) true)) :rule resolution :premises (t290.t2.t16 t290.t2.a0))
% 0.42/0.76 (step t290.t2.t18 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) true)) :rule trans :premises (t290.t2.t14 t290.t2.t17))
% 0.42/0.76 (step t290.t2.t19 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule resolution :premises (t290.t2.t2 t290.t2.t18))
% 0.42/0.76 (step t290.t2 (cl (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule subproof :discharge (t290.t2.a0 t290.t2.a1 t290.t2.a2 t290.t2.a3 t290.t2.a4))
% 0.42/0.76 (step t290.t3 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 0.42/0.76 (step t290.t4 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t290.t5 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.76 (step t290.t6 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t290.t7 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t290.t8 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t290.t2 t290.t3 t290.t4 t290.t5 t290.t6 t290.t7))
% 0.42/0.76 (step t290.t9 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule reordering :premises (t290.t8))
% 0.42/0.76 (step t290.t10 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule contraction :premises (t290.t9))
% 0.42/0.76 (step t290.t11 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule resolution :premises (t290.t1 t290.t10))
% 0.42/0.76 (step t290.t12 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule implies_neg2)
% 0.42/0.76 (step t290.t13 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule resolution :premises (t290.t11 t290.t12))
% 0.42/0.76 (step t290.t14 (cl (=> (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule contraction :premises (t290.t13))
% 0.42/0.76 (step t290.t15 (cl (not (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule implies :premises (t290.t14))
% 0.42/0.76 (step t290.t16 (cl (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.42/0.76 (step t290.t17 (cl (and (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t290.t16 t290.a2 t290.a3 t290.a4 t290.a1 t290.a0))
% 0.42/0.76 (step t290.t18 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule resolution :premises (t290.t15 t290.t17))
% 0.42/0.76 (step t290 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule subproof :discharge (t290.a0 t290.a1 t290.a2 t290.a3 t290.a4))
% 0.42/0.76 (step t291 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t292 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t293 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 0.42/0.76 (step t294 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t295 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.76 (step t296 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule resolution :premises (t290 t291 t292 t293 t294 t295))
% 0.42/0.76 (step t297 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule reordering :premises (t296))
% 0.42/0.76 (step t298 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule contraction :premises (t297))
% 0.42/0.76 (step t299 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule resolution :premises (t289 t298))
% 0.42/0.76 (step t300 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule implies_neg2)
% 0.42/0.76 (step t301 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule resolution :premises (t299 t300))
% 0.42/0.76 (step t302 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule contraction :premises (t301))
% 0.42/0.76 (step t303 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule implies :premises (t302))
% 0.42/0.76 (step t304 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule resolution :premises (t288 t303))
% 0.42/0.76 (step t305 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule reordering :premises (t304))
% 0.42/0.76 (step t306 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule or_pos)
% 0.42/0.76 (step t307 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule reordering :premises (t306))
% 0.42/0.76 (step t308 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t309)
% 0.42/0.76 (assume t309.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 0.42/0.76 (step t309.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 0.42/0.76 (step t309.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t309.t1))
% 0.42/0.76 (step t309.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t309.t2 t309.a0))
% 0.42/0.76 (step t309 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t309.a0))
% 0.42/0.76 (step t310 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t308 t309))
% 0.42/0.76 (step t311 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 0.42/0.76 (step t312 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t310 t311))
% 0.42/0.76 (step t313 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t312))
% 0.42/0.76 (step t314 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule implies :premises (t313))
% 0.42/0.76 (step t315 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule equiv_pos2)
% 0.42/0.76 (anchor :step t316 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.76 (step t316.t1 (cl (= U U)) :rule refl)
% 0.42/0.76 (step t316.t2 (cl (= V V)) :rule refl)
% 0.42/0.76 (step t316.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 0.42/0.76 (step t316.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.76 (step t316.t5 (cl (= (= (tptp.hd (tptp.cons U V)) U) (= U (tptp.hd (tptp.cons U V))))) :rule all_simplify)
% 0.42/0.76 (step t316.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 (t316.t3 t316.t4 t316.t5))
% 0.42/0.76 (step t316 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) :rule bind)
% 0.42/0.76 (step t317 (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 (t315 t316 a96))
% 0.42/0.76 (step t318 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t314 t317))
% 0.42/0.76 (step t319 (cl (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t307 a7 t238 t318))
% 0.42/0.76 (step t320 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule or_pos)
% 0.42/0.76 (step t321 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule reordering :premises (t320))
% 0.42/0.76 (step t322 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule equiv_pos2)
% 0.42/0.76 (step t323 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))) :rule refl)
% 0.42/0.76 (step t324 (cl (= (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)))) :rule refl)
% 0.42/0.76 (step t325 (cl (= (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule refl)
% 0.42/0.76 (step t326 (cl (= (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule refl)
% 0.42/0.76 (step t327 (cl (= (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule all_simplify)
% 0.42/0.76 (step t328 (cl (= (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule cong :premises (t324 t325 t326 t327))
% 0.42/0.76 (step t329 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))))) :rule cong :premises (t323 t328))
% 0.42/0.76 (step t330 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t331)
% 0.42/0.76 (assume t331.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 0.42/0.76 (step t331.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk6) (:= V (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (step t331.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule or :premises (t331.t1))
% 0.42/0.76 (step t331.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t331.t2 t331.a0))
% 0.42/0.76 (step t331 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule subproof :discharge (t331.a0))
% 0.42/0.76 (step t332 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t330 t331))
% 0.42/0.76 (step t333 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule implies_neg2)
% 0.42/0.76 (step t334 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t332 t333))
% 0.42/0.76 (step t335 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))))) :rule contraction :premises (t334))
% 0.42/0.76 (step t336 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule resolution :premises (t322 t329 t335))
% 0.42/0.76 (step t337 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule implies :premises (t336))
% 0.42/0.76 (step t338 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t337 a122))
% 0.42/0.76 (step t339 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t321 t212 t266 t277 t338))
% 0.42/0.76 (step t340 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule resolution :premises (t305 a189 t220 t277 t319 t339))
% 0.42/0.76 (step t341 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule and_neg)
% 0.42/0.76 (step t342 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t343)
% 0.42/0.76 (assume t343.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t343.a1 (= tptp.sk1 tptp.sk3))
% 0.42/0.76 (assume t343.a2 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t343.a3 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t343.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.76 (assume t343.a5 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t343.a6 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t343.a7 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.76 (assume t343.a8 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 0.42/0.76 (step t343.t1 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t343.t2)
% 0.42/0.76 (assume t343.t2.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t343.t2.a1 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t343.t2.a2 (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))
% 0.42/0.76 (assume t343.t2.a3 (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t343.t2.a4 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 0.42/0.76 (assume t343.t2.a5 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.76 (assume t343.t2.a6 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t343.t2.a7 (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t343.t2.a8 (= tptp.sk1 tptp.sk3))
% 0.42/0.76 (step t343.t2.t1 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t343.t2.a8))
% 0.42/0.76 (step t343.t2.t2 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t343.t2.t1))
% 0.42/0.76 (step t343.t2.t3 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3)) :rule symm :premises (t343.t2.a7))
% 0.42/0.76 (step t343.t2.t4 (cl (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t343.t2.t3))
% 0.42/0.76 (step t343.t2.t5 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t343.t2.a4))
% 0.42/0.76 (step t343.t2.t6 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t343.t2.t5))
% 0.42/0.76 (step t343.t2.t7 (cl (= (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.nil)) :rule symm :premises (t343.t2.a3))
% 0.42/0.76 (step t343.t2.t8 (cl (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t343.t2.t7))
% 0.42/0.76 (step t343.t2.t9 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 0.42/0.76 (step t343.t2.t10 (cl (= (tptp.app tptp.nil tptp.sk6) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule cong :premises (t343.t2.t8 t343.t2.t9))
% 0.42/0.76 (step t343.t2.t11 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule symm :premises (t343.t2.a2))
% 0.42/0.76 (step t343.t2.t12 (cl (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule symm :premises (t343.t2.t11))
% 0.42/0.76 (step t343.t2.t13 (cl (= (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule symm :premises (t343.t2.t12))
% 0.42/0.76 (step t343.t2.t14 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4)) :rule symm :premises (t343.t2.a1))
% 0.42/0.76 (step t343.t2.t15 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t343.t2.t14))
% 0.42/0.76 (step t343.t2.t16 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4)) :rule symm :premises (t343.t2.t15))
% 0.42/0.76 (step t343.t2.t17 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t343.t2.a0))
% 0.42/0.76 (step t343.t2.t18 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t343.t2.t17))
% 0.42/0.76 (step t343.t2.t19 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t343.t2.t18))
% 0.42/0.76 (step t343.t2.t20 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk2)) :rule trans :premises (t343.t2.t16 t343.t2.t19))
% 0.42/0.76 (step t343.t2.t21 (cl (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.tl tptp.sk2))) :rule cong :premises (t343.t2.t20))
% 0.42/0.76 (step t343.t2.t22 (cl (= tptp.sk6 (tptp.tl tptp.sk2))) :rule trans :premises (t343.t2.t6 t343.t2.t10 t343.t2.t13 t343.t2.t21))
% 0.42/0.76 (step t343.t2.t23 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule symm :premises (t343.t2.a6))
% 0.42/0.76 (step t343.t2.t24 (cl (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t343.t2.t23))
% 0.42/0.76 (step t343.t2.t25 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t343.t2.a5))
% 0.42/0.76 (step t343.t2.t26 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule symm :premises (t343.t2.t25))
% 0.42/0.76 (step t343.t2.t27 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd tptp.sk2))) :rule cong :premises (t343.t2.t20))
% 0.42/0.76 (step t343.t2.t28 (cl (= tptp.sk5 (tptp.hd tptp.sk2))) :rule trans :premises (t343.t2.t24 t343.t2.t26 t343.t2.t27))
% 0.42/0.76 (step t343.t2.t29 (cl (= tptp.nil tptp.nil)) :rule refl)
% 0.42/0.76 (step t343.t2.t30 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) :rule cong :premises (t343.t2.t28 t343.t2.t29))
% 0.42/0.76 (step t343.t2.t31 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule cong :premises (t343.t2.t22 t343.t2.t30))
% 0.42/0.76 (step t343.t2.t32 (cl (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule trans :premises (t343.t2.t2 t343.t2.t4 t343.t2.t31))
% 0.42/0.76 (step t343.t2 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule subproof :discharge (t343.t2.a0 t343.t2.a1 t343.t2.a2 t343.t2.a3 t343.t2.a4 t343.t2.a5 t343.t2.a6 t343.t2.a7 t343.t2.a8))
% 0.42/0.76 (step t343.t3 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t343.t4 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t343.t5 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t343.t6 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t343.t7 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t343.t8 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.76 (step t343.t9 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t343.t10 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t343.t11 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.76 (step t343.t12 (cl (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t343.t2 t343.t3 t343.t4 t343.t5 t343.t6 t343.t7 t343.t8 t343.t9 t343.t10 t343.t11))
% 0.42/0.76 (step t343.t13 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule reordering :premises (t343.t12))
% 0.42/0.76 (step t343.t14 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule contraction :premises (t343.t13))
% 0.42/0.76 (step t343.t15 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule resolution :premises (t343.t1 t343.t14))
% 0.42/0.76 (step t343.t16 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))))) :rule implies_neg2)
% 0.42/0.76 (step t343.t17 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))))) :rule resolution :premises (t343.t15 t343.t16))
% 0.42/0.76 (step t343.t18 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))))) :rule contraction :premises (t343.t17))
% 0.42/0.76 (step t343.t19 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule implies :premises (t343.t18))
% 0.42/0.76 (step t343.t20 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.42/0.76 (step t343.t21 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t343.t20 t343.a0 t343.a2 t343.a8 t343.a5 t343.a4 t343.a7 t343.a6 t343.a3 t343.a1))
% 0.42/0.76 (step t343.t22 (cl (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule resolution :premises (t343.t19 t343.t21))
% 0.42/0.76 (step t343 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule subproof :discharge (t343.a0 t343.a1 t343.a2 t343.a3 t343.a4 t343.a5 t343.a6 t343.a7 t343.a8))
% 0.42/0.76 (step t344 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t345 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.42/0.76 (step t346 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t347 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t348 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t349 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t350 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t351 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.76 (step t352 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t353 (cl (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))))) :rule resolution :premises (t343 t344 t345 t346 t347 t348 t349 t350 t351 t352))
% 0.42/0.76 (step t354 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule reordering :premises (t353))
% 0.42/0.76 (step t355 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule contraction :premises (t354))
% 0.42/0.76 (step t356 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule resolution :premises (t342 t355))
% 0.42/0.76 (step t357 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (not (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))))) :rule implies_neg2)
% 0.42/0.76 (step t358 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))))) :rule resolution :premises (t356 t357))
% 0.42/0.76 (step t359 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))))) :rule contraction :premises (t358))
% 0.42/0.76 (step t360 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule implies :premises (t359))
% 0.42/0.76 (step t361 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule resolution :premises (t341 t360))
% 0.42/0.76 (step t362 (cl (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil (tptp.tl (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= (tptp.tl (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.tl (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule reordering :premises (t361))
% 0.42/0.76 (step t363 (cl (not (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 0.42/0.76 (step t364 (cl (= (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule all_simplify)
% 0.42/0.76 (step t365 (cl (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t364 t215))
% 0.42/0.76 (step t366 (cl (or (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t363 t365 a195))
% 0.42/0.76 (step t367 (cl (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t366))
% 0.42/0.76 (step t368 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t367))
% 0.42/0.76 (step t369 (cl (= tptp.sk3 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t368 t211))
% 0.42/0.76 (step t370 (cl (= tptp.sk1 (tptp.app (tptp.tl tptp.sk2) (tptp.cons (tptp.hd tptp.sk2) tptp.nil)))) :rule resolution :premises (t362 a189 a190 t220 t369 t234 t250 t319 t339 t286))
% 0.42/0.76 (step t371 (cl (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule and_neg)
% 0.42/0.76 (step t372 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2))) (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t373)
% 0.42/0.76 (assume t373.a0 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (assume t373.a1 (tptp.ssItem tptp.sk5))
% 0.42/0.76 (assume t373.a2 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t373.a3 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t373.a4 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.76 (step t373.t1 (cl (=> (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2))) (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t373.t2)
% 0.42/0.76 (assume t373.t2.a0 (tptp.ssItem tptp.sk5))
% 0.42/0.76 (assume t373.t2.a1 (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))))
% 0.42/0.76 (assume t373.t2.a2 (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))
% 0.42/0.76 (assume t373.t2.a3 (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 0.42/0.76 (assume t373.t2.a4 (= tptp.sk2 tptp.sk4))
% 0.42/0.76 (step t373.t2.t1 (cl (= (= (tptp.ssItem (tptp.hd tptp.sk2)) true) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule equiv_simplify)
% 0.42/0.76 (step t373.t2.t2 (cl (not (= (tptp.ssItem (tptp.hd tptp.sk2)) true)) (tptp.ssItem (tptp.hd tptp.sk2))) :rule equiv1 :premises (t373.t2.t1))
% 0.42/0.76 (step t373.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t373.t2.a4))
% 0.42/0.76 (step t373.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t373.t2.t3))
% 0.42/0.76 (step t373.t2.t5 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk4)) :rule symm :premises (t373.t2.a3))
% 0.42/0.76 (step t373.t2.t6 (cl (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t373.t2.t5))
% 0.42/0.76 (step t373.t2.t7 (cl (= tptp.sk2 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t373.t2.t4 t373.t2.t6))
% 0.42/0.76 (step t373.t2.t8 (cl (= (tptp.hd tptp.sk2) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t373.t2.t7))
% 0.42/0.76 (step t373.t2.t9 (cl (= (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t373.t2.a2))
% 0.42/0.76 (step t373.t2.t10 (cl (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) tptp.sk5)) :rule symm :premises (t373.t2.a1))
% 0.42/0.76 (step t373.t2.t11 (cl (= (tptp.hd tptp.sk2) tptp.sk5)) :rule trans :premises (t373.t2.t8 t373.t2.t9 t373.t2.t10))
% 0.42/0.76 (step t373.t2.t12 (cl (= (tptp.ssItem (tptp.hd tptp.sk2)) (tptp.ssItem tptp.sk5))) :rule cong :premises (t373.t2.t11))
% 0.42/0.76 (step t373.t2.t13 (cl (= (= (tptp.ssItem tptp.sk5) true) (tptp.ssItem tptp.sk5))) :rule equiv_simplify)
% 0.42/0.76 (step t373.t2.t14 (cl (= (tptp.ssItem tptp.sk5) true) (not (tptp.ssItem tptp.sk5))) :rule equiv2 :premises (t373.t2.t13))
% 0.42/0.76 (step t373.t2.t15 (cl (= (tptp.ssItem tptp.sk5) true)) :rule resolution :premises (t373.t2.t14 t373.t2.a0))
% 0.42/0.76 (step t373.t2.t16 (cl (= (tptp.ssItem (tptp.hd tptp.sk2)) true)) :rule trans :premises (t373.t2.t12 t373.t2.t15))
% 0.42/0.76 (step t373.t2.t17 (cl (tptp.ssItem (tptp.hd tptp.sk2))) :rule resolution :premises (t373.t2.t2 t373.t2.t16))
% 0.42/0.76 (step t373.t2 (cl (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2))) :rule subproof :discharge (t373.t2.a0 t373.t2.a1 t373.t2.a2 t373.t2.a3 t373.t2.a4))
% 0.42/0.76 (step t373.t3 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem tptp.sk5)) :rule and_pos)
% 0.42/0.76 (step t373.t4 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t373.t5 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.76 (step t373.t6 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t373.t7 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t373.t8 (cl (tptp.ssItem (tptp.hd tptp.sk2)) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t373.t2 t373.t3 t373.t4 t373.t5 t373.t6 t373.t7))
% 0.42/0.76 (step t373.t9 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule reordering :premises (t373.t8))
% 0.42/0.76 (step t373.t10 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule contraction :premises (t373.t9))
% 0.42/0.76 (step t373.t11 (cl (=> (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule resolution :premises (t373.t1 t373.t10))
% 0.42/0.76 (step t373.t12 (cl (=> (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2))) (not (tptp.ssItem (tptp.hd tptp.sk2)))) :rule implies_neg2)
% 0.42/0.76 (step t373.t13 (cl (=> (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2))) (=> (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule resolution :premises (t373.t11 t373.t12))
% 0.42/0.76 (step t373.t14 (cl (=> (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule contraction :premises (t373.t13))
% 0.42/0.76 (step t373.t15 (cl (not (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule implies :premises (t373.t14))
% 0.42/0.76 (step t373.t16 (cl (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.42/0.76 (step t373.t17 (cl (and (tptp.ssItem tptp.sk5) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t373.t16 t373.a1 t373.a3 t373.a4 t373.a2 t373.a0))
% 0.42/0.76 (step t373.t18 (cl (tptp.ssItem (tptp.hd tptp.sk2))) :rule resolution :premises (t373.t15 t373.t17))
% 0.42/0.76 (step t373 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule subproof :discharge (t373.a0 t373.a1 t373.a2 t373.a3 t373.a4))
% 0.42/0.76 (step t374 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.42/0.76 (step t375 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssItem tptp.sk5)) :rule and_pos)
% 0.42/0.76 (step t376 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 0.42/0.76 (step t377 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 0.42/0.76 (step t378 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_pos)
% 0.42/0.76 (step t379 (cl (tptp.ssItem (tptp.hd tptp.sk2)) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))))) :rule resolution :premises (t373 t374 t375 t376 t377 t378))
% 0.42/0.76 (step t380 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule reordering :premises (t379))
% 0.42/0.76 (step t381 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule contraction :premises (t380))
% 0.42/0.76 (step t382 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule resolution :premises (t372 t381))
% 0.42/0.76 (step t383 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2))) (not (tptp.ssItem (tptp.hd tptp.sk2)))) :rule implies_neg2)
% 0.42/0.76 (step t384 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule resolution :premises (t382 t383))
% 0.42/0.76 (step t385 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule contraction :premises (t384))
% 0.42/0.76 (step t386 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem tptp.sk5) (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule implies :premises (t385))
% 0.42/0.76 (step t387 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule resolution :premises (t371 t386))
% 0.42/0.76 (step t388 (cl (tptp.ssItem (tptp.hd tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.sk4 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk5 (tptp.hd (tptp.cons tptp.sk5 tptp.nil)))) (not (= (tptp.hd (tptp.cons tptp.sk5 tptp.nil)) (tptp.hd (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule reordering :premises (t387))
% 0.42/0.76 (step t389 (cl (tptp.ssItem (tptp.hd tptp.sk2))) :rule resolution :premises (t388 a189 t238 t220 t319 t339))
% 0.42/0.76 (step t390 (cl (not (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)) :rule or_pos)
% 0.42/0.76 (step t391 (cl (= tptp.nil tptp.sk2) (tptp.neq tptp.nil tptp.sk2) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk2)) (not (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)))) :rule reordering :premises (t390))
% 0.42/0.76 (step t392 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))))) (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)))) :rule equiv_pos2)
% 0.42/0.76 (step t393 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule refl)
% 0.42/0.76 (step t394 (cl (= (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule refl)
% 0.42/0.76 (step t395 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 0.42/0.76 (step t396 (cl (= (tptp.neq tptp.nil tptp.sk2) (tptp.neq tptp.nil tptp.sk2))) :rule refl)
% 0.42/0.76 (step t397 (cl (= (= tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2))) :rule all_simplify)
% 0.42/0.76 (step t398 (cl (= (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil)) (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)))) :rule cong :premises (t394 t395 t396 t397))
% 0.42/0.76 (step t399 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))))) :rule cong :premises (t393 t398))
% 0.42/0.76 (step t400 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 0.42/0.76 (anchor :step t401)
% 0.42/0.76 (assume t401.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 0.42/0.76 (step t401.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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk2) (:= V tptp.nil)))
% 0.42/0.76 (step t401.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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil))) :rule or :premises (t401.t1))
% 0.42/0.76 (step t401.t3 (cl (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil))) :rule resolution :premises (t401.t2 t401.a0))
% 0.42/0.76 (step t401 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil))) :rule subproof :discharge (t401.a0))
% 0.42/0.76 (step t402 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil))) (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil))) :rule resolution :premises (t400 t401))
% 0.42/0.76 (step t403 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil))) (not (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil)))) :rule implies_neg2)
% 0.42/0.76 (step t404 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil)))) :rule resolution :premises (t402 t403))
% 0.42/0.76 (step t405 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.sk2 tptp.nil)))) :rule contraction :premises (t404))
% 0.42/0.76 (step t406 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t392 t399 t405))
% 0.42/0.76 (step t407 (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.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule implies :premises (t406))
% 0.42/0.76 (step t408 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 0.42/0.76 (anchor :step t409 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 0.42/0.76 (step t409.t1 (cl (= U U)) :rule refl)
% 0.42/0.76 (step t409.t2 (cl (= V V)) :rule refl)
% 0.42/0.76 (step t409.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 0.42/0.76 (step t409.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.76 (step t409.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 0.42/0.76 (step t409.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 0.42/0.76 (step t409.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 (t409.t3 t409.t4 t409.t5 t409.t6))
% 0.42/0.76 (step t409 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 0.42/0.76 (step t410 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t408 t409 a99))
% 0.42/0.76 (step t411 (cl (or (not (tptp.ssList tptp.sk2)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule resolution :premises (t407 t410))
% 0.42/0.76 (step t412 (cl (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)) :rule resolution :premises (t97 t287 t340 t370 t389 a185 t391 t411 a186 a7))
% 0.42/0.76 (step t413 (cl (= tptp.nil tptp.sk2)) :rule contraction :premises (t412))
% 0.42/0.76 (step t414 (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)
% 0.42/0.76 (step t415 (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 (t414))
% 0.42/0.76 (step t416 (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)
% 0.42/0.76 (anchor :step t417)
% 0.42/0.76 (assume t417.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 0.42/0.76 (step t417.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)))
% 0.42/0.76 (step t417.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 (t417.t1))
% 0.42/0.76 (step t417.t3 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t417.t2 t417.a0))
% 0.42/0.76 (step t417 (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 (t417.a0))
% 0.42/0.76 (step t418 (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 (t416 t417))
% 0.42/0.76 (step t419 (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)
% 0.42/0.76 (step t420 (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 (t418 t419))
% 0.42/0.76 (step t421 (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 (t420))
% 0.42/0.76 (step t422 (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 (t421))
% 0.42/0.76 (step t423 (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)
% 0.42/0.76 (step t424 (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)
% 0.42/0.76 (anchor :step t425 :args ((V $$unsorted) (:= V V)))
% 0.42/0.76 (step t425.t1 (cl (= V V)) :rule refl)
% 0.42/0.76 (step t425.t2 (cl (= (= V V) true)) :rule all_simplify)
% 0.42/0.76 (step t425.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t425.t2))
% 0.42/0.76 (step t425.t4 (cl (= (not (= V V)) false)) :rule trans :premises (t425.t3 t71))
% 0.42/0.76 (step t425.t5 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 0.42/0.76 (step t425.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.42/0.76 (step t425.t7 (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 (t425.t4 t425.t5 t425.t6 t425.t6))
% 0.42/0.76 (step t425.t8 (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)
% 0.42/0.76 (step t425.t9 (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 (t425.t7 t425.t8))
% 0.42/0.76 (step t425 (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)
% 0.42/0.76 (step t426 (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 (t424 t425))
% 0.42/0.76 (step t427 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t423 t426 a114))
% 0.42/0.76 (step t428 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t422 t427))
% 0.42/0.76 (step t429 (cl (not (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t415 a186 t428))
% 0.42/0.76 (step t430 (cl) :rule resolution :premises (t60 t413 t210 t429))
% 0.42/0.76
% 0.42/0.76 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.XoOFnNr2ZJ/cvc5---1.0.5_8747.smt2
% 0.42/0.77 % cvc5---1.0.5 exiting
% 0.42/0.77 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------