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

% Computer : n028.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:14 EDT 2024

% Result   : Unsatisfiable 2.05s 2.25s
% Output   : Proof 2.05s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem    : SWC076-1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n028.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sun May 26 17:07:39 EDT 2024
% 0.22/0.37  % CPUTime    : 
% 0.38/0.55  %----Proving TF0_NAR, FOF, or CNF
% 0.38/0.56  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 2.05/2.25  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.yGTBbXxsHT/cvc5---1.0.5_20709.smt2
% 2.05/2.25  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.yGTBbXxsHT/cvc5---1.0.5_20709.smt2
% 2.05/2.27  (assume a0 (tptp.equalelemsP tptp.nil))
% 2.05/2.27  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 2.05/2.27  (assume a2 (tptp.strictorderedP tptp.nil))
% 2.05/2.27  (assume a3 (tptp.totalorderedP tptp.nil))
% 2.05/2.27  (assume a4 (tptp.strictorderP tptp.nil))
% 2.05/2.27  (assume a5 (tptp.totalorderP tptp.nil))
% 2.05/2.27  (assume a6 (tptp.cyclefreeP tptp.nil))
% 2.05/2.27  (assume a7 (tptp.ssList tptp.nil))
% 2.05/2.27  (assume a8 (tptp.ssItem tptp.skac3))
% 2.05/2.27  (assume a9 (tptp.ssItem tptp.skac2))
% 2.05/2.27  (assume a10 (not (tptp.singletonP tptp.nil)))
% 2.05/2.27  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 2.05/2.27  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 2.05/2.27  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 2.05/2.27  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 2.05/2.27  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 2.05/2.27  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 2.05/2.27  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 2.05/2.27  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 2.05/2.27  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 2.05/2.27  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 2.05/2.27  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 2.05/2.27  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 2.05/2.27  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 2.05/2.27  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 2.05/2.27  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 2.05/2.27  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 2.05/2.27  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 2.05/2.27  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 2.05/2.27  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 2.05/2.27  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 2.05/2.27  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 2.05/2.27  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 2.05/2.27  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 2.05/2.27  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 2.05/2.27  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 2.05/2.27  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 2.05/2.27  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 2.05/2.27  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 2.05/2.27  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 2.05/2.27  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 2.05/2.27  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 2.05/2.27  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 2.05/2.27  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 2.05/2.27  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 2.05/2.27  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 2.05/2.27  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 2.05/2.27  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 2.05/2.27  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 2.05/2.27  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 2.05/2.27  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 2.05/2.27  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 2.05/2.27  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 2.05/2.27  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 2.05/2.27  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 2.05/2.27  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 2.05/2.27  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 2.05/2.27  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 2.05/2.27  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 2.05/2.27  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 2.05/2.27  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 2.05/2.27  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 2.05/2.27  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 2.05/2.27  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 2.05/2.27  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 2.05/2.27  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 2.05/2.27  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 2.05/2.27  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 2.05/2.27  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 2.05/2.27  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 2.05/2.27  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 2.05/2.27  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 2.05/2.27  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 2.05/2.27  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 2.05/2.27  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.05/2.27  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.05/2.27  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 2.05/2.27  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 2.05/2.27  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 2.05/2.27  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.05/2.27  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 2.05/2.27  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.05/2.27  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 2.05/2.27  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.05/2.27  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 2.05/2.27  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 2.05/2.27  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 2.05/2.27  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 2.05/2.27  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 2.05/2.27  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 2.05/2.27  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 2.05/2.27  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.05/2.27  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 2.05/2.27  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.05/2.27  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 2.05/2.27  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 2.05/2.27  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 2.05/2.27  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.05/2.27  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 2.05/2.27  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 2.05/2.27  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 2.05/2.27  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 2.05/2.27  (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))))
% 2.05/2.27  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 2.05/2.27  (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))))
% 2.05/2.27  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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))))
% 2.05/2.27  (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)))))
% 2.05/2.27  (assume a185 (tptp.ssList tptp.sk1))
% 2.05/2.27  (assume a186 (tptp.ssList tptp.sk2))
% 2.05/2.27  (assume a187 (tptp.ssList tptp.sk3))
% 2.05/2.27  (assume a188 (tptp.ssList tptp.sk4))
% 2.05/2.27  (assume a189 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume a190 (= tptp.sk1 tptp.sk3))
% 2.05/2.27  (assume a191 (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)))))
% 2.05/2.27  (assume a192 (tptp.ssList tptp.sk5))
% 2.05/2.27  (assume a193 (tptp.ssList tptp.sk6))
% 2.05/2.27  (assume a194 (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4))
% 2.05/2.27  (assume a195 (tptp.equalelemsP tptp.sk3))
% 2.05/2.27  (assume a196 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app B (tptp.cons A tptp.nil)) tptp.sk5)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.cons A tptp.nil) C) tptp.sk3)))))
% 2.05/2.27  (assume a197 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssItem A)) (not (tptp.ssList B)) (not (= (tptp.app (tptp.cons A tptp.nil) B) tptp.sk6)) (not (tptp.ssList C)) (not (= (tptp.app C (tptp.cons A tptp.nil)) tptp.sk3)))))
% 2.05/2.27  (assume a198 (or (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))))
% 2.05/2.27  (assume a199 (or (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk1))))
% 2.05/2.27  (step t1 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t2)
% 2.05/2.27  (assume t2.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 2.05/2.27  (step t2.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk1)))
% 2.05/2.27  (step t2.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule or :premises (t2.t1))
% 2.05/2.27  (step t2.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t2.t2 t2.a0))
% 2.05/2.27  (step t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule subproof :discharge (t2.a0))
% 2.05/2.27  (step t3 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule resolution :premises (t1 t2))
% 2.05/2.27  (step t4 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 2.05/2.27  (step t5 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t3 t4))
% 2.05/2.27  (step t6 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule contraction :premises (t5))
% 2.05/2.27  (step t7 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) :rule implies :premises (t6))
% 2.05/2.27  (step t8 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)) :rule or_pos)
% 2.05/2.27  (step t9 (cl (= tptp.nil tptp.sk1) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule reordering :premises (t8))
% 2.05/2.27  (step t10 (cl (not (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk1))))) (not (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1)))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk1)))) :rule equiv_pos2)
% 2.05/2.27  (step t11 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 2.05/2.27  (step t12 (cl (= (= (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) true) (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 2.05/2.27  (step t13 (cl (not (= (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) true)) (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3))) :rule equiv1 :premises (t12))
% 2.05/2.27  (step t14 (cl (= (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) (= (= tptp.nil tptp.sk3) (not (not (= tptp.nil tptp.sk3)))))) :rule all_simplify)
% 2.05/2.27  (step t15 (cl (= (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) :rule refl)
% 2.05/2.27  (step t16 (cl (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3))) :rule all_simplify)
% 2.05/2.27  (step t17 (cl (= (= (= tptp.nil tptp.sk3) (not (not (= tptp.nil tptp.sk3)))) (= (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule cong :premises (t15 t16))
% 2.05/2.27  (step t18 (cl (= (= (= tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)) true)) :rule all_simplify)
% 2.05/2.27  (step t19 (cl (= (= (= tptp.nil tptp.sk3) (not (not (= tptp.nil tptp.sk3)))) true)) :rule trans :premises (t17 t18))
% 2.05/2.27  (step t20 (cl (= (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) true)) :rule trans :premises (t14 t19))
% 2.05/2.27  (step t21 (cl (= (not (not (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t13 t20))
% 2.05/2.27  (step t22 (cl (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk1)))) :rule refl)
% 2.05/2.27  (step t23 (cl (= (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk1))))) :rule cong :premises (t11 t21 t22))
% 2.05/2.27  (step t24 (cl (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))) (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3)))) :rule and_neg)
% 2.05/2.27  (step t25 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t26)
% 2.05/2.27  (assume t26.a0 (= tptp.sk1 tptp.sk3))
% 2.05/2.27  (assume t26.a1 (not (= tptp.nil tptp.sk3)))
% 2.05/2.27  (step t26.t1 (cl (=> (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t26.t2)
% 2.05/2.27  (assume t26.t2.a0 (not (= tptp.nil tptp.sk3)))
% 2.05/2.27  (assume t26.t2.a1 (= tptp.sk1 tptp.sk3))
% 2.05/2.27  (step t26.t2.t1 (cl (= (= (= tptp.nil tptp.sk1) false) (not (= tptp.nil tptp.sk1)))) :rule equiv_simplify)
% 2.05/2.27  (step t26.t2.t2 (cl (not (= (= tptp.nil tptp.sk1) false)) (not (= tptp.nil tptp.sk1))) :rule equiv1 :premises (t26.t2.t1))
% 2.05/2.27  (step t26.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 2.05/2.27  (step t26.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t26.t2.a1))
% 2.05/2.27  (step t26.t2.t5 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t26.t2.t4))
% 2.05/2.27  (step t26.t2.t6 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t26.t2.t3 t26.t2.t5))
% 2.05/2.27  (step t26.t2.t7 (cl (= (= (= tptp.nil tptp.sk3) false) (not (= tptp.nil tptp.sk3)))) :rule equiv_simplify)
% 2.05/2.27  (step t26.t2.t8 (cl (= (= tptp.nil tptp.sk3) false) (not (not (= tptp.nil tptp.sk3)))) :rule equiv2 :premises (t26.t2.t7))
% 2.05/2.27  (step t26.t2.t9 (cl (not (not (not (= tptp.nil tptp.sk3)))) (= tptp.nil tptp.sk3)) :rule not_not)
% 2.05/2.27  (step t26.t2.t10 (cl (= (= tptp.nil tptp.sk3) false) (= tptp.nil tptp.sk3)) :rule resolution :premises (t26.t2.t8 t26.t2.t9))
% 2.05/2.27  (step t26.t2.t11 (cl (= (= tptp.nil tptp.sk3) false)) :rule resolution :premises (t26.t2.t10 t26.t2.a0))
% 2.05/2.27  (step t26.t2.t12 (cl (= (= tptp.nil tptp.sk1) false)) :rule trans :premises (t26.t2.t6 t26.t2.t11))
% 2.05/2.27  (step t26.t2.t13 (cl (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t26.t2.t2 t26.t2.t12))
% 2.05/2.27  (step t26.t2 (cl (not (not (= tptp.nil tptp.sk3))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) :rule subproof :discharge (t26.t2.a0 t26.t2.a1))
% 2.05/2.27  (step t26.t3 (cl (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk3))) :rule and_pos)
% 2.05/2.27  (step t26.t4 (cl (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t26.t5 (cl (not (= tptp.nil tptp.sk1)) (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t26.t2 t26.t3 t26.t4))
% 2.05/2.27  (step t26.t6 (cl (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t26.t5))
% 2.05/2.27  (step t26.t7 (cl (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule contraction :premises (t26.t6))
% 2.05/2.27  (step t26.t8 (cl (=> (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t26.t1 t26.t7))
% 2.05/2.27  (step t26.t9 (cl (=> (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 2.05/2.27  (step t26.t10 (cl (=> (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1))) (=> (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t26.t8 t26.t9))
% 2.05/2.27  (step t26.t11 (cl (=> (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk1)))) :rule contraction :premises (t26.t10))
% 2.05/2.27  (step t26.t12 (cl (not (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule implies :premises (t26.t11))
% 2.05/2.27  (step t26.t13 (cl (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 2.05/2.27  (step t26.t14 (cl (and (not (= tptp.nil tptp.sk3)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t26.t13 t26.a1 t26.a0))
% 2.05/2.27  (step t26.t15 (cl (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t26.t12 t26.t14))
% 2.05/2.27  (step t26 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule subproof :discharge (t26.a0 t26.a1))
% 2.05/2.27  (step t27 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t28 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) (not (= tptp.nil tptp.sk3))) :rule and_pos)
% 2.05/2.27  (step t29 (cl (not (= tptp.nil tptp.sk1)) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))))) :rule resolution :premises (t26 t27 t28))
% 2.05/2.27  (step t30 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) (not (= tptp.nil tptp.sk1))) :rule reordering :premises (t29))
% 2.05/2.27  (step t31 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) (not (= tptp.nil tptp.sk1))) :rule contraction :premises (t30))
% 2.05/2.27  (step t32 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t25 t31))
% 2.05/2.27  (step t33 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 2.05/2.27  (step t34 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t32 t33))
% 2.05/2.27  (step t35 (cl (=> (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1)))) :rule contraction :premises (t34))
% 2.05/2.27  (step t36 (cl (not (and (= tptp.sk1 tptp.sk3) (not (= tptp.nil tptp.sk3)))) (not (= tptp.nil tptp.sk1))) :rule implies :premises (t35))
% 2.05/2.27  (step t37 (cl (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t24 t36))
% 2.05/2.27  (step t38 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 2.05/2.27  (step t39 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (not (not (not (= tptp.nil tptp.sk3))))) :rule or_neg)
% 2.05/2.27  (step t40 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (not (not (= tptp.nil tptp.sk1)))) :rule or_neg)
% 2.05/2.27  (step t41 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1))) (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t37 t38 t39 t40))
% 2.05/2.27  (step t42 (cl (or (not (= tptp.sk1 tptp.sk3)) (not (not (= tptp.nil tptp.sk3))) (not (= tptp.nil tptp.sk1)))) :rule contraction :premises (t41))
% 2.05/2.27  (step t43 (cl (or (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk1)))) :rule resolution :premises (t10 t23 t42))
% 2.05/2.27  (step t44 (cl (not (= tptp.sk1 tptp.sk3)) (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk1))) :rule or :premises (t43))
% 2.05/2.27  (step t45 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk1)) (not (= tptp.sk1 tptp.sk3))) :rule reordering :premises (t44))
% 2.05/2.27  (step t46 (cl (= tptp.nil tptp.sk4) (not (= tptp.nil tptp.sk3))) :rule or :premises (a198))
% 2.05/2.27  (step t47 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4)))) :rule equiv_pos2)
% 2.05/2.27  (step t48 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 2.05/2.27  (step t49 (cl (= (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true) (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule equiv_simplify)
% 2.05/2.27  (step t50 (cl (not (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true)) (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule equiv1 :premises (t49))
% 2.05/2.27  (step t51 (cl (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))))) :rule all_simplify)
% 2.05/2.27  (step t52 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule refl)
% 2.05/2.27  (step t53 (cl (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule all_simplify)
% 2.05/2.27  (step t54 (cl (= (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))) (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)))) :rule cong :premises (t52 t53))
% 2.05/2.27  (step t55 (cl (= (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)) true)) :rule all_simplify)
% 2.05/2.27  (step t56 (cl (= (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))) true)) :rule trans :premises (t54 t55))
% 2.05/2.27  (step t57 (cl (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true)) :rule trans :premises (t51 t56))
% 2.05/2.27  (step t58 (cl (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t50 t57))
% 2.05/2.27  (step t59 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 2.05/2.27  (step t60 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))))) :rule cong :premises (t48 t58 t59))
% 2.05/2.27  (step t61 (cl (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2)))) :rule and_neg)
% 2.05/2.27  (step t62 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t63)
% 2.05/2.27  (assume t63.a0 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume t63.a1 (not (= tptp.nil tptp.sk2)))
% 2.05/2.27  (step t63.t1 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t63.t2)
% 2.05/2.27  (assume t63.t2.a0 (not (= tptp.nil tptp.sk2)))
% 2.05/2.27  (assume t63.t2.a1 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (step t63.t2.t1 (cl (= (= (= tptp.nil tptp.sk4) false) (not (= tptp.nil tptp.sk4)))) :rule equiv_simplify)
% 2.05/2.27  (step t63.t2.t2 (cl (not (= (= tptp.nil tptp.sk4) false)) (not (= tptp.nil tptp.sk4))) :rule equiv1 :premises (t63.t2.t1))
% 2.05/2.27  (step t63.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 2.05/2.27  (step t63.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t63.t2.a1))
% 2.05/2.27  (step t63.t2.t5 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk2))) :rule cong :premises (t63.t2.t3 t63.t2.t4))
% 2.05/2.27  (step t63.t2.t6 (cl (= (= (= tptp.nil tptp.sk2) false) (not (= tptp.nil tptp.sk2)))) :rule equiv_simplify)
% 2.05/2.27  (step t63.t2.t7 (cl (= (= tptp.nil tptp.sk2) false) (not (not (= tptp.nil tptp.sk2)))) :rule equiv2 :premises (t63.t2.t6))
% 2.05/2.27  (step t63.t2.t8 (cl (not (not (not (= tptp.nil tptp.sk2)))) (= tptp.nil tptp.sk2)) :rule not_not)
% 2.05/2.27  (step t63.t2.t9 (cl (= (= tptp.nil tptp.sk2) false) (= tptp.nil tptp.sk2)) :rule resolution :premises (t63.t2.t7 t63.t2.t8))
% 2.05/2.27  (step t63.t2.t10 (cl (= (= tptp.nil tptp.sk2) false)) :rule resolution :premises (t63.t2.t9 t63.t2.a0))
% 2.05/2.27  (step t63.t2.t11 (cl (= (= tptp.nil tptp.sk4) false)) :rule trans :premises (t63.t2.t5 t63.t2.t10))
% 2.05/2.27  (step t63.t2.t12 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t63.t2.t2 t63.t2.t11))
% 2.05/2.27  (step t63.t2 (cl (not (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule subproof :discharge (t63.t2.a0 t63.t2.a1))
% 2.05/2.27  (step t63.t3 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule and_pos)
% 2.05/2.27  (step t63.t4 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t63.t5 (cl (not (= tptp.nil tptp.sk4)) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t63.t2 t63.t3 t63.t4))
% 2.05/2.27  (step t63.t6 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t63.t5))
% 2.05/2.27  (step t63.t7 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t63.t6))
% 2.05/2.27  (step t63.t8 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t63.t1 t63.t7))
% 2.05/2.27  (step t63.t9 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 2.05/2.27  (step t63.t10 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t63.t8 t63.t9))
% 2.05/2.27  (step t63.t11 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t63.t10))
% 2.05/2.27  (step t63.t12 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule implies :premises (t63.t11))
% 2.05/2.27  (step t63.t13 (cl (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 2.05/2.27  (step t63.t14 (cl (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t63.t13 t63.a1 t63.a0))
% 2.05/2.27  (step t63.t15 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t63.t12 t63.t14))
% 2.05/2.27  (step t63 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) :rule subproof :discharge (t63.a0 t63.a1))
% 2.05/2.27  (step t64 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t65 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk2))) :rule and_pos)
% 2.05/2.27  (step t66 (cl (not (= tptp.nil tptp.sk4)) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))))) :rule resolution :premises (t63 t64 t65))
% 2.05/2.27  (step t67 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t66))
% 2.05/2.27  (step t68 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t67))
% 2.05/2.27  (step t69 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t62 t68))
% 2.05/2.27  (step t70 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 2.05/2.27  (step t71 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t69 t70))
% 2.05/2.27  (step t72 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t71))
% 2.05/2.27  (step t73 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule implies :premises (t72))
% 2.05/2.27  (step t74 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t61 t73))
% 2.05/2.27  (step t75 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 2.05/2.27  (step t76 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (not (= tptp.nil tptp.sk2))))) :rule or_neg)
% 2.05/2.27  (step t77 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 2.05/2.27  (step t78 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t74 t75 t76 t77))
% 2.05/2.27  (step t79 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t78))
% 2.05/2.27  (step t80 (cl (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t47 t60 t79))
% 2.05/2.27  (step t81 (cl (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))) :rule or :premises (t80))
% 2.05/2.27  (step t82 (cl (= tptp.nil tptp.sk2) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t81))
% 2.05/2.27  (step t83 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk2)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule and_neg)
% 2.05/2.27  (step t84 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t85)
% 2.05/2.27  (assume t85.a0 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume t85.a1 (= tptp.sk1 tptp.sk3))
% 2.05/2.27  (assume t85.a2 (= tptp.nil tptp.sk2))
% 2.05/2.27  (assume t85.a3 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 2.05/2.27  (assume t85.a4 (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))
% 2.05/2.27  (step t85.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t85.t2)
% 2.05/2.27  (assume t85.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))
% 2.05/2.27  (assume t85.t2.a1 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 2.05/2.27  (assume t85.t2.a2 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume t85.t2.a3 (= tptp.nil tptp.sk2))
% 2.05/2.27  (assume t85.t2.a4 (= tptp.sk1 tptp.sk3))
% 2.05/2.27  (step t85.t2.t1 (cl (= (= (tptp.segmentP tptp.nil tptp.sk1) true) (tptp.segmentP tptp.nil tptp.sk1))) :rule equiv_simplify)
% 2.05/2.27  (step t85.t2.t2 (cl (not (= (tptp.segmentP tptp.nil tptp.sk1) true)) (tptp.segmentP tptp.nil tptp.sk1)) :rule equiv1 :premises (t85.t2.t1))
% 2.05/2.27  (step t85.t2.t3 (cl (= tptp.sk2 tptp.nil)) :rule symm :premises (t85.t2.a3))
% 2.05/2.27  (step t85.t2.t4 (cl (= tptp.nil tptp.sk2)) :rule symm :premises (t85.t2.t3))
% 2.05/2.27  (step t85.t2.t5 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t85.t2.a2))
% 2.05/2.27  (step t85.t2.t6 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t85.t2.t5))
% 2.05/2.27  (step t85.t2.t7 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4)) :rule symm :premises (t85.t2.a1))
% 2.05/2.27  (step t85.t2.t8 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t85.t2.t7))
% 2.05/2.27  (step t85.t2.t9 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t85.t2.t6 t85.t2.t8))
% 2.05/2.27  (step t85.t2.t10 (cl (= tptp.nil (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t85.t2.t4 t85.t2.t9))
% 2.05/2.27  (step t85.t2.t11 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t85.t2.a4))
% 2.05/2.27  (step t85.t2.t12 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t85.t2.t11))
% 2.05/2.27  (step t85.t2.t13 (cl (= (tptp.segmentP tptp.nil tptp.sk1) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule cong :premises (t85.t2.t10 t85.t2.t12))
% 2.05/2.27  (step t85.t2.t14 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) true) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule equiv_simplify)
% 2.05/2.27  (step t85.t2.t15 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule equiv2 :premises (t85.t2.t14))
% 2.05/2.27  (step t85.t2.t16 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) true)) :rule resolution :premises (t85.t2.t15 t85.t2.a0))
% 2.05/2.27  (step t85.t2.t17 (cl (= (tptp.segmentP tptp.nil tptp.sk1) true)) :rule trans :premises (t85.t2.t13 t85.t2.t16))
% 2.05/2.27  (step t85.t2.t18 (cl (tptp.segmentP tptp.nil tptp.sk1)) :rule resolution :premises (t85.t2.t2 t85.t2.t17))
% 2.05/2.27  (step t85.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) :rule subproof :discharge (t85.t2.a0 t85.t2.a1 t85.t2.a2 t85.t2.a3 t85.t2.a4))
% 2.05/2.27  (step t85.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t85.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 2.05/2.27  (step t85.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t85.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 2.05/2.27  (step t85.t7 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t85.t8 (cl (tptp.segmentP tptp.nil tptp.sk1) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t85.t2 t85.t3 t85.t4 t85.t5 t85.t6 t85.t7))
% 2.05/2.27  (step t85.t9 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk1)) :rule reordering :premises (t85.t8))
% 2.05/2.27  (step t85.t10 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk1)) :rule contraction :premises (t85.t9))
% 2.05/2.27  (step t85.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (tptp.segmentP tptp.nil tptp.sk1)) :rule resolution :premises (t85.t1 t85.t10))
% 2.05/2.27  (step t85.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.segmentP tptp.nil tptp.sk1))) :rule implies_neg2)
% 2.05/2.27  (step t85.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1))) :rule resolution :premises (t85.t11 t85.t12))
% 2.05/2.27  (step t85.t14 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1))) :rule contraction :premises (t85.t13))
% 2.05/2.27  (step t85.t15 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk1)) :rule implies :premises (t85.t14))
% 2.05/2.27  (step t85.t16 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 2.05/2.27  (step t85.t17 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t85.t16 t85.a4 t85.a3 t85.a0 t85.a2 t85.a1))
% 2.05/2.27  (step t85.t18 (cl (tptp.segmentP tptp.nil tptp.sk1)) :rule resolution :premises (t85.t15 t85.t17))
% 2.05/2.27  (step t85 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk2)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) :rule subproof :discharge (t85.a0 t85.a1 t85.a2 t85.a3 t85.a4))
% 2.05/2.27  (step t86 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t87 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t88 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 2.05/2.27  (step t89 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 2.05/2.27  (step t90 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t91 (cl (tptp.segmentP tptp.nil tptp.sk1) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t85 t86 t87 t88 t89 t90))
% 2.05/2.27  (step t92 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk1)) :rule reordering :premises (t91))
% 2.05/2.27  (step t93 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk1)) :rule contraction :premises (t92))
% 2.05/2.27  (step t94 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (tptp.segmentP tptp.nil tptp.sk1)) :rule resolution :premises (t84 t93))
% 2.05/2.27  (step t95 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.segmentP tptp.nil tptp.sk1))) :rule implies_neg2)
% 2.05/2.27  (step t96 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1))) :rule resolution :premises (t94 t95))
% 2.05/2.27  (step t97 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1))) :rule contraction :premises (t96))
% 2.05/2.27  (step t98 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.nil tptp.sk2) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP tptp.nil tptp.sk1)) :rule implies :premises (t97))
% 2.05/2.27  (step t99 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.nil tptp.sk2)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.nil tptp.sk1)) :rule resolution :premises (t83 t98))
% 2.05/2.27  (step t100 (cl (not (= tptp.nil tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP tptp.nil tptp.sk1) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule reordering :premises (t99))
% 2.05/2.27  (step t101 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) :rule or_pos)
% 2.05/2.27  (step t102 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule reordering :premises (t101))
% 2.05/2.27  (step t103 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule and_neg)
% 2.05/2.27  (step t104 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t105)
% 2.05/2.27  (assume t105.a0 (tptp.ssList tptp.sk2))
% 2.05/2.27  (assume t105.a1 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume t105.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 2.05/2.27  (step t105.t1 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t105.t2)
% 2.05/2.27  (assume t105.t2.a0 (tptp.ssList tptp.sk2))
% 2.05/2.27  (assume t105.t2.a1 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume t105.t2.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 2.05/2.27  (step t105.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) true) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule equiv_simplify)
% 2.05/2.27  (step t105.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) true)) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule equiv1 :premises (t105.t2.t1))
% 2.05/2.27  (step t105.t2.t3 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4)) :rule symm :premises (t105.t2.a2))
% 2.05/2.27  (step t105.t2.t4 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t105.t2.t3))
% 2.05/2.27  (step t105.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4)) :rule symm :premises (t105.t2.t4))
% 2.05/2.27  (step t105.t2.t6 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t105.t2.a1))
% 2.05/2.27  (step t105.t2.t7 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t105.t2.t6))
% 2.05/2.27  (step t105.t2.t8 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t105.t2.t7))
% 2.05/2.27  (step t105.t2.t9 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk2)) :rule trans :premises (t105.t2.t5 t105.t2.t8))
% 2.05/2.27  (step t105.t2.t10 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.ssList tptp.sk2))) :rule cong :premises (t105.t2.t9))
% 2.05/2.27  (step t105.t2.t11 (cl (= (= (tptp.ssList tptp.sk2) true) (tptp.ssList tptp.sk2))) :rule equiv_simplify)
% 2.05/2.27  (step t105.t2.t12 (cl (= (tptp.ssList tptp.sk2) true) (not (tptp.ssList tptp.sk2))) :rule equiv2 :premises (t105.t2.t11))
% 2.05/2.27  (step t105.t2.t13 (cl (= (tptp.ssList tptp.sk2) true)) :rule resolution :premises (t105.t2.t12 t105.t2.a0))
% 2.05/2.27  (step t105.t2.t14 (cl (= (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) true)) :rule trans :premises (t105.t2.t10 t105.t2.t13))
% 2.05/2.27  (step t105.t2.t15 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t105.t2.t2 t105.t2.t14))
% 2.05/2.27  (step t105.t2 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule subproof :discharge (t105.t2.a0 t105.t2.a1 t105.t2.a2))
% 2.05/2.27  (step t105.t3 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 2.05/2.27  (step t105.t4 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t105.t5 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 2.05/2.27  (step t105.t6 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule resolution :premises (t105.t2 t105.t3 t105.t4 t105.t5))
% 2.05/2.27  (step t105.t7 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule reordering :premises (t105.t6))
% 2.05/2.27  (step t105.t8 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule contraction :premises (t105.t7))
% 2.05/2.27  (step t105.t9 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t105.t1 t105.t8))
% 2.05/2.27  (step t105.t10 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg2)
% 2.05/2.27  (step t105.t11 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t105.t9 t105.t10))
% 2.05/2.27  (step t105.t12 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule contraction :premises (t105.t11))
% 2.05/2.27  (step t105.t13 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule implies :premises (t105.t12))
% 2.05/2.27  (step t105.t14 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule and_neg)
% 2.05/2.27  (step t105.t15 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t105.t14 t105.a0 t105.a1 t105.a2))
% 2.05/2.27  (step t105.t16 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t105.t13 t105.t15))
% 2.05/2.27  (step t105 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule subproof :discharge (t105.a0 t105.a1 t105.a2))
% 2.05/2.27  (step t106 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 2.05/2.27  (step t107 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t108 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 2.05/2.27  (step t109 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))))) :rule resolution :premises (t105 t106 t107 t108))
% 2.05/2.27  (step t110 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule reordering :premises (t109))
% 2.05/2.27  (step t111 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule contraction :premises (t110))
% 2.05/2.27  (step t112 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t104 t111))
% 2.05/2.27  (step t113 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule implies_neg2)
% 2.05/2.27  (step t114 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule resolution :premises (t112 t113))
% 2.05/2.27  (step t115 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) :rule contraction :premises (t114))
% 2.05/2.27  (step t116 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule implies :premises (t115))
% 2.05/2.27  (step t117 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t103 t116))
% 2.05/2.27  (step t118 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (a194))
% 2.05/2.27  (step t119 (cl (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule resolution :premises (t117 a186 a189 t118))
% 2.05/2.27  (step t120 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t121)
% 2.05/2.27  (assume t121.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))
% 2.05/2.27  (step t121.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk3) (:= W tptp.sk6)))
% 2.05/2.27  (step t121.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule or :premises (t121.t1))
% 2.05/2.27  (step t121.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t121.t2 t121.a0))
% 2.05/2.27  (step t121 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule subproof :discharge (t121.a0))
% 2.05/2.27  (step t122 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t120 t121))
% 2.05/2.27  (step t123 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule implies_neg2)
% 2.05/2.27  (step t124 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t122 t123))
% 2.05/2.27  (step t125 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule contraction :premises (t124))
% 2.05/2.27  (step t126 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule implies :premises (t125))
% 2.05/2.27  (step t127 (cl (not (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V)))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule equiv_pos2)
% 2.05/2.27  (anchor :step t128 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 2.05/2.27  (step t128.t1 (cl (= U U)) :rule refl)
% 2.05/2.27  (step t128.t2 (cl (= V V)) :rule refl)
% 2.05/2.27  (step t128.t3 (cl (= W W)) :rule refl)
% 2.05/2.27  (step t128.t4 (cl (= X X)) :rule refl)
% 2.05/2.27  (step t128.t5 (cl (= (= (tptp.app (tptp.app U V) W) X) (= X (tptp.app (tptp.app U V) W)))) :rule all_simplify)
% 2.05/2.27  (step t128.t6 (cl (= (not (= (tptp.app (tptp.app U V) W) X)) (not (= X (tptp.app (tptp.app U V) W))))) :rule cong :premises (t128.t5))
% 2.05/2.27  (step t128.t7 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.05/2.27  (step t128.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.05/2.27  (step t128.t9 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.05/2.27  (step t128.t10 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 2.05/2.27  (step t128.t11 (cl (= (tptp.segmentP X V) (tptp.segmentP X V))) :rule refl)
% 2.05/2.27  (step t128.t12 (cl (= (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V)))) :rule cong :premises (t128.t6 t128.t7 t128.t8 t128.t9 t128.t10 t128.t11))
% 2.05/2.27  (step t128 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))) :rule bind)
% 2.05/2.27  (step t129 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule all_simplify)
% 2.05/2.27  (anchor :step t130 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 2.05/2.27  (step t130.t1 (cl (= U U)) :rule refl)
% 2.05/2.27  (step t130.t2 (cl (= V V)) :rule refl)
% 2.05/2.27  (step t130.t3 (cl (= W W)) :rule refl)
% 2.05/2.27  (step t130.t4 (cl (= (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W)) true)) :rule all_simplify)
% 2.05/2.27  (step t130.t5 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not true))) :rule cong :premises (t130.t4))
% 2.05/2.27  (step t130.t6 (cl (= (not true) false)) :rule all_simplify)
% 2.05/2.27  (step t130.t7 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) false)) :rule trans :premises (t130.t5 t130.t6))
% 2.05/2.27  (step t130.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 2.05/2.27  (step t130.t9 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.05/2.27  (step t130.t10 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.05/2.27  (step t130.t11 (cl (= (not (tptp.ssList (tptp.app (tptp.app U V) W))) (not (tptp.ssList (tptp.app (tptp.app U V) W))))) :rule refl)
% 2.05/2.27  (step t130.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app U V) W) V) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) :rule refl)
% 2.05/2.27  (step t130.t13 (cl (= (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule cong :premises (t130.t7 t130.t8 t130.t9 t130.t10 t130.t11 t130.t12))
% 2.05/2.27  (step t130.t14 (cl (= (or false (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule all_simplify)
% 2.05/2.27  (step t130.t15 (cl (= (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule trans :premises (t130.t13 t130.t14))
% 2.05/2.27  (step t130 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule bind)
% 2.05/2.27  (step t131 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= X (tptp.app (tptp.app U V) W))) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule trans :premises (t129 t130))
% 2.05/2.27  (step t132 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))))) :rule trans :premises (t128 t131))
% 2.05/2.27  (step t133 (cl (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) :rule resolution :premises (t127 t132 a172))
% 2.05/2.27  (step t134 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk5)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule resolution :premises (t126 t133))
% 2.05/2.27  (step t135 (cl (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) :rule resolution :premises (t102 a187 a192 a193 t119 t134))
% 2.05/2.27  (step t136 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (a194))
% 2.05/2.27  (step t137 (cl (not (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)) :rule or_pos)
% 2.05/2.27  (step t138 (cl (= tptp.nil tptp.sk1) (not (tptp.ssList tptp.sk1)) (not (tptp.segmentP tptp.nil tptp.sk1)) (not (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule reordering :premises (t137))
% 2.05/2.27  (step t139 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t140)
% 2.05/2.27  (assume t140.a0 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 2.05/2.27  (step t140.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.05/2.27  (step t140.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule or :premises (t140.t1))
% 2.05/2.27  (step t140.t3 (cl (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule resolution :premises (t140.t2 t140.a0))
% 2.05/2.27  (step t140 (cl (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule subproof :discharge (t140.a0))
% 2.05/2.27  (step t141 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule resolution :premises (t139 t140))
% 2.05/2.27  (step t142 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (not (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule implies_neg2)
% 2.05/2.27  (step t143 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t141 t142))
% 2.05/2.27  (step t144 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1)))) :rule contraction :premises (t143))
% 2.05/2.27  (step t145 (cl (not (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule implies :premises (t144))
% 2.05/2.27  (step t146 (cl (or (not (tptp.segmentP tptp.nil tptp.sk1)) (not (tptp.ssList tptp.sk1)) (= tptp.nil tptp.sk1))) :rule resolution :premises (t145 a79))
% 2.05/2.27  (step t147 (cl (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk1))) :rule or :premises (a199))
% 2.05/2.27  (step t148 (cl (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t100 t135 t136 a190 a189 t138 t146 a185 t147))
% 2.05/2.27  (step t149 (cl (not (= tptp.nil tptp.sk2))) :rule contraction :premises (t148))
% 2.05/2.27  (step t150 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t82 t149 a189))
% 2.05/2.27  (step t151 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t46 t150))
% 2.05/2.27  (step t152 (cl (not (= tptp.nil tptp.sk1))) :rule resolution :premises (t45 t151 a190))
% 2.05/2.27  (step t153 (cl (not (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1))) :rule or_pos)
% 2.05/2.27  (step t154 (cl (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule reordering :premises (t153))
% 2.05/2.27  (step t155 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule and_neg)
% 2.05/2.27  (step t156 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t157)
% 2.05/2.27  (assume t157.a0 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume t157.a1 (= tptp.sk1 tptp.sk3))
% 2.05/2.27  (assume t157.a2 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 2.05/2.27  (assume t157.a3 (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))
% 2.05/2.27  (step t157.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t157.t2)
% 2.05/2.27  (assume t157.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))
% 2.05/2.27  (assume t157.t2.a1 (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)))
% 2.05/2.27  (assume t157.t2.a2 (= tptp.sk2 tptp.sk4))
% 2.05/2.27  (assume t157.t2.a3 (= tptp.sk1 tptp.sk3))
% 2.05/2.27  (step t157.t2.t1 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk1) true) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule equiv_simplify)
% 2.05/2.27  (step t157.t2.t2 (cl (not (= (tptp.segmentP tptp.sk2 tptp.sk1) true)) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule equiv1 :premises (t157.t2.t1))
% 2.05/2.27  (step t157.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t157.t2.a2))
% 2.05/2.27  (step t157.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t157.t2.t3))
% 2.05/2.27  (step t157.t2.t5 (cl (= (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk4)) :rule symm :premises (t157.t2.a1))
% 2.05/2.27  (step t157.t2.t6 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule symm :premises (t157.t2.t5))
% 2.05/2.27  (step t157.t2.t7 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule trans :premises (t157.t2.t4 t157.t2.t6))
% 2.05/2.27  (step t157.t2.t8 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t157.t2.a3))
% 2.05/2.27  (step t157.t2.t9 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t157.t2.t8))
% 2.05/2.27  (step t157.t2.t10 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule cong :premises (t157.t2.t7 t157.t2.t9))
% 2.05/2.27  (step t157.t2.t11 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) true) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule equiv_simplify)
% 2.05/2.27  (step t157.t2.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule equiv2 :premises (t157.t2.t11))
% 2.05/2.27  (step t157.t2.t13 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) true)) :rule resolution :premises (t157.t2.t12 t157.t2.a0))
% 2.05/2.27  (step t157.t2.t14 (cl (= (tptp.segmentP tptp.sk2 tptp.sk1) true)) :rule trans :premises (t157.t2.t10 t157.t2.t13))
% 2.05/2.27  (step t157.t2.t15 (cl (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t157.t2.t2 t157.t2.t14))
% 2.05/2.27  (step t157.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule subproof :discharge (t157.t2.a0 t157.t2.a1 t157.t2.a2 t157.t2.a3))
% 2.05/2.27  (step t157.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t157.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 2.05/2.27  (step t157.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t157.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t157.t7 (cl (tptp.segmentP tptp.sk2 tptp.sk1) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t157.t2 t157.t3 t157.t4 t157.t5 t157.t6))
% 2.05/2.27  (step t157.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule reordering :premises (t157.t7))
% 2.05/2.27  (step t157.t9 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule contraction :premises (t157.t8))
% 2.05/2.27  (step t157.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t157.t1 t157.t9))
% 2.05/2.27  (step t157.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk2 tptp.sk1))) :rule implies_neg2)
% 2.05/2.27  (step t157.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule resolution :premises (t157.t10 t157.t11))
% 2.05/2.27  (step t157.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule contraction :premises (t157.t12))
% 2.05/2.27  (step t157.t14 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule implies :premises (t157.t13))
% 2.05/2.27  (step t157.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 2.05/2.27  (step t157.t16 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t157.t15 t157.a3 t157.a2 t157.a0 t157.a1))
% 2.05/2.27  (step t157.t17 (cl (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t157.t14 t157.t16))
% 2.05/2.27  (step t157 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule subproof :discharge (t157.a0 t157.a1 t157.a2 t157.a3))
% 2.05/2.27  (step t158 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 2.05/2.27  (step t159 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t160 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) :rule and_pos)
% 2.05/2.27  (step t161 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) :rule and_pos)
% 2.05/2.27  (step t162 (cl (tptp.segmentP tptp.sk2 tptp.sk1) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)))) :rule resolution :premises (t157 t158 t159 t160 t161))
% 2.05/2.27  (step t163 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule reordering :premises (t162))
% 2.05/2.27  (step t164 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule contraction :premises (t163))
% 2.05/2.27  (step t165 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t156 t164))
% 2.05/2.27  (step t166 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk2 tptp.sk1))) :rule implies_neg2)
% 2.05/2.27  (step t167 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule resolution :premises (t165 t166))
% 2.05/2.27  (step t168 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1))) :rule contraction :premises (t167))
% 2.05/2.27  (step t169 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule implies :premises (t168))
% 2.05/2.27  (step t170 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t155 t169))
% 2.05/2.27  (step t171 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6))) (tptp.segmentP tptp.sk2 tptp.sk1) (not (tptp.segmentP (tptp.app (tptp.app tptp.sk5 tptp.sk3) tptp.sk6) tptp.sk3))) :rule reordering :premises (t170))
% 2.05/2.27  (step t172 (cl (tptp.segmentP tptp.sk2 tptp.sk1)) :rule resolution :premises (t171 a189 a190 t118 t135))
% 2.05/2.27  (step t173 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule or_pos)
% 2.05/2.27  (step t174 (cl (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule reordering :premises (t173))
% 2.05/2.27  (step t175 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t176)
% 2.05/2.27  (assume t176.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 2.05/2.27  (step t176.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 2.05/2.27  (step t176.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule or :premises (t176.t1))
% 2.05/2.27  (step t176.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t176.t2 t176.a0))
% 2.05/2.27  (step t176 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule subproof :discharge (t176.a0))
% 2.05/2.27  (step t177 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t175 t176))
% 2.05/2.27  (step t178 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule implies_neg2)
% 2.05/2.27  (step t179 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t177 t178))
% 2.05/2.27  (step t180 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule contraction :premises (t179))
% 2.05/2.27  (step t181 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule implies :premises (t180))
% 2.05/2.27  (step t182 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t181 a56))
% 2.05/2.27  (step t183 (cl (tptp.segmentP tptp.sk1 tptp.sk1)) :rule resolution :premises (t174 a185 t182))
% 2.05/2.27  (step t184 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) :rule implies_neg1)
% 2.05/2.27  (anchor :step t185)
% 2.05/2.27  (assume t185.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)))))
% 2.05/2.27  (step t185.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule forall_inst :args ((:= A tptp.sk1)))
% 2.05/2.27  (step t185.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule or :premises (t185.t1))
% 2.05/2.27  (step t185.t3 (cl (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t185.t2 t185.a0))
% 2.05/2.27  (step t185 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule subproof :discharge (t185.a0))
% 2.05/2.27  (step t186 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t184 t185))
% 2.05/2.27  (step t187 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) (not (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule implies_neg2)
% 2.05/2.27  (step t188 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule resolution :premises (t186 t187))
% 2.05/2.27  (step t189 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1))))) :rule contraction :premises (t188))
% 2.05/2.27  (step t190 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule implies :premises (t189))
% 2.05/2.27  (step t191 (cl (or (not (tptp.ssList tptp.sk1)) (not (tptp.neq tptp.sk1 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk1)) (not (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t190 a191))
% 2.05/2.27  (step t192 (cl (not (tptp.neq tptp.sk1 tptp.nil))) :rule resolution :premises (t154 a185 t172 t183 t191))
% 2.05/2.27  (step t193 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (tptp.neq tptp.sk1 tptp.nil) (= tptp.nil tptp.sk1)))) :rule resolution :premises (t9 t152 a7 a185 t192))
% 2.05/2.27  (step t194 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 2.05/2.27  (anchor :step t195 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 2.05/2.27  (step t195.t1 (cl (= U U)) :rule refl)
% 2.05/2.27  (step t195.t2 (cl (= V V)) :rule refl)
% 2.05/2.27  (step t195.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 2.05/2.27  (step t195.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 2.05/2.27  (step t195.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 2.05/2.27  (step t195.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 2.05/2.27  (step t195.t7 (cl (= (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule cong :premises (t195.t3 t195.t4 t195.t5 t195.t6))
% 2.05/2.27  (step t195 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 2.05/2.27  (step t196 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t194 t195 a99))
% 2.05/2.27  (step t197 (cl) :rule resolution :premises (t7 t193 t196))
% 2.05/2.27  
% 2.05/2.28  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.yGTBbXxsHT/cvc5---1.0.5_20709.smt2
% 2.05/2.29  % cvc5---1.0.5 exiting
% 2.05/2.29  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------