%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWC081-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n014.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:16 EDT 2024

% Result   : Unsatisfiable 1.06s 1.28s
% Output   : Proof 1.13s
% Verified : 
% SZS Type : -

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