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