TSTP Solution File: SWC341-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC341-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n013.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:36 EDT 2024
% Result : Unsatisfiable 78.12s 78.31s
% Output : Proof 78.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC341-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 26 14:47:24 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.52 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.45/10.70 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.47/15.73 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.54/20.76 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.56/25.78 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.62/30.83 --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.65/35.86 --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.65/40.89 --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 45.72/45.95 --- Run --prenex-quant=none --full-saturate-quant at 5...
% 50.75/50.99 --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 5...
% 55.79/56.05 --- Run --relevant-triggers --full-saturate-quant at 5...
% 60.85/61.08 --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 5...
% 65.88/66.14 --- Run --pre-skolem-quant=on --full-saturate-quant at 10...
% 75.95/76.17 --- Run --cbqi-vo-exp --full-saturate-quant at 10...
% 78.12/78.31 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.RPaAVeVQlu/cvc5---1.0.5_23054.smt2
% 78.12/78.31 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.RPaAVeVQlu/cvc5---1.0.5_23054.smt2
% 78.12/78.34 (assume a0 (tptp.equalelemsP tptp.nil))
% 78.12/78.34 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 78.12/78.34 (assume a2 (tptp.strictorderedP tptp.nil))
% 78.12/78.34 (assume a3 (tptp.totalorderedP tptp.nil))
% 78.12/78.34 (assume a4 (tptp.strictorderP tptp.nil))
% 78.12/78.34 (assume a5 (tptp.totalorderP tptp.nil))
% 78.12/78.34 (assume a6 (tptp.cyclefreeP tptp.nil))
% 78.12/78.34 (assume a7 (tptp.ssList tptp.nil))
% 78.12/78.34 (assume a8 (tptp.ssItem tptp.skac3))
% 78.12/78.34 (assume a9 (tptp.ssItem tptp.skac2))
% 78.12/78.34 (assume a10 (not (tptp.singletonP tptp.nil)))
% 78.12/78.34 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 78.12/78.34 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 78.12/78.34 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 78.12/78.34 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 78.12/78.34 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 78.12/78.34 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 78.12/78.34 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 78.12/78.34 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 78.12/78.34 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 78.12/78.34 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 78.12/78.34 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 78.12/78.34 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 78.12/78.34 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 78.12/78.34 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 78.12/78.34 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 78.12/78.34 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 78.12/78.34 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 78.12/78.34 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 78.12/78.34 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 78.12/78.34 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 78.12/78.34 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 78.12/78.34 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 78.12/78.34 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 78.12/78.34 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 78.12/78.34 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 78.12/78.34 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 78.12/78.34 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 78.12/78.34 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 78.12/78.34 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 78.12/78.34 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 78.12/78.34 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 78.12/78.34 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 78.12/78.34 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 78.12/78.34 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 78.12/78.34 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 78.12/78.34 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 78.12/78.34 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 78.12/78.34 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 78.12/78.34 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 78.12/78.34 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 78.12/78.34 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 78.12/78.34 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 78.12/78.34 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 78.12/78.34 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 78.12/78.34 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 78.12/78.34 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 78.12/78.34 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 78.12/78.34 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 78.12/78.34 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 78.12/78.34 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 78.12/78.34 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 78.12/78.34 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 78.12/78.34 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 78.12/78.34 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 78.12/78.34 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 78.12/78.34 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 78.12/78.34 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 78.12/78.34 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 78.12/78.34 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 78.12/78.34 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 78.12/78.34 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 78.12/78.34 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 78.12/78.34 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 78.12/78.34 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 78.12/78.34 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 78.12/78.34 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 78.12/78.34 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 78.12/78.34 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 78.12/78.34 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 78.12/78.34 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 78.12/78.34 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 78.12/78.34 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 78.12/78.34 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 78.12/78.34 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 78.12/78.34 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 78.12/78.34 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 78.12/78.34 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 78.12/78.34 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 78.12/78.34 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 78.12/78.34 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 78.12/78.34 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 78.12/78.34 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 78.12/78.34 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 78.12/78.34 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 78.12/78.34 (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))))
% 78.12/78.34 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 78.12/78.34 (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))))
% 78.12/78.34 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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))))
% 78.12/78.34 (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)))))
% 78.12/78.34 (assume a185 (tptp.ssList tptp.sk1))
% 78.12/78.34 (assume a186 (tptp.ssList tptp.sk2))
% 78.12/78.34 (assume a187 (tptp.ssList tptp.sk3))
% 78.12/78.34 (assume a188 (tptp.ssList tptp.sk4))
% 78.12/78.34 (assume a189 (= tptp.sk2 tptp.sk4))
% 78.12/78.34 (assume a190 (= tptp.sk1 tptp.sk3))
% 78.12/78.34 (assume a191 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 78.12/78.34 (assume a192 (or (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 78.12/78.34 (assume a193 (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 78.12/78.34 (assume a194 (or (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 78.12/78.34 (assume a195 (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.totalorderedP tptp.sk1))))
% 78.12/78.34 (step t1 (cl (not (= (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) (not (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule equiv_pos2)
% 78.12/78.34 (step t2 (cl (= (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule refl)
% 78.12/78.34 (step t3 (cl (= (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule refl)
% 78.12/78.34 (step t4 (cl (= (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule refl)
% 78.12/78.34 (step t5 (cl (= (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule refl)
% 78.12/78.34 (step t6 (cl (= (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule refl)
% 78.12/78.34 (step t7 (cl (= (= (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) true) (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule equiv_simplify)
% 78.12/78.34 (step t8 (cl (not (= (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) true)) (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule equiv1 :premises (t7))
% 78.12/78.34 (step t9 (cl (= (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))))) :rule all_simplify)
% 78.12/78.34 (step t10 (cl (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule refl)
% 78.12/78.34 (step t11 (cl (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule all_simplify)
% 78.12/78.34 (step t12 (cl (= (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule cong :premises (t10 t11))
% 78.12/78.34 (step t13 (cl (= (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) true)) :rule all_simplify)
% 78.12/78.34 (step t14 (cl (= (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) true)) :rule trans :premises (t12 t13))
% 78.12/78.34 (step t15 (cl (= (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) true)) :rule trans :premises (t9 t14))
% 78.12/78.34 (step t16 (cl (= (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t8 t15))
% 78.12/78.34 (step t17 (cl (= (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule refl)
% 78.12/78.34 (step t18 (cl (= (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule cong :premises (t2 t3 t4 t5 t6 t16 t17))
% 78.12/78.34 (step t19 (cl (not (= (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) (not (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule equiv_pos2)
% 78.12/78.34 (step t20 (cl (= (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule refl)
% 78.12/78.34 (step t21 (cl (= (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))))) :rule equiv_simplify)
% 78.12/78.34 (step t22 (cl (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) (not (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))))) :rule equiv2 :premises (t21))
% 78.12/78.34 (step t23 (cl (not (not (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule not_not)
% 78.12/78.34 (step t24 (cl (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t22 t23))
% 78.12/78.34 (step t25 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t26)
% 78.12/78.34 (assume t26.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))
% 78.12/78.34 (assume t26.a1 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 78.12/78.34 (assume t26.a2 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 78.12/78.34 (assume t26.a3 (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 78.12/78.34 (assume t26.a4 (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))
% 78.12/78.34 (assume t26.a5 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 78.12/78.34 (assume t26.a6 (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))
% 78.12/78.34 (step t26.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 78.12/78.34 (step t26.t2 (cl (= (= false true) false)) :rule all_simplify)
% 78.12/78.34 (step t26.t3 (cl (= (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) false) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule equiv_simplify)
% 78.12/78.34 (step t26.t4 (cl (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) false) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule equiv2 :premises (t26.t3))
% 78.12/78.34 (step t26.t5 (cl (not (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule not_not)
% 78.12/78.34 (step t26.t6 (cl (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) false) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t26.t4 t26.t5))
% 78.12/78.34 (step t26.t7 (cl (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) false)) :rule resolution :premises (t26.t6 t26.a6))
% 78.12/78.34 (step t26.t8 (cl (= false (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule symm :premises (t26.t7))
% 78.12/78.34 (step t26.t9 (cl (= (tptp.app tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t26.a5))
% 78.12/78.34 (step t26.t10 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule refl)
% 78.12/78.34 (step t26.t11 (cl (= (tptp.app (tptp.app tptp.nil tptp.nil) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule cong :premises (t26.t9 t26.t10))
% 78.12/78.34 (step t26.t12 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.app (tptp.app tptp.nil tptp.nil) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule symm :premises (t26.t11))
% 78.12/78.34 (step t26.t13 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.app tptp.nil tptp.nil) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule trans :premises (t26.a4 t26.t12))
% 78.12/78.34 (step t26.t14 (cl (= (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule symm :premises (t26.a4))
% 78.12/78.34 (step t26.t15 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule symm :premises (t26.a3))
% 78.12/78.34 (step t26.t16 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule symm :premises (t26.t15))
% 78.12/78.34 (step t26.t17 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t26.a2))
% 78.12/78.34 (step t26.t18 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t26.a1))
% 78.12/78.34 (step t26.t19 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t26.t18))
% 78.12/78.34 (step t26.t20 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.nil tptp.sk3))) :rule trans :premises (t26.t17 t26.t19))
% 78.12/78.34 (step t26.t21 (cl (= (tptp.skaf43 tptp.sk5 tptp.sk4) (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule refl)
% 78.12/78.34 (step t26.t22 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule cong :premises (t26.t20 t26.t21))
% 78.12/78.34 (step t26.t23 (cl (= (tptp.app (tptp.app tptp.nil tptp.nil) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule trans :premises (t26.t11 t26.t14 t26.t16 t26.t22))
% 78.12/78.34 (step t26.t24 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule trans :premises (t26.t13 t26.t23))
% 78.12/78.34 (step t26.t25 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 78.12/78.34 (step t26.t26 (cl (= (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule cong :premises (t26.t24 t26.t25))
% 78.12/78.34 (step t26.t27 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule equiv_simplify)
% 78.12/78.34 (step t26.t28 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule equiv2 :premises (t26.t27))
% 78.12/78.34 (step t26.t29 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) true)) :rule resolution :premises (t26.t28 t26.a0))
% 78.12/78.34 (step t26.t30 (cl (= false true)) :rule trans :premises (t26.t8 t26.t26 t26.t29))
% 78.12/78.34 (step t26.t31 (cl false) :rule resolution :premises (t26.t1 t26.t2 t26.t30))
% 78.12/78.34 (step t26 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) :rule subproof :discharge (t26.a0 t26.a1 t26.a2 t26.a3 t26.a4 t26.a5 t26.a6))
% 78.12/78.34 (step t27 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule and_pos)
% 78.12/78.34 (step t28 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 78.12/78.34 (step t29 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t30 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule and_pos)
% 78.12/78.34 (step t31 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule and_pos)
% 78.12/78.34 (step t32 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t33 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule and_pos)
% 78.12/78.34 (step t34 (cl false (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule resolution :premises (t26 t27 t28 t29 t30 t31 t32 t33))
% 78.12/78.34 (step t35 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) false) :rule reordering :premises (t34))
% 78.12/78.34 (step t36 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) false) :rule contraction :premises (t35))
% 78.12/78.34 (step t37 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) false) :rule resolution :premises (t25 t36))
% 78.12/78.34 (step t38 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) (not false)) :rule implies_neg2)
% 78.12/78.34 (step t39 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false)) :rule resolution :premises (t37 t38))
% 78.12/78.34 (step t40 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false)) :rule contraction :premises (t39))
% 78.12/78.34 (step t41 (cl (= (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))))) :rule implies_simplify)
% 78.12/78.34 (step t42 (cl (not (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false)) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule equiv1 :premises (t41))
% 78.12/78.34 (step t43 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule resolution :premises (t40 t42))
% 78.12/78.34 (step t44 (cl (= (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) false)) :rule resolution :premises (t24 t43))
% 78.12/78.34 (step t45 (cl (= (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) false))) :rule cong :premises (t20 t44))
% 78.12/78.34 (step t46 (cl (= (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) false) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule all_simplify)
% 78.12/78.34 (step t47 (cl (= (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule trans :premises (t45 t46))
% 78.12/78.34 (step t48 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t49)
% 78.12/78.34 (assume t49.a0 (= tptp.nil (tptp.app tptp.nil tptp.nil)))
% 78.12/78.34 (assume t49.a1 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 78.12/78.34 (assume t49.a2 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 78.12/78.34 (assume t49.a3 (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 78.12/78.34 (assume t49.a4 (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))
% 78.12/78.34 (assume t49.a5 (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))
% 78.12/78.34 (assume t49.a6 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))
% 78.12/78.34 (step t49.t1 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule and_neg)
% 78.12/78.34 (step t49.t2 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t49.t1 t49.a6 t49.a2 t49.a1 t49.a3 t49.a4 t49.a0 t49.a5))
% 78.12/78.34 (step t49 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule subproof :discharge (t49.a0 t49.a1 t49.a2 t49.a3 t49.a4 t49.a5 t49.a6))
% 78.12/78.34 (step t50 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t51 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t52 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 78.12/78.34 (step t53 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule and_pos)
% 78.12/78.34 (step t54 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule and_pos)
% 78.12/78.34 (step t55 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule and_pos)
% 78.12/78.34 (step t56 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule and_pos)
% 78.12/78.34 (step t57 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t49 t50 t51 t52 t53 t54 t55 t56))
% 78.12/78.34 (step t58 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule reordering :premises (t57))
% 78.12/78.34 (step t59 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule contraction :premises (t58))
% 78.12/78.34 (step t60 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t48 t59))
% 78.12/78.34 (step t61 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule implies_neg2)
% 78.12/78.34 (step t62 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule resolution :premises (t60 t61))
% 78.12/78.34 (step t63 (cl (=> (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= tptp.nil (tptp.app tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule contraction :premises (t62))
% 78.12/78.34 (step t64 (cl (not (and (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t19 t47 t63))
% 78.12/78.34 (step t65 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule not_and :premises (t64))
% 78.12/78.34 (step t66 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (not (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule or_neg)
% 78.12/78.34 (step t67 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule or_neg)
% 78.12/78.34 (step t68 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule or_neg)
% 78.12/78.34 (step t69 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule or_neg)
% 78.12/78.34 (step t70 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule or_neg)
% 78.12/78.34 (step t71 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))))) :rule or_neg)
% 78.12/78.34 (step t72 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule or_neg)
% 78.12/78.34 (step t73 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t65 t66 t67 t68 t69 t70 t71 t72))
% 78.12/78.34 (step t74 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule contraction :premises (t73))
% 78.12/78.34 (step t75 (cl (or (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t1 t18 t74))
% 78.12/78.34 (step t76 (cl (not (= tptp.nil (tptp.app tptp.nil tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule or :premises (t75))
% 78.12/78.34 (step t77 (cl (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule or_pos)
% 78.12/78.34 (step t78 (cl (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule contraction :premises (t77))
% 78.12/78.34 (step t79 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3) (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule reordering :premises (t78))
% 78.12/78.34 (step t80 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)) :rule or_pos)
% 78.12/78.34 (step t81 (cl (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule reordering :premises (t80))
% 78.12/78.34 (step t82 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t83)
% 78.12/78.34 (assume t83.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 78.12/78.34 (step t83.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 78.12/78.34 (step t83.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule or :premises (t83.t1))
% 78.12/78.34 (step t83.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t83.t2 t83.a0))
% 78.12/78.34 (step t83 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule subproof :discharge (t83.a0))
% 78.12/78.34 (step t84 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t82 t83))
% 78.12/78.34 (step t85 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule implies_neg2)
% 78.12/78.34 (step t86 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule resolution :premises (t84 t85))
% 78.12/78.34 (step t87 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule contraction :premises (t86))
% 78.12/78.34 (step t88 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule implies :premises (t87))
% 78.12/78.34 (step t89 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t88 a56))
% 78.12/78.34 (step t90 (cl (tptp.segmentP tptp.sk3 tptp.sk3)) :rule resolution :premises (t81 a187 t89))
% 78.12/78.34 (step t91 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t92)
% 78.12/78.34 (assume t92.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 78.12/78.34 (step t92.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk4)))
% 78.12/78.34 (step t92.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule or :premises (t92.t1))
% 78.12/78.34 (step t92.t3 (cl (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule resolution :premises (t92.t2 t92.a0))
% 78.12/78.34 (step t92 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule subproof :discharge (t92.a0))
% 78.12/78.34 (step t93 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule resolution :premises (t91 t92))
% 78.12/78.34 (step t94 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule implies_neg2)
% 78.12/78.34 (step t95 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule resolution :premises (t93 t94))
% 78.12/78.34 (step t96 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule contraction :premises (t95))
% 78.12/78.34 (step t97 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V)))) (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule implies :premises (t96))
% 78.12/78.34 (step t98 (cl (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) :rule resolution :premises (t97 a51))
% 78.12/78.34 (step t99 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (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)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t100)
% 78.12/78.34 (assume t100.a0 (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))))
% 78.12/78.34 (step t100.t1 (cl (or (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk3) (:= W (tptp.skaf43 tptp.sk5 tptp.sk4)) (:= X tptp.nil)))
% 78.12/78.34 (step t100.t2 (cl (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule or :premises (t100.t1))
% 78.12/78.34 (step t100.t3 (cl (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t100.t2 t100.a0))
% 78.12/78.34 (step t100 (cl (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule subproof :discharge (t100.a0))
% 78.12/78.34 (step t101 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t99 t100))
% 78.12/78.34 (step t102 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule implies_neg2)
% 78.12/78.34 (step t103 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule resolution :premises (t101 t102))
% 78.12/78.34 (step t104 (cl (=> (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))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)))) :rule contraction :premises (t103))
% 78.12/78.34 (step t105 (cl (not (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)))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule implies :premises (t104))
% 78.12/78.34 (step t106 (cl (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t105 a171))
% 78.12/78.34 (step t107 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) :rule resolution :premises (t79 a7 a187 t90 t98 t106))
% 78.12/78.34 (step t108 (cl (not (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)) :rule or_pos)
% 78.12/78.34 (step t109 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3) (not (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule reordering :premises (t108))
% 78.12/78.34 (step t110 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule or_pos)
% 78.12/78.34 (step t111 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule reordering :premises (t110))
% 78.12/78.34 (step t112 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a192))
% 78.12/78.34 (step t113 (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)
% 78.12/78.34 (step t114 (cl (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t113))
% 78.12/78.34 (step t115 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a191))
% 78.12/78.34 (step t116 (cl (not (= (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.totalorderedP tptp.sk1))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))))) (not (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.totalorderedP tptp.sk1)))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3)))) :rule equiv_pos2)
% 78.12/78.34 (step t117 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 78.12/78.34 (step t118 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t117 a190 a189))
% 78.12/78.34 (step t119 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t118))
% 78.12/78.34 (step t120 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t118))
% 78.12/78.34 (step t121 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule cong :premises (t119 t120))
% 78.12/78.34 (step t122 (cl (= (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule cong :premises (t121))
% 78.12/78.34 (step t123 (cl (= (tptp.totalorderedP tptp.sk1) (tptp.totalorderedP tptp.sk3))) :rule cong :premises (t120))
% 78.12/78.34 (step t124 (cl (= (not (tptp.totalorderedP tptp.sk1)) (not (tptp.totalorderedP tptp.sk3)))) :rule cong :premises (t123))
% 78.12/78.34 (step t125 (cl (= (or (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.totalorderedP tptp.sk1))) (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))))) :rule cong :premises (t122 t124))
% 78.12/78.34 (step t126 (cl (or (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3)))) :rule resolution :premises (t116 t125 a195))
% 78.12/78.34 (step t127 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))) :rule or :premises (t126))
% 78.12/78.34 (step t128 (cl (not (tptp.totalorderedP tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule reordering :premises (t127))
% 78.12/78.34 (step t129 (cl (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)) (not (= tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.nil))) :rule and_neg)
% 78.12/78.34 (step t130 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3)) (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t131)
% 78.12/78.34 (assume t131.a0 (= tptp.nil tptp.sk3))
% 78.12/78.34 (assume t131.a1 (tptp.segmentP tptp.sk4 tptp.nil))
% 78.12/78.34 (step t131.t1 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t131.t2)
% 78.12/78.34 (assume t131.t2.a0 (tptp.segmentP tptp.sk4 tptp.nil))
% 78.12/78.34 (assume t131.t2.a1 (= tptp.nil tptp.sk3))
% 78.12/78.34 (step t131.t2.t1 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) true) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv_simplify)
% 78.12/78.34 (step t131.t2.t2 (cl (not (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule equiv1 :premises (t131.t2.t1))
% 78.12/78.34 (step t131.t2.t3 (cl (= tptp.sk4 tptp.sk4)) :rule refl)
% 78.12/78.34 (step t131.t2.t4 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t131.t2.a1))
% 78.12/78.34 (step t131.t2.t5 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) :rule cong :premises (t131.t2.t3 t131.t2.t4))
% 78.12/78.34 (step t131.t2.t6 (cl (= (= (tptp.segmentP tptp.sk4 tptp.nil) true) (tptp.segmentP tptp.sk4 tptp.nil))) :rule equiv_simplify)
% 78.12/78.34 (step t131.t2.t7 (cl (= (tptp.segmentP tptp.sk4 tptp.nil) true) (not (tptp.segmentP tptp.sk4 tptp.nil))) :rule equiv2 :premises (t131.t2.t6))
% 78.12/78.34 (step t131.t2.t8 (cl (= (tptp.segmentP tptp.sk4 tptp.nil) true)) :rule resolution :premises (t131.t2.t7 t131.t2.a0))
% 78.12/78.34 (step t131.t2.t9 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) :rule trans :premises (t131.t2.t5 t131.t2.t8))
% 78.12/78.34 (step t131.t2.t10 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t131.t2.t2 t131.t2.t9))
% 78.12/78.34 (step t131.t2 (cl (not (tptp.segmentP tptp.sk4 tptp.nil)) (not (= tptp.nil tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule subproof :discharge (t131.t2.a0 t131.t2.a1))
% 78.12/78.34 (step t131.t3 (cl (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.nil)) :rule and_pos)
% 78.12/78.34 (step t131.t4 (cl (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 78.12/78.34 (step t131.t5 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t131.t2 t131.t3 t131.t4))
% 78.12/78.34 (step t131.t6 (cl (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule reordering :premises (t131.t5))
% 78.12/78.34 (step t131.t7 (cl (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule contraction :premises (t131.t6))
% 78.12/78.34 (step t131.t8 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t131.t1 t131.t7))
% 78.12/78.34 (step t131.t9 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg2)
% 78.12/78.34 (step t131.t10 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (=> (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t131.t8 t131.t9))
% 78.12/78.34 (step t131.t11 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule contraction :premises (t131.t10))
% 78.12/78.34 (step t131.t12 (cl (not (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule implies :premises (t131.t11))
% 78.12/78.34 (step t131.t13 (cl (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.nil)) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 78.12/78.34 (step t131.t14 (cl (and (tptp.segmentP tptp.sk4 tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t131.t13 t131.a1 t131.a0))
% 78.12/78.34 (step t131.t15 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t131.t12 t131.t14))
% 78.12/78.34 (step t131 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule subproof :discharge (t131.a0 t131.a1))
% 78.12/78.34 (step t132 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 78.12/78.34 (step t133 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.nil)) :rule and_pos)
% 78.12/78.34 (step t134 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)))) :rule resolution :premises (t131 t132 t133))
% 78.12/78.34 (step t135 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule reordering :premises (t134))
% 78.12/78.34 (step t136 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule contraction :premises (t135))
% 78.12/78.34 (step t137 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t130 t136))
% 78.12/78.34 (step t138 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg2)
% 78.12/78.34 (step t139 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3)) (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t137 t138))
% 78.12/78.34 (step t140 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule contraction :premises (t139))
% 78.12/78.34 (step t141 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule implies :premises (t140))
% 78.12/78.34 (step t142 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t129 t141))
% 78.12/78.34 (step t143 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.nil))) :rule reordering :premises (t142))
% 78.12/78.34 (step t144 (cl (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil)) :rule or_pos)
% 78.12/78.34 (step t145 (cl (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil)))) :rule reordering :premises (t144))
% 78.12/78.34 (step t146 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t147)
% 78.12/78.34 (assume t147.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 78.12/78.34 (step t147.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 78.12/78.34 (step t147.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) :rule or :premises (t147.t1))
% 78.12/78.34 (step t147.t3 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) :rule resolution :premises (t147.t2 t147.a0))
% 78.12/78.34 (step t147 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) :rule subproof :discharge (t147.a0))
% 78.12/78.34 (step t148 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) :rule resolution :premises (t146 t147))
% 78.12/78.34 (step t149 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil)))) :rule implies_neg2)
% 78.12/78.34 (step t150 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil)))) :rule resolution :premises (t148 t149))
% 78.12/78.34 (step t151 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil)))) :rule contraction :premises (t150))
% 78.12/78.34 (step t152 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) :rule implies :premises (t151))
% 78.12/78.34 (step t153 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.nil))) :rule resolution :premises (t152 a55))
% 78.12/78.34 (step t154 (cl (tptp.segmentP tptp.sk4 tptp.nil)) :rule resolution :premises (t145 a188 t153))
% 78.12/78.34 (step t155 (cl (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (not (tptp.totalorderedP tptp.nil)) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 78.12/78.34 (step t156 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t157)
% 78.12/78.34 (assume t157.a0 (tptp.totalorderedP tptp.nil))
% 78.12/78.34 (assume t157.a1 (= tptp.nil tptp.sk3))
% 78.12/78.34 (step t157.t1 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t157.t2)
% 78.12/78.34 (assume t157.t2.a0 (tptp.totalorderedP tptp.nil))
% 78.12/78.34 (assume t157.t2.a1 (= tptp.nil tptp.sk3))
% 78.12/78.34 (step t157.t2.t1 (cl (= (= (tptp.totalorderedP tptp.sk3) true) (tptp.totalorderedP tptp.sk3))) :rule equiv_simplify)
% 78.12/78.34 (step t157.t2.t2 (cl (not (= (tptp.totalorderedP tptp.sk3) true)) (tptp.totalorderedP tptp.sk3)) :rule equiv1 :premises (t157.t2.t1))
% 78.12/78.34 (step t157.t2.t3 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t157.t2.a1))
% 78.12/78.34 (step t157.t2.t4 (cl (= (tptp.totalorderedP tptp.sk3) (tptp.totalorderedP tptp.nil))) :rule cong :premises (t157.t2.t3))
% 78.12/78.34 (step t157.t2.t5 (cl (= (= (tptp.totalorderedP tptp.nil) true) (tptp.totalorderedP tptp.nil))) :rule equiv_simplify)
% 78.12/78.34 (step t157.t2.t6 (cl (= (tptp.totalorderedP tptp.nil) true) (not (tptp.totalorderedP tptp.nil))) :rule equiv2 :premises (t157.t2.t5))
% 78.12/78.34 (step t157.t2.t7 (cl (= (tptp.totalorderedP tptp.nil) true)) :rule resolution :premises (t157.t2.t6 t157.t2.a0))
% 78.12/78.34 (step t157.t2.t8 (cl (= (tptp.totalorderedP tptp.sk3) true)) :rule trans :premises (t157.t2.t4 t157.t2.t7))
% 78.12/78.34 (step t157.t2.t9 (cl (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t157.t2.t2 t157.t2.t8))
% 78.12/78.34 (step t157.t2 (cl (not (tptp.totalorderedP tptp.nil)) (not (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) :rule subproof :discharge (t157.t2.a0 t157.t2.a1))
% 78.12/78.34 (step t157.t3 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.nil)) :rule and_pos)
% 78.12/78.34 (step t157.t4 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 78.12/78.34 (step t157.t5 (cl (tptp.totalorderedP tptp.sk3) (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t157.t2 t157.t3 t157.t4))
% 78.12/78.34 (step t157.t6 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule reordering :premises (t157.t5))
% 78.12/78.34 (step t157.t7 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule contraction :premises (t157.t6))
% 78.12/78.34 (step t157.t8 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t157.t1 t157.t7))
% 78.12/78.34 (step t157.t9 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))) :rule implies_neg2)
% 78.12/78.34 (step t157.t10 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3))) :rule resolution :premises (t157.t8 t157.t9))
% 78.12/78.34 (step t157.t11 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3))) :rule contraction :premises (t157.t10))
% 78.12/78.34 (step t157.t12 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule implies :premises (t157.t11))
% 78.12/78.34 (step t157.t13 (cl (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (not (tptp.totalorderedP tptp.nil)) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 78.12/78.34 (step t157.t14 (cl (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t157.t13 t157.a0 t157.a1))
% 78.12/78.34 (step t157.t15 (cl (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t157.t12 t157.t14))
% 78.12/78.34 (step t157 (cl (not (tptp.totalorderedP tptp.nil)) (not (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) :rule subproof :discharge (t157.a0 t157.a1))
% 78.12/78.34 (step t158 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.nil)) :rule and_pos)
% 78.12/78.34 (step t159 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 78.12/78.34 (step t160 (cl (tptp.totalorderedP tptp.sk3) (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t157 t158 t159))
% 78.12/78.34 (step t161 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule reordering :premises (t160))
% 78.12/78.34 (step t162 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule contraction :premises (t161))
% 78.12/78.34 (step t163 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t156 t162))
% 78.12/78.34 (step t164 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))) :rule implies_neg2)
% 78.12/78.34 (step t165 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3))) :rule resolution :premises (t163 t164))
% 78.12/78.34 (step t166 (cl (=> (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3))) :rule contraction :premises (t165))
% 78.12/78.34 (step t167 (cl (not (and (tptp.totalorderedP tptp.nil) (= tptp.nil tptp.sk3))) (tptp.totalorderedP tptp.sk3)) :rule implies :premises (t166))
% 78.12/78.34 (step t168 (cl (not (tptp.totalorderedP tptp.nil)) (not (= tptp.nil tptp.sk3)) (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t155 t167))
% 78.12/78.34 (step t169 (cl (tptp.totalorderedP tptp.sk3) (not (tptp.totalorderedP tptp.nil)) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t168))
% 78.12/78.34 (step t170 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t128 t143 t154 t169 a3))
% 78.12/78.34 (step t171 (cl (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t170))
% 78.12/78.34 (step t172 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t115 t171))
% 78.12/78.34 (step t173 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.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)
% 78.12/78.34 (anchor :step t174)
% 78.12/78.34 (assume t174.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 78.12/78.34 (step t174.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)))
% 78.12/78.34 (step t174.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 (t174.t1))
% 78.12/78.34 (step t174.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 (t174.t2 t174.a0))
% 78.12/78.34 (step t174 (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 (t174.a0))
% 78.12/78.34 (step t175 (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 (t173 t174))
% 78.12/78.34 (step t176 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.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)
% 78.12/78.34 (step t177 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.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 (t175 t176))
% 78.12/78.34 (step t178 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4)))) :rule contraction :premises (t177))
% 78.12/78.34 (step t179 (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 (t178))
% 78.12/78.34 (step t180 (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)
% 78.12/78.34 (anchor :step t181 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 78.12/78.34 (step t181.t1 (cl (= U U)) :rule refl)
% 78.12/78.34 (step t181.t2 (cl (= V V)) :rule refl)
% 78.12/78.34 (step t181.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 78.12/78.34 (step t181.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 78.12/78.34 (step t181.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 78.12/78.34 (step t181.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 78.12/78.34 (step t181.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 (t181.t3 t181.t4 t181.t5 t181.t6))
% 78.12/78.34 (step t181 (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)
% 78.12/78.34 (step t182 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t180 t181 a99))
% 78.12/78.34 (step t183 (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 (t179 t182))
% 78.12/78.34 (step t184 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t114 t172 a7 a188 t183))
% 78.12/78.34 (step t185 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t112 t184))
% 78.12/78.34 (step t186 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t187)
% 78.12/78.34 (assume t187.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 78.12/78.34 (step t187.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 78.12/78.34 (step t187.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule or :premises (t187.t1))
% 78.12/78.34 (step t187.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t187.t2 t187.a0))
% 78.12/78.34 (step t187 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule subproof :discharge (t187.a0))
% 78.12/78.34 (step t188 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t186 t187))
% 78.12/78.34 (step t189 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies_neg2)
% 78.12/78.34 (step t190 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t188 t189))
% 78.12/78.34 (step t191 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule contraction :premises (t190))
% 78.12/78.34 (step t192 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule implies :premises (t191))
% 78.12/78.34 (step t193 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t192 a85))
% 78.12/78.34 (step t194 (cl (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule resolution :premises (t111 t185 t98 t193))
% 78.12/78.34 (step t195 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t196)
% 78.12/78.34 (assume t196.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 78.12/78.34 (step t196.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk5)))
% 78.12/78.34 (step t196.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule or :premises (t196.t1))
% 78.12/78.34 (step t196.t3 (cl (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule resolution :premises (t196.t2 t196.a0))
% 78.12/78.34 (step t196 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule subproof :discharge (t196.a0))
% 78.12/78.34 (step t197 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule resolution :premises (t195 t196))
% 78.12/78.34 (step t198 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule implies_neg2)
% 78.12/78.34 (step t199 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule resolution :premises (t197 t198))
% 78.12/78.34 (step t200 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5)))) :rule contraction :premises (t199))
% 78.12/78.34 (step t201 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V)))) (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule implies :premises (t200))
% 78.12/78.34 (step t202 (cl (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) :rule resolution :premises (t201 a52))
% 78.12/78.34 (step t203 (cl (not (= (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (or (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))))) (not (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) (or (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule equiv_pos2)
% 78.12/78.34 (step t204 (cl (= (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) true) (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv_simplify)
% 78.12/78.34 (step t205 (cl (not (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) true)) (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv1 :premises (t204))
% 78.12/78.34 (step t206 (cl (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) (= (tptp.segmentP tptp.sk4 tptp.sk3) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))))) :rule all_simplify)
% 78.12/78.34 (step t207 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule refl)
% 78.12/78.34 (step t208 (cl (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule all_simplify)
% 78.12/78.34 (step t209 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule cong :premises (t207 t208))
% 78.12/78.34 (step t210 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3)) true)) :rule all_simplify)
% 78.12/78.34 (step t211 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) true)) :rule trans :premises (t209 t210))
% 78.12/78.34 (step t212 (cl (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) true)) :rule trans :premises (t206 t211))
% 78.12/78.34 (step t213 (cl (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t205 t212))
% 78.12/78.34 (step t214 (cl (= (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule refl)
% 78.12/78.34 (step t215 (cl (= (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule refl)
% 78.12/78.34 (step t216 (cl (= (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule refl)
% 78.12/78.34 (step t217 (cl (= (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (or (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))))) :rule cong :premises (t213 t214 t215 t216))
% 78.12/78.34 (step t218 (cl (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule and_neg)
% 78.12/78.34 (step t219 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t220)
% 78.12/78.34 (assume t220.a0 (not (tptp.segmentP tptp.sk4 tptp.sk3)))
% 78.12/78.34 (assume t220.a1 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 78.12/78.34 (assume t220.a2 (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))
% 78.12/78.34 (step t220.t1 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t220.t2)
% 78.12/78.34 (assume t220.t2.a0 (not (tptp.segmentP tptp.sk4 tptp.sk3)))
% 78.12/78.34 (assume t220.t2.a1 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 78.12/78.34 (assume t220.t2.a2 (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))
% 78.12/78.34 (step t220.t2.t1 (cl (= (= (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3) false) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule equiv_simplify)
% 78.12/78.34 (step t220.t2.t2 (cl (not (= (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3) false)) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule equiv1 :premises (t220.t2.t1))
% 78.12/78.34 (step t220.t2.t3 (cl (= (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.sk4)) :rule symm :premises (t220.t2.a2))
% 78.12/78.34 (step t220.t2.t4 (cl (= tptp.nil tptp.nil)) :rule refl)
% 78.12/78.34 (step t220.t2.t5 (cl (= (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) (tptp.app tptp.sk4 tptp.nil))) :rule cong :premises (t220.t2.t3 t220.t2.t4))
% 78.12/78.34 (step t220.t2.t6 (cl (= (tptp.app tptp.sk4 tptp.nil) tptp.sk4)) :rule symm :premises (t220.t2.a1))
% 78.12/78.34 (step t220.t2.t7 (cl (= (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk4)) :rule trans :premises (t220.t2.t5 t220.t2.t6))
% 78.12/78.34 (step t220.t2.t8 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 78.12/78.34 (step t220.t2.t9 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule cong :premises (t220.t2.t7 t220.t2.t8))
% 78.12/78.34 (step t220.t2.t10 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) false) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv_simplify)
% 78.12/78.34 (step t220.t2.t11 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) false) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv2 :premises (t220.t2.t10))
% 78.12/78.34 (step t220.t2.t12 (cl (not (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule not_not)
% 78.12/78.34 (step t220.t2.t13 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) false) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t220.t2.t11 t220.t2.t12))
% 78.12/78.34 (step t220.t2.t14 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) false)) :rule resolution :premises (t220.t2.t13 t220.t2.a0))
% 78.12/78.34 (step t220.t2.t15 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3) false)) :rule trans :premises (t220.t2.t9 t220.t2.t14))
% 78.12/78.34 (step t220.t2.t16 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t220.t2.t2 t220.t2.t15))
% 78.12/78.34 (step t220.t2 (cl (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule subproof :discharge (t220.t2.a0 t220.t2.a1 t220.t2.a2))
% 78.12/78.34 (step t220.t3 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule and_pos)
% 78.12/78.34 (step t220.t4 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t220.t5 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule and_pos)
% 78.12/78.34 (step t220.t6 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule resolution :premises (t220.t2 t220.t3 t220.t4 t220.t5))
% 78.12/78.34 (step t220.t7 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule reordering :premises (t220.t6))
% 78.12/78.34 (step t220.t8 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule contraction :premises (t220.t7))
% 78.12/78.34 (step t220.t9 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t220.t1 t220.t8))
% 78.12/78.34 (step t220.t10 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule implies_neg2)
% 78.12/78.34 (step t220.t11 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule resolution :premises (t220.t9 t220.t10))
% 78.12/78.34 (step t220.t12 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule contraction :premises (t220.t11))
% 78.12/78.34 (step t220.t13 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule implies :premises (t220.t12))
% 78.12/78.34 (step t220.t14 (cl (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule and_neg)
% 78.12/78.34 (step t220.t15 (cl (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t220.t14 t220.a0 t220.a1 t220.a2))
% 78.12/78.34 (step t220.t16 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t220.t13 t220.t15))
% 78.12/78.34 (step t220 (cl (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule subproof :discharge (t220.a0 t220.a1 t220.a2))
% 78.12/78.34 (step t221 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule and_pos)
% 78.12/78.34 (step t222 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t223 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule and_pos)
% 78.12/78.34 (step t224 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule resolution :premises (t220 t221 t222 t223))
% 78.12/78.34 (step t225 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule reordering :premises (t224))
% 78.12/78.34 (step t226 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule contraction :premises (t225))
% 78.12/78.34 (step t227 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t219 t226))
% 78.12/78.34 (step t228 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule implies_neg2)
% 78.12/78.34 (step t229 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule resolution :premises (t227 t228))
% 78.12/78.34 (step t230 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule contraction :premises (t229))
% 78.12/78.34 (step t231 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule implies :premises (t230))
% 78.12/78.34 (step t232 (cl (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t218 t231))
% 78.12/78.34 (step t233 (cl (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (not (not (tptp.segmentP tptp.sk4 tptp.sk3))))) :rule or_neg)
% 78.12/78.34 (step t234 (cl (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule or_neg)
% 78.12/78.34 (step t235 (cl (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule or_neg)
% 78.12/78.34 (step t236 (cl (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule or_neg)
% 78.12/78.34 (step t237 (cl (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule resolution :premises (t232 t233 t234 t235 t236))
% 78.12/78.34 (step t238 (cl (or (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule contraction :premises (t237))
% 78.12/78.34 (step t239 (cl (or (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule resolution :premises (t203 t217 t238))
% 78.12/78.34 (step t240 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule or :premises (t239))
% 78.12/78.34 (step t241 (cl (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 78.12/78.34 (step t242 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t243)
% 78.12/78.34 (assume t243.a0 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 78.12/78.34 (assume t243.a1 (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))
% 78.12/78.34 (step t243.t1 (cl (=> (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t243.t2)
% 78.12/78.34 (assume t243.t2.a0 (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))
% 78.12/78.34 (assume t243.t2.a1 (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))
% 78.12/78.34 (step t243.t2.t1 (cl (= (= (tptp.totalorderedP tptp.sk3) true) (tptp.totalorderedP tptp.sk3))) :rule equiv_simplify)
% 78.12/78.34 (step t243.t2.t2 (cl (not (= (tptp.totalorderedP tptp.sk3) true)) (tptp.totalorderedP tptp.sk3)) :rule equiv1 :premises (t243.t2.t1))
% 78.12/78.34 (step t243.t2.t3 (cl (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3)) :rule symm :premises (t243.t2.a1))
% 78.12/78.34 (step t243.t2.t4 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule symm :premises (t243.t2.t3))
% 78.12/78.34 (step t243.t2.t5 (cl (= (tptp.totalorderedP tptp.sk3) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t243.t2.t4))
% 78.12/78.34 (step t243.t2.t6 (cl (= (= (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) true) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv_simplify)
% 78.12/78.34 (step t243.t2.t7 (cl (= (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) true) (not (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule equiv2 :premises (t243.t2.t6))
% 78.12/78.34 (step t243.t2.t8 (cl (= (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) true)) :rule resolution :premises (t243.t2.t7 t243.t2.a0))
% 78.12/78.34 (step t243.t2.t9 (cl (= (tptp.totalorderedP tptp.sk3) true)) :rule trans :premises (t243.t2.t5 t243.t2.t8))
% 78.12/78.34 (step t243.t2.t10 (cl (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t243.t2.t2 t243.t2.t9))
% 78.12/78.34 (step t243.t2 (cl (not (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) :rule subproof :discharge (t243.t2.a0 t243.t2.a1))
% 78.12/78.34 (step t243.t3 (cl (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t243.t4 (cl (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t243.t5 (cl (tptp.totalorderedP tptp.sk3) (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t243.t2 t243.t3 t243.t4))
% 78.12/78.34 (step t243.t6 (cl (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP tptp.sk3)) :rule reordering :premises (t243.t5))
% 78.12/78.34 (step t243.t7 (cl (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP tptp.sk3)) :rule contraction :premises (t243.t6))
% 78.12/78.34 (step t243.t8 (cl (=> (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t243.t1 t243.t7))
% 78.12/78.34 (step t243.t9 (cl (=> (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))) :rule implies_neg2)
% 78.12/78.34 (step t243.t10 (cl (=> (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (=> (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3))) :rule resolution :premises (t243.t8 t243.t9))
% 78.12/78.34 (step t243.t11 (cl (=> (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3))) :rule contraction :premises (t243.t10))
% 78.12/78.34 (step t243.t12 (cl (not (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP tptp.sk3)) :rule implies :premises (t243.t11))
% 78.12/78.34 (step t243.t13 (cl (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_neg)
% 78.12/78.34 (step t243.t14 (cl (and (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t243.t13 t243.a1 t243.a0))
% 78.12/78.34 (step t243.t15 (cl (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t243.t12 t243.t14))
% 78.12/78.34 (step t243 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) :rule subproof :discharge (t243.a0 t243.a1))
% 78.12/78.34 (step t244 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t245 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) :rule and_pos)
% 78.12/78.34 (step t246 (cl (tptp.totalorderedP tptp.sk3) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t243 t244 t245))
% 78.12/78.34 (step t247 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP tptp.sk3)) :rule reordering :premises (t246))
% 78.12/78.34 (step t248 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP tptp.sk3)) :rule contraction :premises (t247))
% 78.12/78.34 (step t249 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t242 t248))
% 78.12/78.34 (step t250 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (not (tptp.totalorderedP tptp.sk3))) :rule implies_neg2)
% 78.12/78.34 (step t251 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3))) :rule resolution :premises (t249 t250))
% 78.12/78.34 (step t252 (cl (=> (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3))) :rule contraction :premises (t251))
% 78.12/78.34 (step t253 (cl (not (and (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (tptp.totalorderedP tptp.sk3)) :rule implies :premises (t252))
% 78.12/78.34 (step t254 (cl (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t241 t253))
% 78.12/78.34 (step t255 (cl (tptp.totalorderedP tptp.sk3) (not (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t254))
% 78.12/78.34 (step t256 (cl (not (= (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 78.12/78.34 (step t257 (cl (= (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)))) :rule all_simplify)
% 78.12/78.34 (step t258 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 78.12/78.34 (step t259 (cl (= (or (= (tptp.cons tptp.sk5 tptp.nil) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t257 t258))
% 78.12/78.34 (step t260 (cl (or (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t256 t259 a193))
% 78.12/78.34 (step t261 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t260))
% 78.12/78.34 (step t262 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule reordering :premises (t261))
% 78.12/78.34 (step t263 (cl (= tptp.sk3 (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t262 t184))
% 78.12/78.34 (step t264 (cl (not (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 78.12/78.34 (step t265 (cl (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t264))
% 78.12/78.34 (step t266 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t267)
% 78.12/78.34 (assume t267.a0 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 78.12/78.34 (step t267.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5)))
% 78.12/78.34 (step t267.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t267.t1))
% 78.12/78.34 (step t267.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t267.t2 t267.a0))
% 78.12/78.34 (step t267 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t267.a0))
% 78.12/78.34 (step t268 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t266 t267))
% 78.12/78.34 (step t269 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 78.12/78.34 (step t270 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t268 t269))
% 78.12/78.34 (step t271 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t270))
% 78.12/78.34 (step t272 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t271))
% 78.12/78.34 (step t273 (cl (or (not (tptp.ssItem tptp.sk5)) (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t272 a66))
% 78.12/78.34 (step t274 (cl (tptp.totalorderedP (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t265 t185 t273))
% 78.12/78.34 (step t275 (cl (tptp.totalorderedP tptp.sk3)) :rule resolution :premises (t255 t263 t274))
% 78.12/78.34 (step t276 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t128 t275))
% 78.12/78.34 (step t277 (cl (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule or_pos)
% 78.12/78.34 (step t278 (cl (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule reordering :premises (t277))
% 78.12/78.34 (step t279 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t280)
% 78.12/78.34 (assume t280.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 78.12/78.34 (step t280.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk4)))
% 78.12/78.34 (step t280.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule or :premises (t280.t1))
% 78.12/78.34 (step t280.t3 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t280.t2 t280.a0))
% 78.12/78.34 (step t280 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule subproof :discharge (t280.a0))
% 78.12/78.34 (step t281 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t279 t280))
% 78.12/78.34 (step t282 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule implies_neg2)
% 78.12/78.34 (step t283 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule resolution :premises (t281 t282))
% 78.12/78.34 (step t284 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule contraction :premises (t283))
% 78.12/78.34 (step t285 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule implies :premises (t284))
% 78.12/78.34 (step t286 (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)
% 78.12/78.34 (anchor :step t287 :args ((U $$unsorted) (:= U U)))
% 78.12/78.34 (step t287.t1 (cl (= U U)) :rule refl)
% 78.12/78.34 (step t287.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 78.12/78.34 (step t287.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 78.12/78.34 (step t287.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 (t287.t2 t287.t3))
% 78.12/78.34 (step t287 (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)
% 78.12/78.34 (step t288 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t286 t287 a72))
% 78.12/78.34 (step t289 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t285 t288))
% 78.12/78.34 (step t290 (cl (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule resolution :premises (t278 a188 t289))
% 78.12/78.34 (step t291 (cl (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule or_pos)
% 78.12/78.34 (step t292 (cl (not (tptp.ssList tptp.sk4)) (not (tptp.ssItem tptp.sk5)) (not (tptp.memberP tptp.sk4 tptp.sk5)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule reordering :premises (t291))
% 78.12/78.34 (step t293 (cl (tptp.memberP tptp.sk4 tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a194))
% 78.12/78.34 (step t294 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.memberP tptp.sk4 tptp.sk5)) :rule reordering :premises (t293))
% 78.12/78.34 (step t295 (cl (tptp.memberP tptp.sk4 tptp.sk5)) :rule resolution :premises (t294 t184))
% 78.12/78.34 (step t296 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t297)
% 78.12/78.34 (assume t297.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))
% 78.12/78.34 (step t297.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk5)))
% 78.12/78.34 (step t297.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule or :premises (t297.t1))
% 78.12/78.34 (step t297.t3 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t297.t2 t297.a0))
% 78.12/78.34 (step t297 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule subproof :discharge (t297.a0))
% 78.12/78.34 (step t298 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t296 t297))
% 78.12/78.34 (step t299 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule implies_neg2)
% 78.12/78.34 (step t300 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule resolution :premises (t298 t299))
% 78.12/78.34 (step t301 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule contraction :premises (t300))
% 78.12/78.34 (step t302 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies :premises (t301))
% 78.12/78.34 (step t303 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule equiv_pos2)
% 78.12/78.34 (anchor :step t304 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 78.12/78.34 (step t304.t1 (cl (= U U)) :rule refl)
% 78.12/78.34 (step t304.t2 (cl (= V V)) :rule refl)
% 78.12/78.34 (step t304.t3 (cl (= (not (tptp.memberP U V)) (not (tptp.memberP U V)))) :rule refl)
% 78.12/78.34 (step t304.t4 (cl (= (not (tptp.ssItem V)) (not (tptp.ssItem V)))) :rule refl)
% 78.12/78.34 (step t304.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 78.12/78.34 (step t304.t6 (cl (= (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))) :rule all_simplify)
% 78.12/78.34 (step t304.t7 (cl (= (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)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule cong :premises (t304.t3 t304.t4 t304.t5 t304.t6))
% 78.12/78.34 (step t304 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U)))))))) :rule bind)
% 78.12/78.34 (step t305 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))))))) :rule resolution :premises (t303 t304 a168))
% 78.12/78.34 (step t306 (cl (or (not (tptp.memberP tptp.sk4 tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t302 t305))
% 78.12/78.34 (step t307 (cl (= tptp.sk4 (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t292 a188 t185 t295 t306))
% 78.12/78.34 (step t308 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t240 t276 t290 t307))
% 78.12/78.34 (step t309 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (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)))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t310)
% 78.12/78.34 (assume t310.a0 (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))))
% 78.12/78.34 (step t310.t1 (cl (or (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (:= V tptp.sk3) (:= W tptp.nil) (:= X (tptp.skaf42 tptp.sk4 tptp.sk5))))
% 78.12/78.34 (step t310.t2 (cl (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule or :premises (t310.t1))
% 78.12/78.34 (step t310.t3 (cl (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t310.t2 t310.a0))
% 78.12/78.34 (step t310 (cl (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule subproof :discharge (t310.a0))
% 78.12/78.34 (step t311 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t309 t310))
% 78.12/78.34 (step t312 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (not (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule implies_neg2)
% 78.12/78.34 (step t313 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule resolution :premises (t311 t312))
% 78.12/78.34 (step t314 (cl (=> (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))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3)))) :rule contraction :premises (t313))
% 78.12/78.34 (step t315 (cl (not (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)))) (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule implies :premises (t314))
% 78.12/78.34 (step t316 (cl (or (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf42 tptp.sk4 tptp.sk5))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (tptp.segmentP (tptp.app (tptp.app (tptp.skaf42 tptp.sk4 tptp.sk5) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) tptp.nil) tptp.sk3))) :rule resolution :premises (t315 a171))
% 78.12/78.34 (step t317 (cl (not (tptp.segmentP (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) tptp.sk3))) :rule resolution :premises (t109 a7 a187 t194 t202 t308 t316))
% 78.12/78.34 (step t318 (cl (not (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule or_pos)
% 78.12/78.34 (step t319 (cl (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule reordering :premises (t318))
% 78.12/78.34 (step t320 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t321)
% 78.12/78.34 (assume t321.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 78.12/78.34 (step t321.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))
% 78.12/78.34 (step t321.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule or :premises (t321.t1))
% 78.12/78.34 (step t321.t3 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t321.t2 t321.a0))
% 78.12/78.34 (step t321 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule subproof :discharge (t321.a0))
% 78.12/78.34 (step t322 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t320 t321))
% 78.12/78.34 (step t323 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (not (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule implies_neg2)
% 78.12/78.34 (step t324 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule resolution :premises (t322 t323))
% 78.12/78.34 (step t325 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule contraction :premises (t324))
% 78.12/78.34 (step t326 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies :premises (t325))
% 78.12/78.34 (step t327 (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)
% 78.12/78.34 (anchor :step t328 :args ((U $$unsorted) (:= U U)))
% 78.12/78.34 (step t328.t1 (cl (= U U)) :rule refl)
% 78.12/78.34 (step t328.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 78.12/78.34 (step t328.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 78.12/78.34 (step t328.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 (t328.t2 t328.t3))
% 78.12/78.34 (step t328 (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)
% 78.12/78.34 (step t329 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t327 t328 a73))
% 78.12/78.34 (step t330 (cl (or (not (tptp.ssList (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t326 t329))
% 78.12/78.34 (step t331 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app tptp.nil (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t319 t194 t330))
% 78.12/78.34 (step t332 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule or_pos)
% 78.12/78.34 (step t333 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule reordering :premises (t332))
% 78.12/78.34 (step t334 (cl (not (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))))) (not (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule equiv_pos2)
% 78.12/78.34 (step t335 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))) :rule refl)
% 78.12/78.34 (step t336 (cl (= (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)))) :rule refl)
% 78.12/78.34 (step t337 (cl (= (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule refl)
% 78.12/78.34 (step t338 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule all_simplify)
% 78.12/78.34 (step t339 (cl (= (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule cong :premises (t336 t337 t338))
% 78.12/78.34 (step t340 (cl (= (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))))) :rule cong :premises (t335 t339))
% 78.12/78.34 (step t341 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) :rule implies_neg1)
% 78.12/78.34 (anchor :step t342)
% 78.12/78.34 (assume t342.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 78.12/78.34 (step t342.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V (tptp.skaf43 tptp.sk5 tptp.sk4))))
% 78.12/78.34 (step t342.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule or :premises (t342.t1))
% 78.12/78.34 (step t342.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t342.t2 t342.a0))
% 78.12/78.34 (step t342 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule subproof :discharge (t342.a0))
% 78.12/78.34 (step t343 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t341 t342))
% 78.12/78.34 (step t344 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule implies_neg2)
% 78.12/78.34 (step t345 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t343 t344))
% 78.12/78.34 (step t346 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule contraction :premises (t345))
% 78.12/78.34 (step t347 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))))) :rule resolution :premises (t334 t340 t346))
% 78.12/78.34 (step t348 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule implies :premises (t347))
% 78.12/78.34 (step t349 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList (tptp.skaf43 tptp.sk5 tptp.sk4))) (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4))))) :rule resolution :premises (t348 a119))
% 78.12/78.34 (step t350 (cl (= (tptp.cons tptp.sk5 (tptp.skaf43 tptp.sk5 tptp.sk4)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.skaf43 tptp.sk5 tptp.sk4)))) :rule resolution :premises (t333 t185 t98 t349))
% 78.12/78.34 (step t351 (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)
% 78.12/78.34 (step t352 (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 (t351))
% 78.12/78.34 (step t353 (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)
% 78.12/78.34 (anchor :step t354)
% 78.12/78.34 (assume t354.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 78.12/78.34 (step t354.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)))
% 78.12/78.34 (step t354.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 (t354.t1))
% 78.12/78.34 (step t354.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t354.t2 t354.a0))
% 78.12/78.34 (step t354 (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 (t354.a0))
% 78.12/78.34 (step t355 (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 (t353 t354))
% 78.12/78.34 (step t356 (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)
% 78.12/78.34 (step t357 (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 (t355 t356))
% 78.12/78.34 (step t358 (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 (t357))
% 78.12/78.34 (step t359 (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 (t358))
% 78.12/78.34 (step t360 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t359 t329))
% 78.12/78.34 (step t361 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule resolution :premises (t352 a187 t360))
% 78.12/78.34 (step t362 (cl (not (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) (not (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)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule equiv_pos2)
% 78.12/78.34 (anchor :step t363 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 78.12/78.34 (step t363.t1 (cl (= U U)) :rule refl)
% 78.12/78.34 (step t363.t2 (cl (= V V)) :rule refl)
% 78.12/78.34 (step t363.t3 (cl (= (not (= tptp.nil U)) (not (= tptp.nil U)))) :rule refl)
% 78.12/78.34 (step t363.t4 (cl (= (not (= tptp.nil V)) (not (= tptp.nil V)))) :rule refl)
% 78.12/78.34 (step t363.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 78.12/78.34 (step t363.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 78.12/78.34 (step t363.t7 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 78.12/78.34 (step t363.t8 (cl (= (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V))))) :rule cong :premises (t363.t3 t363.t4 t363.t5 t363.t6 t363.t7))
% 78.12/78.34 (step t363 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))))) :rule bind)
% 78.12/78.34 (step t364 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 78.12/78.34 (step t365 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 78.12/78.34 (step t366 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t365))
% 78.12/78.34 (step t367 (cl (= (not true) false)) :rule all_simplify)
% 78.12/78.34 (step t368 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t366 t367))
% 78.12/78.34 (step t369 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 78.12/78.34 (step t370 (cl (= (= tptp.nil (tptp.app tptp.nil tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule refl)
% 78.12/78.34 (step t371 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule cong :premises (t368 t368 t369 t369 t370))
% 78.12/78.34 (step t372 (cl (= (or false false (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule all_simplify)
% 78.12/78.34 (step t373 (cl (= (or (not (= tptp.nil tptp.nil)) (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t371 t372))
% 78.12/78.34 (step t374 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil (tptp.app U V)))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t364 t373))
% 78.12/78.34 (step t375 (cl (= (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))) (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))))) :rule trans :premises (t363 t374))
% 78.12/78.34 (step t376 (cl (or (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil)))) :rule resolution :premises (t362 t375 a144))
% 78.12/78.34 (step t377 (cl (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule or :premises (t376))
% 78.12/78.34 (step t378 (cl (= tptp.nil (tptp.app tptp.nil tptp.nil))) :rule resolution :premises (t377 a7))
% 78.12/78.34 (step t379 (cl) :rule resolution :premises (t76 t107 t317 t331 t350 t263 t361 t378))
% 78.12/78.34
% 78.16/78.35 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.RPaAVeVQlu/cvc5---1.0.5_23054.smt2
% 78.16/78.35 % cvc5---1.0.5 exiting
% 78.16/78.36 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------