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