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