TSTP Solution File: SWC229-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC229-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n023.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:04 EDT 2024
% Result : Unsatisfiable 32.21s 32.43s
% Output : Proof 32.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC229-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.15 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 26 15:36:54 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.53/10.71 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.51/15.74 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.53/20.76 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.59/25.79 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.62/30.84 --- Run --trigger-sel=max --full-saturate-quant at 5...
% 32.21/32.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.IoXLMoOJir/cvc5---1.0.5_24684.smt2
% 32.21/32.43 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.IoXLMoOJir/cvc5---1.0.5_24684.smt2
% 32.21/32.45 (assume a0 (tptp.equalelemsP tptp.nil))
% 32.21/32.45 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 32.21/32.45 (assume a2 (tptp.strictorderedP tptp.nil))
% 32.21/32.45 (assume a3 (tptp.totalorderedP tptp.nil))
% 32.21/32.45 (assume a4 (tptp.strictorderP tptp.nil))
% 32.21/32.45 (assume a5 (tptp.totalorderP tptp.nil))
% 32.21/32.45 (assume a6 (tptp.cyclefreeP tptp.nil))
% 32.21/32.45 (assume a7 (tptp.ssList tptp.nil))
% 32.21/32.45 (assume a8 (tptp.ssItem tptp.skac3))
% 32.21/32.45 (assume a9 (tptp.ssItem tptp.skac2))
% 32.21/32.45 (assume a10 (not (tptp.singletonP tptp.nil)))
% 32.21/32.45 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 32.21/32.45 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 32.21/32.45 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 32.21/32.45 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 32.21/32.45 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 32.21/32.45 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 32.21/32.45 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 32.21/32.45 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 32.21/32.45 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 32.21/32.45 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 32.21/32.45 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 32.21/32.45 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 32.21/32.45 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 32.21/32.45 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 32.21/32.45 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 32.21/32.45 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 32.21/32.45 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 32.21/32.45 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 32.21/32.45 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 32.21/32.45 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 32.21/32.45 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 32.21/32.45 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 32.21/32.45 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 32.21/32.45 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 32.21/32.45 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 32.21/32.45 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 32.21/32.45 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 32.21/32.45 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 32.21/32.45 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 32.21/32.45 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 32.21/32.45 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 32.21/32.45 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 32.21/32.45 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 32.21/32.45 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 32.21/32.45 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 32.21/32.45 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 32.21/32.45 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 32.21/32.45 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 32.21/32.45 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 32.21/32.45 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 32.21/32.45 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 32.21/32.45 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 32.21/32.45 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 32.21/32.45 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 32.21/32.45 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 32.21/32.45 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 32.21/32.45 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 32.21/32.45 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 32.21/32.45 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 32.21/32.45 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 32.21/32.45 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 32.21/32.45 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 32.21/32.45 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 32.21/32.45 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 32.21/32.45 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 32.21/32.45 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 32.21/32.45 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 32.21/32.45 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 32.21/32.45 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 32.21/32.45 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 32.21/32.45 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 32.21/32.45 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 32.21/32.45 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 32.21/32.45 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 32.21/32.45 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 32.21/32.45 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 32.21/32.45 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 32.21/32.45 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 32.21/32.45 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 32.21/32.45 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 32.21/32.45 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 32.21/32.45 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 32.21/32.45 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 32.21/32.45 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 32.21/32.45 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 32.21/32.45 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 32.21/32.45 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 32.21/32.45 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 32.21/32.45 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 32.21/32.45 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 32.21/32.45 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 32.21/32.45 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 32.21/32.45 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 32.21/32.45 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 32.21/32.45 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 32.21/32.45 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 32.21/32.45 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 32.21/32.45 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 32.21/32.45 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 32.21/32.45 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 32.21/32.45 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 32.21/32.45 (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))))
% 32.21/32.45 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 32.21/32.45 (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))))
% 32.21/32.45 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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))))
% 32.21/32.45 (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)))))
% 32.21/32.45 (assume a185 (tptp.ssList tptp.sk1))
% 32.21/32.45 (assume a186 (tptp.ssList tptp.sk2))
% 32.21/32.45 (assume a187 (tptp.ssList tptp.sk3))
% 32.21/32.45 (assume a188 (tptp.ssList tptp.sk4))
% 32.21/32.45 (assume a189 (= tptp.sk2 tptp.sk4))
% 32.21/32.45 (assume a190 (= tptp.sk1 tptp.sk3))
% 32.21/32.45 (assume a191 (tptp.segmentP tptp.sk4 tptp.sk3))
% 32.21/32.45 (assume a192 (not (= tptp.nil tptp.sk1)))
% 32.21/32.45 (assume a193 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.ssItem (tptp.sk5 C B A)))))
% 32.21/32.45 (assume a194 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.memberP B (tptp.sk5 C B A)))))
% 32.21/32.45 (assume a195 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.memberP C (tptp.sk5 C B A)))))
% 32.21/32.45 (assume a196 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.leq A (tptp.sk5 C B A)))))
% 32.21/32.45 (assume a197 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (not (tptp.leq (tptp.sk5 C B A) A)))))
% 32.21/32.45 (assume a198 (or (tptp.singletonP tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 32.21/32.45 (step t1 (cl (not (= (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.nil tptp.sk3)))) (not (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3))))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.nil tptp.sk3))) :rule equiv_pos2)
% 32.21/32.45 (step t2 (cl (= (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule refl)
% 32.21/32.45 (step t3 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 32.21/32.45 (step t4 (cl (= (= (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3)) true) (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 32.21/32.45 (step t5 (cl (not (= (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3)) true)) (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3))) :rule equiv1 :premises (t4))
% 32.21/32.45 (step t6 (cl (= (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3)) (= (tptp.segmentP tptp.nil tptp.sk3) (not (not (tptp.segmentP tptp.nil tptp.sk3)))))) :rule all_simplify)
% 32.21/32.45 (step t7 (cl (= (tptp.segmentP tptp.nil tptp.sk3) (tptp.segmentP tptp.nil tptp.sk3))) :rule refl)
% 32.21/32.45 (step t8 (cl (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3))) :rule all_simplify)
% 32.21/32.45 (step t9 (cl (= (= (tptp.segmentP tptp.nil tptp.sk3) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (= (tptp.segmentP tptp.nil tptp.sk3) (tptp.segmentP tptp.nil tptp.sk3)))) :rule cong :premises (t7 t8))
% 32.21/32.45 (step t10 (cl (= (= (tptp.segmentP tptp.nil tptp.sk3) (tptp.segmentP tptp.nil tptp.sk3)) true)) :rule all_simplify)
% 32.21/32.45 (step t11 (cl (= (= (tptp.segmentP tptp.nil tptp.sk3) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) true)) :rule trans :premises (t9 t10))
% 32.21/32.45 (step t12 (cl (= (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3)) true)) :rule trans :premises (t6 t11))
% 32.21/32.45 (step t13 (cl (= (not (not (tptp.segmentP tptp.nil tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk3))) :rule resolution :premises (t5 t12))
% 32.21/32.45 (step t14 (cl (= (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.nil tptp.sk3)))) :rule cong :premises (t2 t3 t13))
% 32.21/32.45 (step t15 (cl (not (= (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))))) (not (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))))) :rule equiv_pos2)
% 32.21/32.45 (step t16 (cl (= (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))))) :rule refl)
% 32.21/32.45 (step t17 (cl (= (= (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))))) :rule equiv_simplify)
% 32.21/32.45 (step t18 (cl (= (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) (not (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))))) :rule equiv2 :premises (t17))
% 32.21/32.45 (step t19 (cl (not (not (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule not_not)
% 32.21/32.45 (step t20 (cl (= (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t18 t19))
% 32.21/32.45 (step t21 (cl (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t22)
% 32.21/32.45 (assume t22.a0 (not (tptp.segmentP tptp.nil tptp.sk3)))
% 32.21/32.45 (assume t22.a1 (= tptp.nil tptp.sk4))
% 32.21/32.45 (assume t22.a2 (tptp.segmentP tptp.sk4 tptp.sk3))
% 32.21/32.45 (step t22.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 32.21/32.45 (step t22.t2 (cl (= (= true false) false)) :rule all_simplify)
% 32.21/32.45 (step t22.t3 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) true) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv_simplify)
% 32.21/32.45 (step t22.t4 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) true) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv2 :premises (t22.t3))
% 32.21/32.45 (step t22.t5 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) :rule resolution :premises (t22.t4 t22.a2))
% 32.21/32.45 (step t22.t6 (cl (= true (tptp.segmentP tptp.sk4 tptp.sk3))) :rule symm :premises (t22.t5))
% 32.21/32.45 (step t22.t7 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t22.a1))
% 32.21/32.45 (step t22.t8 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 32.21/32.45 (step t22.t9 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.nil tptp.sk3))) :rule cong :premises (t22.t7 t22.t8))
% 32.21/32.45 (step t22.t10 (cl (= (= (tptp.segmentP tptp.nil tptp.sk3) false) (not (tptp.segmentP tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 32.21/32.45 (step t22.t11 (cl (= (tptp.segmentP tptp.nil tptp.sk3) false) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) :rule equiv2 :premises (t22.t10))
% 32.21/32.45 (step t22.t12 (cl (not (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (tptp.segmentP tptp.nil tptp.sk3)) :rule not_not)
% 32.21/32.45 (step t22.t13 (cl (= (tptp.segmentP tptp.nil tptp.sk3) false) (tptp.segmentP tptp.nil tptp.sk3)) :rule resolution :premises (t22.t11 t22.t12))
% 32.21/32.45 (step t22.t14 (cl (= (tptp.segmentP tptp.nil tptp.sk3) false)) :rule resolution :premises (t22.t13 t22.a0))
% 32.21/32.45 (step t22.t15 (cl (= true false)) :rule trans :premises (t22.t6 t22.t9 t22.t14))
% 32.21/32.45 (step t22.t16 (cl false) :rule resolution :premises (t22.t1 t22.t2 t22.t15))
% 32.21/32.45 (step t22 (cl (not (not (tptp.segmentP tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) false) :rule subproof :discharge (t22.a0 t22.a1 t22.a2))
% 32.21/32.45 (step t23 (cl (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP tptp.nil tptp.sk3))) :rule and_pos)
% 32.21/32.45 (step t24 (cl (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 32.21/32.45 (step t25 (cl (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule and_pos)
% 32.21/32.45 (step t26 (cl false (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule resolution :premises (t22 t23 t24 t25))
% 32.21/32.45 (step t27 (cl (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) false) :rule reordering :premises (t26))
% 32.21/32.45 (step t28 (cl (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) false) :rule contraction :premises (t27))
% 32.21/32.45 (step t29 (cl (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) false) :rule resolution :premises (t21 t28))
% 32.21/32.45 (step t30 (cl (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) (not false)) :rule implies_neg2)
% 32.21/32.45 (step t31 (cl (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false)) :rule resolution :premises (t29 t30))
% 32.21/32.45 (step t32 (cl (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false)) :rule contraction :premises (t31))
% 32.21/32.45 (step t33 (cl (= (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))))) :rule implies_simplify)
% 32.21/32.45 (step t34 (cl (not (=> (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false)) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv1 :premises (t33))
% 32.21/32.45 (step t35 (cl (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule resolution :premises (t32 t34))
% 32.21/32.45 (step t36 (cl (= (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) false)) :rule resolution :premises (t20 t35))
% 32.21/32.45 (step t37 (cl (= (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) false))) :rule cong :premises (t16 t36))
% 32.21/32.45 (step t38 (cl (= (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) false) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))))) :rule all_simplify)
% 32.21/32.45 (step t39 (cl (= (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))))) :rule trans :premises (t37 t38))
% 32.21/32.45 (step t40 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t41)
% 32.21/32.45 (assume t41.a0 (tptp.segmentP tptp.sk4 tptp.sk3))
% 32.21/32.45 (assume t41.a1 (= tptp.nil tptp.sk4))
% 32.21/32.45 (assume t41.a2 (not (tptp.segmentP tptp.nil tptp.sk3)))
% 32.21/32.45 (step t41.t1 (cl (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (not (tptp.segmentP tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule and_neg)
% 32.21/32.45 (step t41.t2 (cl (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t41.t1 t41.a2 t41.a1 t41.a0))
% 32.21/32.45 (step t41 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule subproof :discharge (t41.a0 t41.a1 t41.a2))
% 32.21/32.45 (step t42 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule and_pos)
% 32.21/32.45 (step t43 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 32.21/32.45 (step t44 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (tptp.segmentP tptp.nil tptp.sk3))) :rule and_pos)
% 32.21/32.45 (step t45 (cl (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))))) :rule resolution :premises (t41 t42 t43 t44))
% 32.21/32.45 (step t46 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule reordering :premises (t45))
% 32.21/32.45 (step t47 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3)))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule contraction :premises (t46))
% 32.21/32.45 (step t48 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t40 t47))
% 32.21/32.45 (step t49 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule implies_neg2)
% 32.21/32.45 (step t50 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule resolution :premises (t48 t49))
% 32.21/32.45 (step t51 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))) (and (not (tptp.segmentP tptp.nil tptp.sk3)) (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule contraction :premises (t50))
% 32.21/32.45 (step t52 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.nil tptp.sk4) (not (tptp.segmentP tptp.nil tptp.sk3))))) :rule resolution :premises (t15 t39 t51))
% 32.21/32.45 (step t53 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) :rule not_and :premises (t52))
% 32.21/32.45 (step t54 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule or_neg)
% 32.21/32.45 (step t55 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 32.21/32.45 (step t56 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (not (not (not (tptp.segmentP tptp.nil tptp.sk3))))) :rule or_neg)
% 32.21/32.45 (step t57 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3))))) :rule resolution :premises (t53 t54 t55 t56))
% 32.21/32.45 (step t58 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP tptp.nil tptp.sk3))))) :rule contraction :premises (t57))
% 32.21/32.45 (step t59 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.nil tptp.sk3))) :rule resolution :premises (t1 t14 t58))
% 32.21/32.45 (step t60 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.nil tptp.sk4)) (tptp.segmentP tptp.nil tptp.sk3)) :rule or :premises (t59))
% 32.21/32.45 (step t61 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)) :rule or_pos)
% 32.21/32.45 (step t62 (cl (tptp.neq tptp.sk4 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (= tptp.nil tptp.sk4) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t61))
% 32.21/32.45 (step t63 (cl (tptp.singletonP tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a198))
% 32.21/32.45 (step t64 (cl (not (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule or_pos)
% 32.21/32.45 (step t65 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.singletonP tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (not (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule reordering :premises (t64))
% 32.21/32.45 (step t66 (cl (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) :rule and_neg)
% 32.21/32.45 (step t67 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t68)
% 32.21/32.45 (assume t68.a0 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 32.21/32.45 (assume t68.a1 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 32.21/32.45 (assume t68.a2 (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))
% 32.21/32.45 (assume t68.a3 (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))
% 32.21/32.45 (step t68.t1 (cl (=> (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t68.t2)
% 32.21/32.45 (assume t68.t2.a0 (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))
% 32.21/32.45 (assume t68.t2.a1 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 32.21/32.45 (assume t68.t2.a2 (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))
% 32.21/32.45 (assume t68.t2.a3 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 32.21/32.45 (step t68.t2.t1 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t68.t2.a3))
% 32.21/32.45 (step t68.t2.t2 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule symm :premises (t68.t2.t1))
% 32.21/32.45 (step t68.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 32.21/32.45 (step t68.t2.t4 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)) tptp.nil))) :rule cong :premises (t68.t2.a2 t68.t2.t3))
% 32.21/32.45 (step t68.t2.t5 (cl (= (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)) tptp.sk3)) :rule symm :premises (t68.t2.a2))
% 32.21/32.45 (step t68.t2.t6 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t68.t2.a1))
% 32.21/32.45 (step t68.t2.t7 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t68.t2.t6))
% 32.21/32.45 (step t68.t2.t8 (cl (= (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil) tptp.sk3)) :rule symm :premises (t68.t2.a0))
% 32.21/32.45 (step t68.t2.t9 (cl (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule symm :premises (t68.t2.t8))
% 32.21/32.45 (step t68.t2.t10 (cl (= (tptp.app tptp.nil tptp.sk3) (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule cong :premises (t68.t2.t3 t68.t2.t9))
% 32.21/32.45 (step t68.t2.t11 (cl (= tptp.sk3 (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule trans :premises (t68.t2.t7 t68.t2.t10))
% 32.21/32.45 (step t68.t2.t12 (cl (= (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)) (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule trans :premises (t68.t2.t5 t68.t2.t11))
% 32.21/32.45 (step t68.t2.t13 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)) tptp.nil) (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule cong :premises (t68.t2.t12 t68.t2.t3))
% 32.21/32.45 (step t68.t2.t14 (cl (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule trans :premises (t68.t2.t2 t68.t2.t4 t68.t2.t13))
% 32.21/32.45 (step t68.t2 (cl (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule subproof :discharge (t68.t2.a0 t68.t2.a1 t68.t2.a2 t68.t2.a3))
% 32.21/32.45 (step t68.t3 (cl (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule and_pos)
% 32.21/32.45 (step t68.t4 (cl (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 32.21/32.45 (step t68.t5 (cl (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) :rule and_pos)
% 32.21/32.45 (step t68.t6 (cl (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 32.21/32.45 (step t68.t7 (cl (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)) (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule resolution :premises (t68.t2 t68.t3 t68.t4 t68.t5 t68.t6))
% 32.21/32.45 (step t68.t8 (cl (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule reordering :premises (t68.t7))
% 32.21/32.45 (step t68.t9 (cl (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule contraction :premises (t68.t8))
% 32.21/32.45 (step t68.t10 (cl (=> (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule resolution :premises (t68.t1 t68.t9))
% 32.21/32.45 (step t68.t11 (cl (=> (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule implies_neg2)
% 32.21/32.45 (step t68.t12 (cl (=> (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (=> (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule resolution :premises (t68.t10 t68.t11))
% 32.21/32.45 (step t68.t13 (cl (=> (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule contraction :premises (t68.t12))
% 32.21/32.45 (step t68.t14 (cl (not (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule implies :premises (t68.t13))
% 32.21/32.45 (step t68.t15 (cl (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule and_neg)
% 32.21/32.45 (step t68.t16 (cl (and (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t68.t15 t68.a2 t68.a1 t68.a3 t68.a0))
% 32.21/32.45 (step t68.t17 (cl (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule resolution :premises (t68.t14 t68.t16))
% 32.21/32.45 (step t68 (cl (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule subproof :discharge (t68.a0 t68.a1 t68.a2 t68.a3))
% 32.21/32.45 (step t69 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 32.21/32.45 (step t70 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 32.21/32.45 (step t71 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) :rule and_pos)
% 32.21/32.45 (step t72 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) :rule and_pos)
% 32.21/32.45 (step t73 (cl (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))))) :rule resolution :premises (t68 t69 t70 t71 t72))
% 32.21/32.45 (step t74 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule reordering :premises (t73))
% 32.21/32.45 (step t75 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule contraction :premises (t74))
% 32.21/32.45 (step t76 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule resolution :premises (t67 t75))
% 32.21/32.45 (step t77 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule implies_neg2)
% 32.21/32.45 (step t78 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule resolution :premises (t76 t77))
% 32.21/32.45 (step t79 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule contraction :premises (t78))
% 32.21/32.45 (step t80 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule implies :premises (t79))
% 32.21/32.45 (step t81 (cl (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) :rule resolution :premises (t66 t80))
% 32.21/32.45 (step t82 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule or_pos)
% 32.21/32.45 (step t83 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule reordering :premises (t82))
% 32.21/32.45 (step t84 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t85)
% 32.21/32.45 (assume t85.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 32.21/32.45 (step t85.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 32.21/32.45 (step t85.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule or :premises (t85.t1))
% 32.21/32.45 (step t85.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t85.t2 t85.a0))
% 32.21/32.45 (step t85 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule subproof :discharge (t85.a0))
% 32.21/32.45 (step t86 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t84 t85))
% 32.21/32.45 (step t87 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule implies_neg2)
% 32.21/32.45 (step t88 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule resolution :premises (t86 t87))
% 32.21/32.45 (step t89 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule contraction :premises (t88))
% 32.21/32.45 (step t90 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule implies :premises (t89))
% 32.21/32.45 (step t91 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule equiv_pos2)
% 32.21/32.45 (anchor :step t92 :args ((U $$unsorted) (:= U U)))
% 32.21/32.45 (step t92.t1 (cl (= U U)) :rule refl)
% 32.21/32.45 (step t92.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 32.21/32.45 (step t92.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 32.21/32.45 (step t92.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule cong :premises (t92.t2 t92.t3))
% 32.21/32.45 (step t92 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) :rule bind)
% 32.21/32.45 (step t93 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t91 t92 a72))
% 32.21/32.45 (step t94 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t90 t93))
% 32.21/32.45 (step t95 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule resolution :premises (t83 a187 t94))
% 32.21/32.45 (step t96 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule or_pos)
% 32.21/32.45 (step t97 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule reordering :premises (t96))
% 32.21/32.45 (step t98 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t99)
% 32.21/32.45 (assume t99.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 32.21/32.45 (step t99.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 32.21/32.45 (step t99.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule or :premises (t99.t1))
% 32.21/32.45 (step t99.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t99.t2 t99.a0))
% 32.21/32.45 (step t99 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule subproof :discharge (t99.a0))
% 32.21/32.45 (step t100 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t98 t99))
% 32.21/32.45 (step t101 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule implies_neg2)
% 32.21/32.45 (step t102 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t100 t101))
% 32.21/32.45 (step t103 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule contraction :premises (t102))
% 32.21/32.45 (step t104 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies :premises (t103))
% 32.21/32.45 (step t105 (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)
% 32.21/32.45 (anchor :step t106 :args ((U $$unsorted) (:= U U)))
% 32.21/32.45 (step t106.t1 (cl (= U U)) :rule refl)
% 32.21/32.45 (step t106.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 32.21/32.45 (step t106.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 32.21/32.45 (step t106.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 (t106.t2 t106.t3))
% 32.21/32.45 (step t106 (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)
% 32.21/32.45 (step t107 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t105 t106 a73))
% 32.21/32.45 (step t108 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t104 t107))
% 32.21/32.45 (step t109 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule resolution :premises (t97 a187 t108))
% 32.21/32.45 (step t110 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3)) :rule or_pos)
% 32.21/32.45 (step t111 (cl (= tptp.nil tptp.sk3) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t110))
% 32.21/32.45 (step t112 (cl (not (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk3)))) (not (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk3))) :rule equiv_pos2)
% 32.21/32.45 (step t113 (cl (= tptp.nil tptp.nil)) :rule refl)
% 32.21/32.45 (step t114 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 32.21/32.45 (step t115 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t114 a190 a189))
% 32.21/32.45 (step t116 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t115))
% 32.21/32.45 (step t117 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t113 t116))
% 32.21/32.45 (step t118 (cl (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk3)))) :rule cong :premises (t117))
% 32.21/32.45 (step t119 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t112 t118 a192))
% 32.21/32.45 (step t120 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t121)
% 32.21/32.45 (assume t121.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))
% 32.21/32.45 (step t121.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 32.21/32.45 (step t121.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) :rule or :premises (t121.t1))
% 32.21/32.45 (step t121.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t121.t2 t121.a0))
% 32.21/32.45 (step t121 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t121.a0))
% 32.21/32.45 (step t122 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t120 t121))
% 32.21/32.45 (step t123 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 32.21/32.45 (step t124 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t122 t123))
% 32.21/32.45 (step t125 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t124))
% 32.21/32.45 (step t126 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) :rule implies :premises (t125))
% 32.21/32.45 (step t127 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule equiv_pos2)
% 32.21/32.45 (anchor :step t128 :args ((U $$unsorted) (:= U U)))
% 32.21/32.45 (step t128.t1 (cl (= U U)) :rule refl)
% 32.21/32.45 (step t128.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 32.21/32.45 (step t128.t3 (cl (= (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))))) :rule all_simplify)
% 32.21/32.45 (step t128.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 32.21/32.45 (step t128.t5 (cl (= (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule cong :premises (t128.t2 t128.t3 t128.t4))
% 32.21/32.45 (step t128 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) :rule bind)
% 32.21/32.45 (step t129 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule resolution :premises (t127 t128 a108))
% 32.21/32.45 (step t130 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t126 t129))
% 32.21/32.45 (step t131 (cl (= tptp.sk3 (tptp.cons (tptp.skaf83 tptp.sk3) (tptp.skaf82 tptp.sk3)))) :rule resolution :premises (t111 t119 a187 t130))
% 32.21/32.45 (step t132 (cl (not (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule or_pos)
% 32.21/32.45 (step t133 (cl (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))))) :rule reordering :premises (t132))
% 32.21/32.45 (step t134 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t135)
% 32.21/32.45 (assume t135.a0 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 32.21/32.45 (step t135.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))))) :rule forall_inst :args ((:= U (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))
% 32.21/32.45 (step t135.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule or :premises (t135.t1))
% 32.21/32.45 (step t135.t3 (cl (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule resolution :premises (t135.t2 t135.a0))
% 32.21/32.45 (step t135 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule subproof :discharge (t135.a0))
% 32.21/32.45 (step t136 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule resolution :premises (t134 t135))
% 32.21/32.45 (step t137 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) (not (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))))) :rule implies_neg2)
% 32.21/32.45 (step t138 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))))) :rule resolution :premises (t136 t137))
% 32.21/32.45 (step t139 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))))) :rule contraction :premises (t138))
% 32.21/32.45 (step t140 (cl (not (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U))))) (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule implies :premises (t139))
% 32.21/32.45 (step t141 (cl (or (not (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) (not (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule resolution :premises (t140 a70))
% 32.21/32.45 (step t142 (cl (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) :rule or_pos)
% 32.21/32.45 (step t143 (cl (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) :rule contraction :premises (t142))
% 32.21/32.45 (step t144 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))) (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule reordering :premises (t143))
% 32.21/32.45 (step t145 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t146)
% 32.21/32.45 (assume t146.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))))
% 32.21/32.45 (step t146.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule forall_inst :args ((:= A (tptp.skaf44 tptp.sk3)) (:= B tptp.nil) (:= C tptp.nil)))
% 32.21/32.45 (step t146.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule or :premises (t146.t1))
% 32.21/32.45 (step t146.t3 (cl (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule resolution :premises (t146.t2 t146.a0))
% 32.21/32.45 (step t146 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule subproof :discharge (t146.a0))
% 32.21/32.45 (step t147 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule resolution :premises (t145 t146))
% 32.21/32.45 (step t148 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule implies_neg2)
% 32.21/32.45 (step t149 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule resolution :premises (t147 t148))
% 32.21/32.45 (step t150 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule contraction :premises (t149))
% 32.21/32.45 (step t151 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule implies :premises (t150))
% 32.21/32.45 (step t152 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.memberP B (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.memberP B (tptp.sk5 C B A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) :rule equiv_pos2)
% 32.21/32.45 (anchor :step t153 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 32.21/32.45 (step t153.t1 (cl (= A A)) :rule refl)
% 32.21/32.45 (step t153.t2 (cl (= B B)) :rule refl)
% 32.21/32.45 (step t153.t3 (cl (= C C)) :rule refl)
% 32.21/32.45 (step t153.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 32.21/32.45 (step t153.t5 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 32.21/32.45 (step t153.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 32.21/32.45 (step t153.t7 (cl (= (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C)))) :rule all_simplify)
% 32.21/32.45 (step t153.t8 (cl (= (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))))) :rule cong :premises (t153.t7))
% 32.21/32.45 (step t153.t9 (cl (= (tptp.memberP B (tptp.sk5 C B A)) (tptp.memberP B (tptp.sk5 C B A)))) :rule refl)
% 32.21/32.45 (step t153.t10 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.memberP B (tptp.sk5 C B A))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) :rule cong :premises (t153.t4 t153.t5 t153.t6 t153.t8 t153.t9))
% 32.21/32.45 (step t153 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.memberP B (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))))) :rule bind)
% 32.21/32.45 (anchor :step t154 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 32.21/32.45 (step t154.t1 (cl (= A A)) :rule refl)
% 32.21/32.45 (step t154.t2 (cl (= B B)) :rule refl)
% 32.21/32.45 (step t154.t3 (cl (= C C)) :rule refl)
% 32.21/32.45 (step t154.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 32.21/32.45 (step t154.t5 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 32.21/32.45 (step t154.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 32.21/32.45 (step t154.t7 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t115))
% 32.21/32.45 (step t154.t8 (cl (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) :rule refl)
% 32.21/32.45 (step t154.t9 (cl (= (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C)) (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C)))) :rule cong :premises (t154.t7 t154.t8))
% 32.21/32.45 (step t154.t10 (cl (= (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))))) :rule cong :premises (t154.t9))
% 32.21/32.45 (step t154.t11 (cl (= (tptp.memberP B (tptp.sk5 C B A)) (tptp.memberP B (tptp.sk5 C B A)))) :rule refl)
% 32.21/32.45 (step t154.t12 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) :rule cong :premises (t154.t4 t154.t5 t154.t6 t154.t10 t154.t11))
% 32.21/32.45 (step t154 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))))) :rule bind)
% 32.21/32.45 (step t155 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.memberP B (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A)))))) :rule trans :premises (t153 t154))
% 32.21/32.45 (step t156 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.memberP B (tptp.sk5 C B A))))) :rule resolution :premises (t152 t155 a194))
% 32.21/32.45 (step t157 (cl (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.memberP tptp.nil (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule resolution :premises (t151 t156))
% 32.21/32.45 (step t158 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t159)
% 32.21/32.45 (assume t159.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 32.21/32.45 (step t159.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 32.21/32.45 (step t159.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule or :premises (t159.t1))
% 32.21/32.45 (step t159.t3 (cl (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule resolution :premises (t159.t2 t159.a0))
% 32.21/32.45 (step t159 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule subproof :discharge (t159.a0))
% 32.21/32.45 (step t160 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule resolution :premises (t158 t159))
% 32.21/32.45 (step t161 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule implies_neg2)
% 32.21/32.45 (step t162 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule resolution :premises (t160 t161))
% 32.21/32.45 (step t163 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))) (tptp.ssItem (tptp.skaf44 tptp.sk3)))) :rule contraction :premises (t162))
% 32.21/32.45 (step t164 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U)))) (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule implies :premises (t163))
% 32.21/32.45 (step t165 (cl (tptp.ssItem (tptp.skaf44 tptp.sk3))) :rule resolution :premises (t164 a46))
% 32.21/32.45 (step t166 (cl (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) :rule or_pos)
% 32.21/32.45 (step t167 (cl (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))) :rule contraction :premises (t166))
% 32.21/32.45 (step t168 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))) (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule reordering :premises (t167))
% 32.21/32.45 (step t169 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t170)
% 32.21/32.45 (assume t170.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))))
% 32.21/32.45 (step t170.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule forall_inst :args ((:= A (tptp.skaf44 tptp.sk3)) (:= B tptp.nil) (:= C tptp.nil)))
% 32.21/32.45 (step t170.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule or :premises (t170.t1))
% 32.21/32.45 (step t170.t3 (cl (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule resolution :premises (t170.t2 t170.a0))
% 32.21/32.45 (step t170 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule subproof :discharge (t170.a0))
% 32.21/32.45 (step t171 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule resolution :premises (t169 t170))
% 32.21/32.45 (step t172 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (not (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule implies_neg2)
% 32.21/32.45 (step t173 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule resolution :premises (t171 t172))
% 32.21/32.45 (step t174 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3)))))) :rule contraction :premises (t173))
% 32.21/32.45 (step t175 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule implies :premises (t174))
% 32.21/32.45 (step t176 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.ssItem (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.ssItem (tptp.sk5 C B A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) :rule equiv_pos2)
% 32.21/32.45 (anchor :step t177 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 32.21/32.45 (step t177.t1 (cl (= A A)) :rule refl)
% 32.21/32.45 (step t177.t2 (cl (= B B)) :rule refl)
% 32.21/32.45 (step t177.t3 (cl (= C C)) :rule refl)
% 32.21/32.45 (step t177.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 32.21/32.45 (step t177.t5 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 32.21/32.45 (step t177.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 32.21/32.45 (step t177.t7 (cl (= (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1) (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C)))) :rule all_simplify)
% 32.21/32.45 (step t177.t8 (cl (= (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))))) :rule cong :premises (t177.t7))
% 32.21/32.45 (step t177.t9 (cl (= (tptp.ssItem (tptp.sk5 C B A)) (tptp.ssItem (tptp.sk5 C B A)))) :rule refl)
% 32.21/32.45 (step t177.t10 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.ssItem (tptp.sk5 C B A))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) :rule cong :premises (t177.t4 t177.t5 t177.t6 t177.t8 t177.t9))
% 32.21/32.45 (step t177 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.ssItem (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))))) :rule bind)
% 32.21/32.45 (anchor :step t178 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 32.21/32.45 (step t178.t1 (cl (= A A)) :rule refl)
% 32.21/32.45 (step t178.t2 (cl (= B B)) :rule refl)
% 32.21/32.45 (step t178.t3 (cl (= C C)) :rule refl)
% 32.21/32.45 (step t178.t4 (cl (= (not (tptp.ssItem A)) (not (tptp.ssItem A)))) :rule refl)
% 32.21/32.45 (step t178.t5 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 32.21/32.45 (step t178.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 32.21/32.45 (step t178.t7 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t115))
% 32.21/32.45 (step t178.t8 (cl (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) :rule refl)
% 32.21/32.45 (step t178.t9 (cl (= (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C)) (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C)))) :rule cong :premises (t178.t7 t178.t8))
% 32.21/32.45 (step t178.t10 (cl (= (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))))) :rule cong :premises (t178.t9))
% 32.21/32.45 (step t178.t11 (cl (= (tptp.ssItem (tptp.sk5 C B A)) (tptp.ssItem (tptp.sk5 C B A)))) :rule refl)
% 32.21/32.45 (step t178.t12 (cl (= (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) :rule cong :premises (t178.t4 t178.t5 t178.t6 t178.t10 t178.t11))
% 32.21/32.45 (step t178 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk1 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))))) :rule bind)
% 32.21/32.45 (step t179 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C) tptp.sk1)) (tptp.ssItem (tptp.sk5 C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A)))))) :rule trans :premises (t177 t178))
% 32.21/32.45 (step t180 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk3 (tptp.app (tptp.app B (tptp.cons A tptp.nil)) C))) (tptp.ssItem (tptp.sk5 C B A))))) :rule resolution :premises (t176 t179 a193))
% 32.21/32.45 (step t181 (cl (or (not (tptp.ssItem (tptp.skaf44 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (tptp.ssItem (tptp.sk5 tptp.nil tptp.nil (tptp.skaf44 tptp.sk3))))) :rule resolution :premises (t175 t180))
% 32.21/32.45 (step t182 (cl (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule resolution :premises (t133 t141 t144 t157 t165 a7 t168 t181 t165 a7))
% 32.21/32.45 (step t183 (cl (not (= tptp.sk3 (tptp.app (tptp.app tptp.nil (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)) tptp.nil)))) :rule contraction :premises (t182))
% 32.21/32.45 (step t184 (cl (not (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t81 t95 t109 t131 t183))
% 32.21/32.45 (step t185 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t186)
% 32.21/32.45 (assume t186.a0 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))))
% 32.21/32.45 (step t186.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 32.21/32.45 (step t186.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule or :premises (t186.t1))
% 32.21/32.45 (step t186.t3 (cl (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t186.t2 t186.a0))
% 32.21/32.45 (step t186 (cl (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule subproof :discharge (t186.a0))
% 32.21/32.45 (step t187 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t185 t186))
% 32.21/32.45 (step t188 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (not (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 32.21/32.45 (step t189 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule resolution :premises (t187 t188))
% 32.21/32.45 (step t190 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil))))) :rule contraction :premises (t189))
% 32.21/32.45 (step t191 (cl (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule implies :premises (t190))
% 32.21/32.45 (step t192 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule equiv_pos2)
% 32.21/32.45 (anchor :step t193 :args ((U $$unsorted) (:= U U)))
% 32.21/32.45 (step t193.t1 (cl (= U U)) :rule refl)
% 32.21/32.45 (step t193.t2 (cl (= (not (tptp.singletonP U)) (not (tptp.singletonP U)))) :rule refl)
% 32.21/32.45 (step t193.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 32.21/32.45 (step t193.t4 (cl (= (= (tptp.cons (tptp.skaf44 U) tptp.nil) U) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))) :rule all_simplify)
% 32.21/32.45 (step t193.t5 (cl (= (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule cong :premises (t193.t2 t193.t3 t193.t4))
% 32.21/32.45 (step t193 (cl (= (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil)))))) :rule bind)
% 32.21/32.45 (step t194 (cl (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf44 U) tptp.nil))))) :rule resolution :premises (t192 t193 a100))
% 32.21/32.45 (step t195 (cl (or (not (tptp.singletonP tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.skaf44 tptp.sk3) tptp.nil)))) :rule resolution :premises (t191 t194))
% 32.21/32.45 (step t196 (cl (not (tptp.singletonP tptp.sk3))) :rule resolution :premises (t65 a187 t184 t195))
% 32.21/32.45 (step t197 (cl (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t63 t196))
% 32.21/32.45 (step t198 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t199)
% 32.21/32.45 (assume t199.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 32.21/32.45 (step t199.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk4)))
% 32.21/32.45 (step t199.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule or :premises (t199.t1))
% 32.21/32.45 (step t199.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t199.t2 t199.a0))
% 32.21/32.45 (step t199 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule subproof :discharge (t199.a0))
% 32.21/32.45 (step t200 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t198 t199))
% 32.21/32.45 (step t201 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 32.21/32.45 (step t202 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t200 t201))
% 32.21/32.45 (step t203 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule contraction :premises (t202))
% 32.21/32.45 (step t204 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule implies :premises (t203))
% 32.21/32.45 (step t205 (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)
% 32.21/32.45 (anchor :step t206 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 32.21/32.45 (step t206.t1 (cl (= U U)) :rule refl)
% 32.21/32.45 (step t206.t2 (cl (= V V)) :rule refl)
% 32.21/32.45 (step t206.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 32.21/32.45 (step t206.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 32.21/32.45 (step t206.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 32.21/32.45 (step t206.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 32.21/32.45 (step t206.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 (t206.t3 t206.t4 t206.t5 t206.t6))
% 32.21/32.45 (step t206 (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)
% 32.21/32.45 (step t207 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t205 t206 a99))
% 32.21/32.45 (step t208 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule resolution :premises (t204 t207))
% 32.21/32.45 (step t209 (cl (= tptp.nil tptp.sk4)) :rule resolution :premises (t62 t197 a7 a188 t208))
% 32.21/32.45 (step t210 (cl (not (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)) :rule or_pos)
% 32.21/32.45 (step t211 (cl (= tptp.nil tptp.sk3) (not (tptp.ssList tptp.sk3)) (not (tptp.segmentP tptp.nil tptp.sk3)) (not (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t210))
% 32.21/32.45 (step t212 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 32.21/32.45 (anchor :step t213)
% 32.21/32.45 (assume t213.a0 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 32.21/32.45 (step t213.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 32.21/32.45 (step t213.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule or :premises (t213.t1))
% 32.21/32.45 (step t213.t3 (cl (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t213.t2 t213.a0))
% 32.21/32.45 (step t213 (cl (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t213.a0))
% 32.21/32.45 (step t214 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t212 t213))
% 32.21/32.45 (step t215 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (not (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 32.21/32.45 (step t216 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t214 t215))
% 32.21/32.45 (step t217 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t216))
% 32.21/32.45 (step t218 (cl (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule implies :premises (t217))
% 32.21/32.45 (step t219 (cl (or (not (tptp.segmentP tptp.nil tptp.sk3)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t218 a79))
% 32.21/32.45 (step t220 (cl (not (tptp.segmentP tptp.nil tptp.sk3))) :rule resolution :premises (t211 t119 a187 t219))
% 32.21/32.45 (step t221 (cl) :rule resolution :premises (t60 t209 t220 a191))
% 32.21/32.45
% 32.21/32.45 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.IoXLMoOJir/cvc5---1.0.5_24684.smt2
% 32.21/32.46 % cvc5---1.0.5 exiting
% 32.32/32.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------