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

% Computer : n027.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:10 EDT 2024

% Result   : Unsatisfiable 25.65s 25.96s
% Output   : Proof 25.65s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : SWC063-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.36  % Computer : n027.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Sun May 26 14:53:24 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.40/0.54  %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.53/10.71  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.50/15.73  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.56/20.76  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.62/25.81  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 25.65/25.96  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.eiVuASAQwe/cvc5---1.0.5_2915.smt2
% 25.65/25.96  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.eiVuASAQwe/cvc5---1.0.5_2915.smt2
% 25.65/25.99  (assume a0 (tptp.equalelemsP tptp.nil))
% 25.65/25.99  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 25.65/25.99  (assume a2 (tptp.strictorderedP tptp.nil))
% 25.65/25.99  (assume a3 (tptp.totalorderedP tptp.nil))
% 25.65/25.99  (assume a4 (tptp.strictorderP tptp.nil))
% 25.65/25.99  (assume a5 (tptp.totalorderP tptp.nil))
% 25.65/25.99  (assume a6 (tptp.cyclefreeP tptp.nil))
% 25.65/25.99  (assume a7 (tptp.ssList tptp.nil))
% 25.65/25.99  (assume a8 (tptp.ssItem tptp.skac3))
% 25.65/25.99  (assume a9 (tptp.ssItem tptp.skac2))
% 25.65/25.99  (assume a10 (not (tptp.singletonP tptp.nil)))
% 25.65/25.99  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 25.65/25.99  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 25.65/25.99  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 25.65/25.99  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 25.65/25.99  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 25.65/25.99  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 25.65/25.99  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 25.65/25.99  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 25.65/25.99  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 25.65/25.99  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 25.65/25.99  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 25.65/25.99  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 25.65/25.99  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 25.65/25.99  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 25.65/25.99  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 25.65/25.99  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 25.65/25.99  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 25.65/25.99  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 25.65/25.99  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 25.65/25.99  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 25.65/25.99  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 25.65/25.99  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 25.65/25.99  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 25.65/25.99  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 25.65/25.99  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 25.65/25.99  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 25.65/25.99  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 25.65/25.99  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 25.65/25.99  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 25.65/25.99  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 25.65/25.99  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 25.65/25.99  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 25.65/25.99  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 25.65/25.99  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 25.65/25.99  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 25.65/25.99  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 25.65/25.99  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 25.65/25.99  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 25.65/25.99  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 25.65/25.99  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 25.65/25.99  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 25.65/25.99  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 25.65/25.99  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 25.65/25.99  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 25.65/25.99  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 25.65/25.99  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 25.65/25.99  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 25.65/25.99  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 25.65/25.99  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 25.65/25.99  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 25.65/25.99  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 25.65/25.99  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 25.65/25.99  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 25.65/25.99  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 25.65/25.99  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 25.65/25.99  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 25.65/25.99  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 25.65/25.99  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 25.65/25.99  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 25.65/25.99  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 25.65/25.99  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 25.65/25.99  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 25.65/25.99  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 25.65/25.99  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 25.65/25.99  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 25.65/25.99  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 25.65/25.99  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 25.65/25.99  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 25.65/25.99  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.65/25.99  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 25.65/25.99  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.65/25.99  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 25.65/25.99  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.65/25.99  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 25.65/25.99  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 25.65/25.99  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 25.65/25.99  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 25.65/25.99  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 25.65/25.99  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 25.65/25.99  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 25.65/25.99  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 25.65/25.99  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 25.65/25.99  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 25.65/25.99  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 25.65/25.99  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 25.65/25.99  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 25.65/25.99  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.65/25.99  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.65/25.99  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 25.65/25.99  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 25.65/25.99  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 25.65/25.99  (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))))
% 25.65/25.99  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 25.65/25.99  (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))))
% 25.65/25.99  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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))))
% 25.65/25.99  (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)))))
% 25.65/25.99  (assume a185 (tptp.ssList tptp.sk1))
% 25.65/25.99  (assume a186 (tptp.ssList tptp.sk2))
% 25.65/25.99  (assume a187 (tptp.ssList tptp.sk3))
% 25.65/25.99  (assume a188 (tptp.ssList tptp.sk4))
% 25.65/25.99  (assume a189 (= tptp.sk2 tptp.sk4))
% 25.65/25.99  (assume a190 (= tptp.sk1 tptp.sk3))
% 25.65/25.99  (assume a191 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 25.65/25.99  (assume a192 (or (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/25.99  (assume a193 (or (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/25.99  (assume a194 (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/25.99  (assume a195 (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 25.65/25.99  (assume a196 (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)))
% 25.65/25.99  (assume a197 (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))))
% 25.65/25.99  (assume a198 (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)))
% 25.65/25.99  (assume a199 (forall ((A $$unsorted)) (or (not (= tptp.nil tptp.sk1)) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))))
% 25.65/25.99  (step t1 (cl (not (= (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))))) (not (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule equiv_pos2)
% 25.65/25.99  (step t2 (cl (= (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule refl)
% 25.65/25.99  (step t3 (cl (= (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule refl)
% 25.65/25.99  (step t4 (cl (= (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule refl)
% 25.65/25.99  (step t5 (cl (= (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule refl)
% 25.65/25.99  (step t6 (cl (= (not (= tptp.nil tptp.sk6)) (not (= tptp.nil tptp.sk6)))) :rule refl)
% 25.65/25.99  (step t7 (cl (= (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))))) :rule refl)
% 25.65/25.99  (step t8 (cl (= (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true) (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv_simplify)
% 25.65/25.99  (step t9 (cl (not (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule equiv1 :premises (t8))
% 25.65/25.99  (step t10 (cl (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule all_simplify)
% 25.65/25.99  (step t11 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule refl)
% 25.65/25.99  (step t12 (cl (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule all_simplify)
% 25.65/25.99  (step t13 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule cong :premises (t11 t12))
% 25.65/25.99  (step t14 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) :rule all_simplify)
% 25.65/25.99  (step t15 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) true)) :rule trans :premises (t13 t14))
% 25.65/25.99  (step t16 (cl (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) :rule trans :premises (t10 t15))
% 25.65/25.99  (step t17 (cl (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t9 t16))
% 25.65/25.99  (step t18 (cl (= (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule refl)
% 25.65/25.99  (step t19 (cl (= (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))))) :rule cong :premises (t2 t3 t4 t5 t6 t7 t17 t18))
% 25.65/25.99  (step t20 (cl (not (= (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))))) (not (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule equiv_pos2)
% 25.65/26.00  (step t21 (cl (= (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule refl)
% 25.65/26.00  (step t22 (cl (= (= (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule equiv_simplify)
% 25.65/26.00  (step t23 (cl (= (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (not (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule equiv2 :premises (t22))
% 25.65/26.00  (step t24 (cl (not (not (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule not_not)
% 25.65/26.00  (step t25 (cl (= (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t23 t24))
% 25.65/26.00  (step t26 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t27)
% 25.65/26.00  (assume t27.a0 (tptp.segmentP tptp.sk4 tptp.sk4))
% 25.65/26.00  (assume t27.a1 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.00  (assume t27.a2 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 25.65/26.00  (assume t27.a3 (= tptp.nil tptp.sk6))
% 25.65/26.00  (assume t27.a4 (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))
% 25.65/26.00  (assume t27.a5 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (assume t27.a6 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 25.65/26.00  (assume t27.a7 (not (tptp.segmentP tptp.sk3 tptp.sk4)))
% 25.65/26.00  (step t27.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 25.65/26.00  (step t27.t2 (cl (= (= false true) false)) :rule all_simplify)
% 25.65/26.00  (step t27.t3 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv_simplify)
% 25.65/26.00  (step t27.t4 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv2 :premises (t27.t3))
% 25.65/26.00  (step t27.t5 (cl (not (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule not_not)
% 25.65/26.00  (step t27.t6 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t27.t4 t27.t5))
% 25.65/26.00  (step t27.t7 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false)) :rule resolution :premises (t27.t6 t27.a7))
% 25.65/26.00  (step t27.t8 (cl (= false (tptp.segmentP tptp.sk3 tptp.sk4))) :rule symm :premises (t27.t7))
% 25.65/26.00  (step t27.t9 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t27.a6))
% 25.65/26.00  (step t27.t10 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t27.t9))
% 25.65/26.00  (step t27.t11 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.00  (step t27.t12 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t27.a5))
% 25.65/26.00  (step t27.t13 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t27.t12))
% 25.65/26.00  (step t27.t14 (cl (= (tptp.app tptp.nil tptp.sk3) (tptp.app tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule cong :premises (t27.t11 t27.t13))
% 25.65/26.00  (step t27.t15 (cl (= tptp.nil (tptp.app tptp.nil tptp.sk6))) :rule trans :premises (t27.a3 t27.a2))
% 25.65/26.00  (step t27.t16 (cl (= (tptp.cons tptp.sk5 tptp.sk6) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t27.a4))
% 25.65/26.00  (step t27.t17 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) :rule symm :premises (t27.t16))
% 25.65/26.00  (step t27.t18 (cl (= tptp.sk5 tptp.sk5)) :rule refl)
% 25.65/26.00  (step t27.t19 (cl (= tptp.sk6 tptp.nil)) :rule symm :premises (t27.a3))
% 25.65/26.00  (step t27.t20 (cl (= (tptp.cons tptp.sk5 tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) :rule cong :premises (t27.t18 t27.t19))
% 25.65/26.00  (step t27.t21 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.nil))) :rule trans :premises (t27.t17 t27.t20))
% 25.65/26.00  (step t27.t22 (cl (= (tptp.app tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t27.t15 t27.t21))
% 25.65/26.00  (step t27.t23 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t27.a2))
% 25.65/26.00  (step t27.t24 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 25.65/26.00  (step t27.t25 (cl (= (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t27.t23 t27.t24))
% 25.65/26.00  (step t27.t26 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4)) :rule symm :premises (t27.a1))
% 25.65/26.00  (step t27.t27 (cl (= tptp.sk3 tptp.sk4)) :rule trans :premises (t27.t10 t27.t14 t27.t22 t27.t25 t27.t26))
% 25.65/26.00  (step t27.t28 (cl (= tptp.sk4 tptp.sk4)) :rule refl)
% 25.65/26.00  (step t27.t29 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule cong :premises (t27.t27 t27.t28))
% 25.65/26.00  (step t27.t30 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk4) true) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule equiv_simplify)
% 25.65/26.00  (step t27.t31 (cl (= (tptp.segmentP tptp.sk4 tptp.sk4) true) (not (tptp.segmentP tptp.sk4 tptp.sk4))) :rule equiv2 :premises (t27.t30))
% 25.65/26.00  (step t27.t32 (cl (= (tptp.segmentP tptp.sk4 tptp.sk4) true)) :rule resolution :premises (t27.t31 t27.a0))
% 25.65/26.00  (step t27.t33 (cl (= false true)) :rule trans :premises (t27.t8 t27.t29 t27.t32))
% 25.65/26.00  (step t27.t34 (cl false) :rule resolution :premises (t27.t1 t27.t2 t27.t33))
% 25.65/26.00  (step t27 (cl (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) :rule subproof :discharge (t27.a0 t27.a1 t27.a2 t27.a3 t27.a4 t27.a5 t27.a6 t27.a7))
% 25.65/26.00  (step t28 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (tptp.segmentP tptp.sk4 tptp.sk4)) :rule and_pos)
% 25.65/26.00  (step t29 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t30 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t31 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.nil tptp.sk6)) :rule and_pos)
% 25.65/26.00  (step t32 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t33 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t34 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 25.65/26.00  (step t35 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule and_pos)
% 25.65/26.00  (step t36 (cl false (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t27 t28 t29 t30 t31 t32 t33 t34 t35))
% 25.65/26.00  (step t37 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) false) :rule reordering :premises (t36))
% 25.65/26.00  (step t38 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) false) :rule contraction :premises (t37))
% 25.65/26.00  (step t39 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) false) :rule resolution :premises (t26 t38))
% 25.65/26.00  (step t40 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (not false)) :rule implies_neg2)
% 25.65/26.00  (step t41 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false)) :rule resolution :premises (t39 t40))
% 25.65/26.00  (step t42 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false)) :rule contraction :premises (t41))
% 25.65/26.00  (step t43 (cl (= (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule implies_simplify)
% 25.65/26.00  (step t44 (cl (not (=> (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false)) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule equiv1 :premises (t43))
% 25.65/26.00  (step t45 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t42 t44))
% 25.65/26.00  (step t46 (cl (= (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) false)) :rule resolution :premises (t25 t45))
% 25.65/26.00  (step t47 (cl (= (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) false))) :rule cong :premises (t21 t46))
% 25.65/26.00  (step t48 (cl (= (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) false) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))))) :rule all_simplify)
% 25.65/26.00  (step t49 (cl (= (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))))) :rule trans :premises (t47 t48))
% 25.65/26.00  (step t50 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t51)
% 25.65/26.00  (assume t51.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (assume t51.a1 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.00  (assume t51.a2 (tptp.segmentP tptp.sk4 tptp.sk4))
% 25.65/26.00  (assume t51.a3 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 25.65/26.00  (assume t51.a4 (= tptp.nil tptp.sk6))
% 25.65/26.00  (assume t51.a5 (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))
% 25.65/26.00  (assume t51.a6 (not (tptp.segmentP tptp.sk3 tptp.sk4)))
% 25.65/26.00  (assume t51.a7 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 25.65/26.00  (step t51.t1 (cl (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule and_neg)
% 25.65/26.00  (step t51.t2 (cl (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t51.t1 t51.a2 t51.a1 t51.a3 t51.a4 t51.a5 t51.a0 t51.a7 t51.a6))
% 25.65/26.00  (step t51 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule subproof :discharge (t51.a0 t51.a1 t51.a2 t51.a3 t51.a4 t51.a5 t51.a6 t51.a7))
% 25.65/26.00  (step t52 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t53 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t54 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk4)) :rule and_pos)
% 25.65/26.00  (step t55 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t56 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.nil tptp.sk6)) :rule and_pos)
% 25.65/26.00  (step t57 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t58 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule and_pos)
% 25.65/26.00  (step t59 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 25.65/26.00  (step t60 (cl (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t51 t52 t53 t54 t55 t56 t57 t58 t59))
% 25.65/26.00  (step t61 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule reordering :premises (t60))
% 25.65/26.00  (step t62 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule contraction :premises (t61))
% 25.65/26.00  (step t63 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t50 t62))
% 25.65/26.00  (step t64 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule implies_neg2)
% 25.65/26.00  (step t65 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t63 t64))
% 25.65/26.00  (step t66 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (and (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule contraction :premises (t65))
% 25.65/26.00  (step t67 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (tptp.segmentP tptp.sk4 tptp.sk4) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.nil tptp.sk6) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t20 t49 t66))
% 25.65/26.00  (step t68 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule not_and :premises (t67))
% 25.65/26.00  (step t69 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule or_neg)
% 25.65/26.00  (step t70 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule or_neg)
% 25.65/26.00  (step t71 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule or_neg)
% 25.65/26.00  (step t72 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule or_neg)
% 25.65/26.00  (step t73 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (= tptp.nil tptp.sk6)))) :rule or_neg)
% 25.65/26.00  (step t74 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))))) :rule or_neg)
% 25.65/26.00  (step t75 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule or_neg)
% 25.65/26.00  (step t76 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule or_neg)
% 25.65/26.00  (step t77 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t68 t69 t70 t71 t72 t73 t74 t75 t76))
% 25.65/26.00  (step t78 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule contraction :premises (t77))
% 25.65/26.00  (step t79 (cl (or (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t1 t19 t78))
% 25.65/26.00  (step t80 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule or :premises (t79))
% 25.65/26.00  (step t81 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.nil tptp.sk6)) (not (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule reordering :premises (t80))
% 25.65/26.00  (step t82 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule or_pos)
% 25.65/26.00  (step t83 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule reordering :premises (t82))
% 25.65/26.00  (step t84 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t85)
% 25.65/26.00  (assume t85.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 25.65/26.00  (step t85.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 25.65/26.00  (step t85.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule or :premises (t85.t1))
% 25.65/26.00  (step t85.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t85.t2 t85.a0))
% 25.65/26.00  (step t85 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule subproof :discharge (t85.a0))
% 25.65/26.00  (step t86 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t84 t85))
% 25.65/26.00  (step t87 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule implies_neg2)
% 25.65/26.00  (step t88 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t86 t87))
% 25.65/26.00  (step t89 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule contraction :premises (t88))
% 25.65/26.00  (step t90 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies :premises (t89))
% 25.65/26.00  (step t91 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 25.65/26.00  (anchor :step t92 :args ((U $$unsorted) (:= U U)))
% 25.65/26.00  (step t92.t1 (cl (= U U)) :rule refl)
% 25.65/26.00  (step t92.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.00  (step t92.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 25.65/26.00  (step t92.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule cong :premises (t92.t2 t92.t3))
% 25.65/26.00  (step t92 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 25.65/26.00  (step t93 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t91 t92 a73))
% 25.65/26.00  (step t94 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t90 t93))
% 25.65/26.00  (step t95 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule resolution :premises (t83 a187 t94))
% 25.65/26.00  (step t96 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)) :rule or_pos)
% 25.65/26.00  (step t97 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (= tptp.nil tptp.sk6) (tptp.neq tptp.sk6 tptp.nil) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule reordering :premises (t96))
% 25.65/26.00  (step t98 (cl (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a193))
% 25.65/26.00  (step t99 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk6)) :rule reordering :premises (t98))
% 25.65/26.00  (step t100 (cl (not (= (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil)))) (not (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_pos2)
% 25.65/26.00  (step t101 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.00  (step t102 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 25.65/26.00  (step t103 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t102 a190 a189))
% 25.65/26.00  (step t104 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t103))
% 25.65/26.00  (step t105 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk4))) :rule cong :premises (t101 t104))
% 25.65/26.00  (step t106 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t104 t101))
% 25.65/26.00  (step t107 (cl (= (or (= tptp.nil tptp.sk2) (tptp.neq tptp.sk2 tptp.nil)) (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil)))) :rule cong :premises (t105 t106))
% 25.65/26.00  (step t108 (cl (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t100 t107 a196))
% 25.65/26.00  (step t109 (cl (= tptp.nil tptp.sk4) (tptp.neq tptp.sk4 tptp.nil)) :rule or :premises (t108))
% 25.65/26.00  (step t110 (cl (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))) :rule or :premises (a191))
% 25.65/26.00  (step t111 (cl (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_neg)
% 25.65/26.00  (step t112 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t113)
% 25.65/26.00  (assume t113.a0 (= tptp.nil tptp.sk3))
% 25.65/26.00  (assume t113.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (step t113.t1 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t113.t2)
% 25.65/26.00  (assume t113.t2.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (assume t113.t2.a1 (= tptp.nil tptp.sk3))
% 25.65/26.00  (step t113.t2.t1 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t113.t2.a1))
% 25.65/26.00  (step t113.t2.t2 (cl (= tptp.nil tptp.sk3)) :rule symm :premises (t113.t2.t1))
% 25.65/26.00  (step t113.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t113.t2.a0))
% 25.65/26.00  (step t113.t2.t4 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t113.t2.t3))
% 25.65/26.00  (step t113.t2.t5 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule trans :premises (t113.t2.t2 t113.t2.t4))
% 25.65/26.00  (step t113.t2 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t113.t2.a0 t113.t2.a1))
% 25.65/26.00  (step t113.t3 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t113.t4 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 25.65/26.00  (step t113.t5 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t113.t2 t113.t3 t113.t4))
% 25.65/26.00  (step t113.t6 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t113.t5))
% 25.65/26.00  (step t113.t7 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t113.t6))
% 25.65/26.00  (step t113.t8 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t113.t1 t113.t7))
% 25.65/26.00  (step t113.t9 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 25.65/26.00  (step t113.t10 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t113.t8 t113.t9))
% 25.65/26.00  (step t113.t11 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t113.t10))
% 25.65/26.00  (step t113.t12 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t113.t11))
% 25.65/26.00  (step t113.t13 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 25.65/26.00  (step t113.t14 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t113.t13 t113.a1 t113.a0))
% 25.65/26.00  (step t113.t15 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t113.t12 t113.t14))
% 25.65/26.00  (step t113 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule subproof :discharge (t113.a0 t113.a1))
% 25.65/26.00  (step t114 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 25.65/26.00  (step t115 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t116 (cl (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t113 t114 t115))
% 25.65/26.00  (step t117 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t116))
% 25.65/26.00  (step t118 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule contraction :premises (t117))
% 25.65/26.00  (step t119 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t112 t118))
% 25.65/26.00  (step t120 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 25.65/26.00  (step t121 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t119 t120))
% 25.65/26.00  (step t122 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule contraction :premises (t121))
% 25.65/26.00  (step t123 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule implies :premises (t122))
% 25.65/26.00  (step t124 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t111 t123))
% 25.65/26.00  (step t125 (cl (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 25.65/26.00  (step t126 (cl (not (tptp.ssList tptp.sk6)) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t125))
% 25.65/26.00  (step t127 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t128)
% 25.65/26.00  (assume t128.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 25.65/26.00  (step t128.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk6)))
% 25.65/26.00  (step t128.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t128.t1))
% 25.65/26.00  (step t128.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t128.t2 t128.a0))
% 25.65/26.00  (step t128 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t128.a0))
% 25.65/26.00  (step t129 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t127 t128))
% 25.65/26.00  (step t130 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.00  (step t131 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t129 t130))
% 25.65/26.00  (step t132 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t131))
% 25.65/26.00  (step t133 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t132))
% 25.65/26.00  (step t134 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule equiv_pos2)
% 25.65/26.00  (anchor :step t135 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.65/26.00  (step t135.t1 (cl (= U U)) :rule refl)
% 25.65/26.00  (step t135.t2 (cl (= V V)) :rule refl)
% 25.65/26.00  (step t135.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 25.65/26.00  (step t135.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t135.t3))
% 25.65/26.00  (step t135.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.00  (step t135.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.00  (step t135.t7 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 25.65/26.00  (step t135.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule cong :premises (t135.t4 t135.t5 t135.t6 t135.t7))
% 25.65/26.00  (step t135 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))) :rule bind)
% 25.65/26.00  (step t136 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U)))) :rule resolution :premises (t134 t135 a117))
% 25.65/26.00  (step t137 (cl (or (not (= tptp.nil (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t133 t136))
% 25.65/26.00  (step t138 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 25.65/26.00  (step t139 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t138))
% 25.65/26.00  (step t140 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t141)
% 25.65/26.00  (assume t141.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 25.65/26.00  (step t141.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 25.65/26.00  (step t141.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t141.t1))
% 25.65/26.00  (step t141.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t141.t2 t141.a0))
% 25.65/26.00  (step t141 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t141.a0))
% 25.65/26.00  (step t142 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t140 t141))
% 25.65/26.00  (step t143 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 25.65/26.00  (step t144 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t142 t143))
% 25.65/26.00  (step t145 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t144))
% 25.65/26.00  (step t146 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t145))
% 25.65/26.00  (step t147 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 25.65/26.00  (anchor :step t148 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.65/26.00  (step t148.t1 (cl (= U U)) :rule refl)
% 25.65/26.00  (step t148.t2 (cl (= V V)) :rule refl)
% 25.65/26.00  (step t148.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 25.65/26.00  (step t148.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t148.t3))
% 25.65/26.00  (step t148.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 25.65/26.00  (step t148.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.00  (step t148.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t148.t4 t148.t5 t148.t6))
% 25.65/26.00  (step t148 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 25.65/26.00  (step t149 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t147 t148 a97))
% 25.65/26.00  (step t150 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t146 t149))
% 25.65/26.00  (step t151 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 25.65/26.00  (step t152 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t151))
% 25.65/26.00  (step t153 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t154)
% 25.65/26.00  (assume t154.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 25.65/26.00  (step t154.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 25.65/26.00  (step t154.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t154.t1))
% 25.65/26.00  (step t154.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t154.t2 t154.a0))
% 25.65/26.00  (step t154 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t154.a0))
% 25.65/26.00  (step t155 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t153 t154))
% 25.65/26.00  (step t156 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 25.65/26.00  (step t157 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t155 t156))
% 25.65/26.00  (step t158 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t157))
% 25.65/26.00  (step t159 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t158))
% 25.65/26.00  (step t160 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t159 a85))
% 25.65/26.00  (step t161 (cl (not (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 25.65/26.00  (step t162 (cl (= (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule all_simplify)
% 25.65/26.00  (step t163 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 25.65/26.00  (step t164 (cl (= (or (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t162 t163))
% 25.65/26.00  (step t165 (cl (or (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t161 t164 a194))
% 25.65/26.00  (step t166 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t165))
% 25.65/26.00  (step t167 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule reordering :premises (t166))
% 25.65/26.00  (step t168 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t124 t126 t137 t139 t150 a7 t152 t160 a7 t167 t99))
% 25.65/26.00  (step t169 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.ssItem tptp.sk5)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t168))
% 25.65/26.00  (step t170 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a192))
% 25.65/26.00  (step t171 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t169 t170))
% 25.65/26.00  (step t172 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t171))
% 25.65/26.00  (step t173 (cl (not (= (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil)))) (not (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil))) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_pos2)
% 25.65/26.00  (step t174 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.00  (step t175 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t103))
% 25.65/26.00  (step t176 (cl (= (= tptp.nil tptp.sk1) (= tptp.nil tptp.sk3))) :rule cong :premises (t174 t175))
% 25.65/26.00  (step t177 (cl (= (not (= tptp.nil tptp.sk1)) (not (= tptp.nil tptp.sk3)))) :rule cong :premises (t176))
% 25.65/26.00  (step t178 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t103))
% 25.65/26.00  (step t179 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t178 t174))
% 25.65/26.00  (step t180 (cl (= (or (not (= tptp.nil tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)) (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil)))) :rule cong :premises (t177 t179))
% 25.65/26.00  (step t181 (cl (or (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t173 t180 a198))
% 25.65/26.00  (step t182 (cl (not (= tptp.nil tptp.sk3)) (tptp.neq tptp.sk4 tptp.nil)) :rule or :premises (t181))
% 25.65/26.00  (step t183 (cl (tptp.neq tptp.sk4 tptp.nil) (not (= tptp.nil tptp.sk3))) :rule reordering :premises (t182))
% 25.65/26.00  (step t184 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t172 t183))
% 25.65/26.00  (step t185 (cl (not (= tptp.nil tptp.sk3))) :rule contraction :premises (t184))
% 25.65/26.00  (step t186 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t110 t185))
% 25.65/26.00  (step t187 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t109 t186))
% 25.65/26.00  (step t188 (cl (tptp.ssList tptp.sk6)) :rule resolution :premises (t99 t187))
% 25.65/26.00  (step t189 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))) :rule or_pos)
% 25.65/26.00  (step t190 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule reordering :premises (t189))
% 25.65/26.00  (step t191 (cl (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule and_neg)
% 25.65/26.00  (step t192 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t193)
% 25.65/26.00  (assume t193.a0 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.00  (assume t193.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 25.65/26.00  (assume t193.a2 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))
% 25.65/26.00  (step t193.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t193.t2)
% 25.65/26.00  (assume t193.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))
% 25.65/26.00  (assume t193.t2.a1 (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))
% 25.65/26.00  (assume t193.t2.a2 (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.00  (step t193.t2.t1 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk6) true) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule equiv_simplify)
% 25.65/26.00  (step t193.t2.t2 (cl (not (= (tptp.segmentP tptp.sk4 tptp.sk6) true)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule equiv1 :premises (t193.t2.t1))
% 25.65/26.00  (step t193.t2.t3 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4)) :rule symm :premises (t193.t2.a2))
% 25.65/26.00  (step t193.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule symm :premises (t193.t2.t3))
% 25.65/26.00  (step t193.t2.t5 (cl (= (tptp.app tptp.nil tptp.sk6) tptp.sk6)) :rule symm :premises (t193.t2.a1))
% 25.65/26.00  (step t193.t2.t6 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule symm :premises (t193.t2.t5))
% 25.65/26.00  (step t193.t2.t7 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 25.65/26.00  (step t193.t2.t8 (cl (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule cong :premises (t193.t2.t6 t193.t2.t7))
% 25.65/26.00  (step t193.t2.t9 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)))) :rule trans :premises (t193.t2.t4 t193.t2.t8))
% 25.65/26.00  (step t193.t2.t10 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 25.65/26.00  (step t193.t2.t11 (cl (= (tptp.segmentP tptp.sk4 tptp.sk6) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule cong :premises (t193.t2.t9 t193.t2.t10))
% 25.65/26.00  (step t193.t2.t12 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule equiv_simplify)
% 25.65/26.00  (step t193.t2.t13 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule equiv2 :premises (t193.t2.t12))
% 25.65/26.00  (step t193.t2.t14 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) true)) :rule resolution :premises (t193.t2.t13 t193.t2.a0))
% 25.65/26.00  (step t193.t2.t15 (cl (= (tptp.segmentP tptp.sk4 tptp.sk6) true)) :rule trans :premises (t193.t2.t11 t193.t2.t14))
% 25.65/26.00  (step t193.t2.t16 (cl (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t193.t2.t2 t193.t2.t15))
% 25.65/26.00  (step t193.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule subproof :discharge (t193.t2.a0 t193.t2.a1 t193.t2.a2))
% 25.65/26.00  (step t193.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule and_pos)
% 25.65/26.00  (step t193.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t193.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t193.t6 (cl (tptp.segmentP tptp.sk4 tptp.sk6) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))))) :rule resolution :premises (t193.t2 t193.t3 t193.t4 t193.t5))
% 25.65/26.00  (step t193.t7 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule reordering :premises (t193.t6))
% 25.65/26.00  (step t193.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule contraction :premises (t193.t7))
% 25.65/26.00  (step t193.t9 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t193.t1 t193.t8))
% 25.65/26.00  (step t193.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk4 tptp.sk6))) :rule implies_neg2)
% 25.65/26.00  (step t193.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule resolution :premises (t193.t9 t193.t10))
% 25.65/26.00  (step t193.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule contraction :premises (t193.t11))
% 25.65/26.00  (step t193.t13 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule implies :premises (t193.t12))
% 25.65/26.00  (step t193.t14 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule and_neg)
% 25.65/26.00  (step t193.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t193.t14 t193.a2 t193.a1 t193.a0))
% 25.65/26.00  (step t193.t16 (cl (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t193.t13 t193.t15))
% 25.65/26.00  (step t193 (cl (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule subproof :discharge (t193.a0 t193.a1 t193.a2))
% 25.65/26.00  (step t194 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t195 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t196 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule and_pos)
% 25.65/26.00  (step t197 (cl (tptp.segmentP tptp.sk4 tptp.sk6) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t193 t194 t195 t196))
% 25.65/26.00  (step t198 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule reordering :premises (t197))
% 25.65/26.00  (step t199 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule contraction :premises (t198))
% 25.65/26.00  (step t200 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t192 t199))
% 25.65/26.00  (step t201 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk4 tptp.sk6))) :rule implies_neg2)
% 25.65/26.00  (step t202 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule resolution :premises (t200 t201))
% 25.65/26.00  (step t203 (cl (=> (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6))) :rule contraction :premises (t202))
% 25.65/26.00  (step t204 (cl (not (and (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule implies :premises (t203))
% 25.65/26.00  (step t205 (cl (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t191 t204))
% 25.65/26.00  (step t206 (cl (not (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk6) (not (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule reordering :premises (t205))
% 25.65/26.00  (step t207 (cl (not (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 25.65/26.00  (step t208 (cl (= (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))))) :rule all_simplify)
% 25.65/26.00  (step t209 (cl (= (or (= (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t208 t163))
% 25.65/26.00  (step t210 (cl (or (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t207 t209 a195))
% 25.65/26.00  (step t211 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t210))
% 25.65/26.00  (step t212 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule reordering :premises (t211))
% 25.65/26.00  (step t213 (cl (= tptp.sk4 (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t212 t187))
% 25.65/26.00  (step t214 (cl (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule or_pos)
% 25.65/26.00  (step t215 (cl (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule reordering :premises (t214))
% 25.65/26.00  (step t216 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t217)
% 25.65/26.00  (assume t217.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 25.65/26.00  (step t217.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 25.65/26.00  (step t217.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule or :premises (t217.t1))
% 25.65/26.00  (step t217.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t217.t2 t217.a0))
% 25.65/26.00  (step t217 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule subproof :discharge (t217.a0))
% 25.65/26.00  (step t218 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t216 t217))
% 25.65/26.00  (step t219 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule implies_neg2)
% 25.65/26.00  (step t220 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule resolution :premises (t218 t219))
% 25.65/26.00  (step t221 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))))) :rule contraction :premises (t220))
% 25.65/26.00  (step t222 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule implies :premises (t221))
% 25.65/26.00  (step t223 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.nil tptp.sk6)))) :rule resolution :premises (t222 t93))
% 25.65/26.00  (step t224 (cl (= tptp.sk6 (tptp.app tptp.nil tptp.sk6))) :rule resolution :premises (t215 t188 t223))
% 25.65/26.00  (step t225 (cl (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule or_pos)
% 25.65/26.00  (step t226 (cl (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule contraction :premises (t225))
% 25.65/26.00  (step t227 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.segmentP tptp.sk6 tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6) (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule reordering :premises (t226))
% 25.65/26.00  (step t228 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a192))
% 25.65/26.00  (step t229 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t228 t187))
% 25.65/26.00  (step t230 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t152 a7 t229 t160))
% 25.65/26.00  (step t231 (cl (not (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)) :rule or_pos)
% 25.65/26.00  (step t232 (cl (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6) (not (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule reordering :premises (t231))
% 25.65/26.00  (step t233 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t234)
% 25.65/26.00  (assume t234.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 25.65/26.00  (step t234.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk6)))
% 25.65/26.00  (step t234.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule or :premises (t234.t1))
% 25.65/26.00  (step t234.t3 (cl (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule resolution :premises (t234.t2 t234.a0))
% 25.65/26.00  (step t234 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule subproof :discharge (t234.a0))
% 25.65/26.00  (step t235 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule resolution :premises (t233 t234))
% 25.65/26.00  (step t236 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (not (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule implies_neg2)
% 25.65/26.00  (step t237 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule resolution :premises (t235 t236))
% 25.65/26.00  (step t238 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6)))) :rule contraction :premises (t237))
% 25.65/26.00  (step t239 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule implies :premises (t238))
% 25.65/26.00  (step t240 (cl (or (not (tptp.ssList tptp.sk6)) (tptp.segmentP tptp.sk6 tptp.sk6))) :rule resolution :premises (t239 a56))
% 25.65/26.00  (step t241 (cl (tptp.segmentP tptp.sk6 tptp.sk6)) :rule resolution :premises (t232 t188 t240))
% 25.65/26.00  (step t242 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t243)
% 25.65/26.00  (assume t243.a0 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 25.65/26.00  (step t243.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule forall_inst :args ((:= U tptp.sk6) (:= V tptp.sk6) (:= W (tptp.cons tptp.sk5 tptp.nil)) (:= X tptp.nil)))
% 25.65/26.00  (step t243.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule or :premises (t243.t1))
% 25.65/26.00  (step t243.t3 (cl (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule resolution :premises (t243.t2 t243.a0))
% 25.65/26.00  (step t243 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule subproof :discharge (t243.a0))
% 25.65/26.00  (step t244 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule resolution :premises (t242 t243))
% 25.65/26.00  (step t245 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (not (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule implies_neg2)
% 25.65/26.00  (step t246 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule resolution :premises (t244 t245))
% 25.65/26.00  (step t247 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)))) :rule contraction :premises (t246))
% 25.65/26.00  (step t248 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V)))) (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule implies :premises (t247))
% 25.65/26.00  (step t249 (cl (or (not (tptp.segmentP tptp.sk6 tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk6)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6))) :rule resolution :premises (t248 a171))
% 25.65/26.00  (step t250 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk6) (tptp.cons tptp.sk5 tptp.nil)) tptp.sk6)) :rule resolution :premises (t227 a7 t188 t230 t241 t249))
% 25.65/26.00  (step t251 (cl (tptp.segmentP tptp.sk4 tptp.sk6)) :rule resolution :premises (t206 t213 t224 t250))
% 25.65/26.00  (step t252 (cl (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule and_neg)
% 25.65/26.00  (step t253 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t254)
% 25.65/26.00  (assume t254.a0 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (assume t254.a1 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 25.65/26.00  (assume t254.a2 (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))
% 25.65/26.00  (assume t254.a3 (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))
% 25.65/26.00  (step t254.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t254.t2)
% 25.65/26.00  (assume t254.t2.a0 (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))
% 25.65/26.00  (assume t254.t2.a1 (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))
% 25.65/26.00  (assume t254.t2.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 25.65/26.00  (assume t254.t2.a3 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (step t254.t2.t1 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk6) true) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule equiv_simplify)
% 25.65/26.00  (step t254.t2.t2 (cl (not (= (tptp.segmentP tptp.sk3 tptp.sk6) true)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule equiv1 :premises (t254.t2.t1))
% 25.65/26.00  (step t254.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t254.t2.a3))
% 25.65/26.00  (step t254.t2.t4 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t254.t2.t3))
% 25.65/26.00  (step t254.t2.t5 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 25.65/26.00  (step t254.t2.t6 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t254.t2.a2))
% 25.65/26.00  (step t254.t2.t7 (cl (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule symm :premises (t254.t2.t6))
% 25.65/26.00  (step t254.t2.t8 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule cong :premises (t254.t2.t5 t254.t2.t7))
% 25.65/26.00  (step t254.t2.t9 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule symm :premises (t254.t2.a1))
% 25.65/26.00  (step t254.t2.t10 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule trans :premises (t254.t2.t4 t254.t2.t8 t254.t2.t9))
% 25.65/26.00  (step t254.t2.t11 (cl (= tptp.sk6 tptp.sk6)) :rule refl)
% 25.65/26.00  (step t254.t2.t12 (cl (= (tptp.segmentP tptp.sk3 tptp.sk6) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule cong :premises (t254.t2.t10 t254.t2.t11))
% 25.65/26.00  (step t254.t2.t13 (cl (= (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) true) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule equiv_simplify)
% 25.65/26.00  (step t254.t2.t14 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) true) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule equiv2 :premises (t254.t2.t13))
% 25.65/26.00  (step t254.t2.t15 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) true)) :rule resolution :premises (t254.t2.t14 t254.t2.a0))
% 25.65/26.00  (step t254.t2.t16 (cl (= (tptp.segmentP tptp.sk3 tptp.sk6) true)) :rule trans :premises (t254.t2.t12 t254.t2.t15))
% 25.65/26.00  (step t254.t2.t17 (cl (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t254.t2.t2 t254.t2.t16))
% 25.65/26.00  (step t254.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule subproof :discharge (t254.t2.a0 t254.t2.a1 t254.t2.a2 t254.t2.a3))
% 25.65/26.00  (step t254.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule and_pos)
% 25.65/26.00  (step t254.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t254.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 25.65/26.00  (step t254.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t254.t7 (cl (tptp.segmentP tptp.sk3 tptp.sk6) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))))) :rule resolution :premises (t254.t2 t254.t3 t254.t4 t254.t5 t254.t6))
% 25.65/26.00  (step t254.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule reordering :premises (t254.t7))
% 25.65/26.00  (step t254.t9 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule contraction :premises (t254.t8))
% 25.65/26.00  (step t254.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t254.t1 t254.t9))
% 25.65/26.00  (step t254.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))) :rule implies_neg2)
% 25.65/26.00  (step t254.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule resolution :premises (t254.t10 t254.t11))
% 25.65/26.00  (step t254.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule contraction :premises (t254.t12))
% 25.65/26.00  (step t254.t14 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule implies :premises (t254.t13))
% 25.65/26.00  (step t254.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule and_neg)
% 25.65/26.00  (step t254.t16 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))) :rule resolution :premises (t254.t15 t254.a3 t254.a2 t254.a1 t254.a0))
% 25.65/26.00  (step t254.t17 (cl (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t254.t14 t254.t16))
% 25.65/26.00  (step t254 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule subproof :discharge (t254.a0 t254.a1 t254.a2 t254.a3))
% 25.65/26.00  (step t255 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t256 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 25.65/26.00  (step t257 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t258 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule and_pos)
% 25.65/26.00  (step t259 (cl (tptp.segmentP tptp.sk3 tptp.sk6) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule resolution :premises (t254 t255 t256 t257 t258))
% 25.65/26.00  (step t260 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule reordering :premises (t259))
% 25.65/26.00  (step t261 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule contraction :premises (t260))
% 25.65/26.00  (step t262 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t253 t261))
% 25.65/26.00  (step t263 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))) :rule implies_neg2)
% 25.65/26.00  (step t264 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule resolution :premises (t262 t263))
% 25.65/26.00  (step t265 (cl (=> (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6))) :rule contraction :premises (t264))
% 25.65/26.00  (step t266 (cl (not (and (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule implies :premises (t265))
% 25.65/26.00  (step t267 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t252 t266))
% 25.65/26.00  (step t268 (cl (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.segmentP tptp.sk3 tptp.sk6) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule reordering :premises (t267))
% 25.65/26.00  (step t269 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule resolution :premises (t167 t187))
% 25.65/26.00  (step t270 (cl (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule or_pos)
% 25.65/26.00  (step t271 (cl (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule reordering :premises (t270))
% 25.65/26.00  (step t272 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t273)
% 25.65/26.00  (assume t273.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 25.65/26.00  (step t273.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk6)))
% 25.65/26.00  (step t273.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule or :premises (t273.t1))
% 25.65/26.00  (step t273.t3 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule resolution :premises (t273.t2 t273.a0))
% 25.65/26.00  (step t273 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule subproof :discharge (t273.a0))
% 25.65/26.00  (step t274 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule resolution :premises (t272 t273))
% 25.65/26.00  (step t275 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule implies_neg2)
% 25.65/26.00  (step t276 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule resolution :premises (t274 t275))
% 25.65/26.00  (step t277 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))))) :rule contraction :premises (t276))
% 25.65/26.00  (step t278 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule implies :premises (t277))
% 25.65/26.00  (step t279 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule equiv_pos2)
% 25.65/26.00  (anchor :step t280 :args ((U $$unsorted) (:= U U)))
% 25.65/26.00  (step t280.t1 (cl (= U U)) :rule refl)
% 25.65/26.00  (step t280.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.00  (step t280.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 25.65/26.00  (step t280.t4 (cl (= (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule cong :premises (t280.t2 t280.t3))
% 25.65/26.00  (step t280 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))) :rule bind)
% 25.65/26.00  (step t281 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t279 t280 a72))
% 25.65/26.00  (step t282 (cl (or (not (tptp.ssList tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))) :rule resolution :premises (t278 t281))
% 25.65/26.00  (step t283 (cl (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule resolution :premises (t271 t188 t282))
% 25.65/26.00  (step t284 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule or_pos)
% 25.65/26.00  (step t285 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))))) :rule reordering :premises (t284))
% 25.65/26.00  (step t286 (cl (=> (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))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (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)))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t287)
% 25.65/26.00  (assume t287.a0 (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))))))
% 25.65/26.00  (step t287.t1 (cl (or (not (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)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk6) (:= W (tptp.cons tptp.sk5 tptp.nil))))
% 25.65/26.00  (step t287.t2 (cl (not (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)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule or :premises (t287.t1))
% 25.65/26.00  (step t287.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule resolution :premises (t287.t2 t287.a0))
% 25.65/26.00  (step t287 (cl (not (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)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule subproof :discharge (t287.a0))
% 25.65/26.00  (step t288 (cl (=> (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))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule resolution :premises (t286 t287))
% 25.65/26.00  (step t289 (cl (=> (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))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))))) :rule implies_neg2)
% 25.65/26.00  (step t290 (cl (=> (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))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (=> (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))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))))) :rule resolution :premises (t288 t289))
% 25.65/26.00  (step t291 (cl (=> (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))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))))) :rule contraction :premises (t290))
% 25.65/26.00  (step t292 (cl (not (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)))))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule implies :premises (t291))
% 25.65/26.00  (step t293 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule resolution :premises (t292 a148))
% 25.65/26.00  (step t294 (cl (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule resolution :premises (t285 a7 t188 t230 t293))
% 25.65/26.00  (step t295 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule or_pos)
% 25.65/26.00  (step t296 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule reordering :premises (t295))
% 25.65/26.00  (step t297 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule and_neg)
% 25.65/26.00  (step t298 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t299)
% 25.65/26.00  (assume t299.a0 (tptp.ssList tptp.sk3))
% 25.65/26.00  (assume t299.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (assume t299.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 25.65/26.00  (assume t299.a3 (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))
% 25.65/26.00  (step t299.t1 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t299.t2)
% 25.65/26.00  (assume t299.t2.a0 (tptp.ssList tptp.sk3))
% 25.65/26.00  (assume t299.t2.a1 (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)))
% 25.65/26.00  (assume t299.t2.a2 (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)))
% 25.65/26.00  (assume t299.t2.a3 (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))
% 25.65/26.00  (step t299.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)) true) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)))) :rule equiv_simplify)
% 25.65/26.00  (step t299.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)) true)) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule equiv1 :premises (t299.t2.t1))
% 25.65/26.00  (step t299.t2.t3 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule symm :premises (t299.t2.a3))
% 25.65/26.00  (step t299.t2.t4 (cl (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule symm :premises (t299.t2.t3))
% 25.65/26.00  (step t299.t2.t5 (cl (= (tptp.cons tptp.sk5 tptp.nil) (tptp.cons tptp.sk5 tptp.nil))) :rule refl)
% 25.65/26.00  (step t299.t2.t6 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t299.t2.a2))
% 25.65/26.00  (step t299.t2.t7 (cl (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule symm :premises (t299.t2.t6))
% 25.65/26.00  (step t299.t2.t8 (cl (= (tptp.app tptp.sk6 tptp.nil) tptp.sk6)) :rule symm :premises (t299.t2.t7))
% 25.65/26.00  (step t299.t2.t9 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)) (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule cong :premises (t299.t2.t5 t299.t2.t8))
% 25.65/26.00  (step t299.t2.t10 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t299.t2.a1))
% 25.65/26.00  (step t299.t2.t11 (cl (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule symm :premises (t299.t2.t10))
% 25.65/26.00  (step t299.t2.t12 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.sk3)) :rule symm :premises (t299.t2.t11))
% 25.65/26.00  (step t299.t2.t13 (cl (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk3)) :rule trans :premises (t299.t2.t4 t299.t2.t9 t299.t2.t12))
% 25.65/26.00  (step t299.t2.t14 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)) (tptp.ssList tptp.sk3))) :rule cong :premises (t299.t2.t13))
% 25.65/26.00  (step t299.t2.t15 (cl (= (= (tptp.ssList tptp.sk3) true) (tptp.ssList tptp.sk3))) :rule equiv_simplify)
% 25.65/26.00  (step t299.t2.t16 (cl (= (tptp.ssList tptp.sk3) true) (not (tptp.ssList tptp.sk3))) :rule equiv2 :premises (t299.t2.t15))
% 25.65/26.00  (step t299.t2.t17 (cl (= (tptp.ssList tptp.sk3) true)) :rule resolution :premises (t299.t2.t16 t299.t2.a0))
% 25.65/26.00  (step t299.t2.t18 (cl (= (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)) true)) :rule trans :premises (t299.t2.t14 t299.t2.t17))
% 25.65/26.00  (step t299.t2.t19 (cl (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule resolution :premises (t299.t2.t2 t299.t2.t18))
% 25.65/26.00  (step t299.t2 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule subproof :discharge (t299.t2.a0 t299.t2.a1 t299.t2.a2 t299.t2.a3))
% 25.65/26.00  (step t299.t3 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList tptp.sk3)) :rule and_pos)
% 25.65/26.00  (step t299.t4 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t299.t5 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 25.65/26.00  (step t299.t6 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t299.t7 (cl (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))))) :rule resolution :premises (t299.t2 t299.t3 t299.t4 t299.t5 t299.t6))
% 25.65/26.00  (step t299.t8 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule reordering :premises (t299.t7))
% 25.65/26.00  (step t299.t9 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule contraction :premises (t299.t8))
% 25.65/26.00  (step t299.t10 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule resolution :premises (t299.t1 t299.t9))
% 25.65/26.00  (step t299.t11 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)))) :rule implies_neg2)
% 25.65/26.00  (step t299.t12 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)))) :rule resolution :premises (t299.t10 t299.t11))
% 25.65/26.00  (step t299.t13 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)))) :rule contraction :premises (t299.t12))
% 25.65/26.00  (step t299.t14 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule implies :premises (t299.t13))
% 25.65/26.00  (step t299.t15 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule and_neg)
% 25.65/26.00  (step t299.t16 (cl (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule resolution :premises (t299.t15 t299.a0 t299.a1 t299.a2 t299.a3))
% 25.65/26.00  (step t299.t17 (cl (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule resolution :premises (t299.t14 t299.t16))
% 25.65/26.00  (step t299 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule subproof :discharge (t299.a0 t299.a1 t299.a2 t299.a3))
% 25.65/26.00  (step t300 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList tptp.sk3)) :rule and_pos)
% 25.65/26.00  (step t301 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) :rule and_pos)
% 25.65/26.00  (step t302 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) :rule and_pos)
% 25.65/26.00  (step t303 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) :rule and_pos)
% 25.65/26.00  (step t304 (cl (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))))) :rule resolution :premises (t299 t300 t301 t302 t303))
% 25.65/26.00  (step t305 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule reordering :premises (t304))
% 25.65/26.00  (step t306 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule contraction :premises (t305))
% 25.65/26.00  (step t307 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule resolution :premises (t298 t306))
% 25.65/26.00  (step t308 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)))) :rule implies_neg2)
% 25.65/26.00  (step t309 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)))) :rule resolution :premises (t307 t308))
% 25.65/26.00  (step t310 (cl (=> (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)))) :rule contraction :premises (t309))
% 25.65/26.00  (step t311 (cl (not (and (tptp.ssList tptp.sk3) (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6)) (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil)) (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule implies :premises (t310))
% 25.65/26.00  (step t312 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil)))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule resolution :premises (t297 t311))
% 25.65/26.00  (step t313 (cl (not (tptp.ssList tptp.sk3)) (not (= tptp.sk3 (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6))) (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil)) (not (= tptp.sk6 (tptp.app tptp.sk6 tptp.nil))) (not (= (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) (tptp.app (tptp.cons tptp.sk5 tptp.nil) (tptp.app tptp.sk6 tptp.nil))))) :rule reordering :premises (t312))
% 25.65/26.00  (step t314 (cl (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) :rule resolution :premises (t313 a187 t269 t283 t294))
% 25.65/26.00  (step t315 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (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)
% 25.65/26.00  (anchor :step t316)
% 25.65/26.00  (assume t316.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))))
% 25.65/26.00  (step t316.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule forall_inst :args ((:= U (tptp.cons tptp.sk5 tptp.nil)) (:= V tptp.sk6) (:= W tptp.nil)))
% 25.65/26.00  (step t316.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule or :premises (t316.t1))
% 25.65/26.00  (step t316.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t316.t2 t316.a0))
% 25.65/26.00  (step t316 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule subproof :discharge (t316.a0))
% 25.65/26.00  (step t317 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t315 t316))
% 25.65/26.00  (step t318 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule implies_neg2)
% 25.65/26.00  (step t319 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule resolution :premises (t317 t318))
% 25.65/26.00  (step t320 (cl (=> (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)))) :rule contraction :premises (t319))
% 25.65/26.00  (step t321 (cl (not (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app (tptp.app U V) W))) (tptp.segmentP (tptp.app (tptp.app U V) W) V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule implies :premises (t320))
% 25.65/26.00  (step t322 (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)
% 25.65/26.00  (anchor :step t323 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W) (X $$unsorted) (:= X X)))
% 25.65/26.00  (step t323.t1 (cl (= U U)) :rule refl)
% 25.65/26.00  (step t323.t2 (cl (= V V)) :rule refl)
% 25.65/26.00  (step t323.t3 (cl (= W W)) :rule refl)
% 25.65/26.00  (step t323.t4 (cl (= X X)) :rule refl)
% 25.65/26.00  (step t323.t5 (cl (= (= (tptp.app (tptp.app U V) W) X) (= X (tptp.app (tptp.app U V) W)))) :rule all_simplify)
% 25.65/26.00  (step t323.t6 (cl (= (not (= (tptp.app (tptp.app U V) W) X)) (not (= X (tptp.app (tptp.app U V) W))))) :rule cong :premises (t323.t5))
% 25.65/26.00  (step t323.t7 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 25.65/26.00  (step t323.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.00  (step t323.t9 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.00  (step t323.t10 (cl (= (not (tptp.ssList X)) (not (tptp.ssList X)))) :rule refl)
% 25.65/26.00  (step t323.t11 (cl (= (tptp.segmentP X V) (tptp.segmentP X V))) :rule refl)
% 25.65/26.00  (step t323.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 (t323.t6 t323.t7 t323.t8 t323.t9 t323.t10 t323.t11))
% 25.65/26.00  (step t323 (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)
% 25.65/26.00  (step t324 (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)
% 25.65/26.00  (anchor :step t325 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 25.65/26.00  (step t325.t1 (cl (= U U)) :rule refl)
% 25.65/26.00  (step t325.t2 (cl (= V V)) :rule refl)
% 25.65/26.00  (step t325.t3 (cl (= W W)) :rule refl)
% 25.65/26.00  (step t325.t4 (cl (= (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W)) true)) :rule all_simplify)
% 25.65/26.00  (step t325.t5 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) (not true))) :rule cong :premises (t325.t4))
% 25.65/26.00  (step t325.t6 (cl (= (not true) false)) :rule all_simplify)
% 25.65/26.00  (step t325.t7 (cl (= (not (= (tptp.app (tptp.app U V) W) (tptp.app (tptp.app U V) W))) false)) :rule trans :premises (t325.t5 t325.t6))
% 25.65/26.00  (step t325.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 25.65/26.00  (step t325.t9 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.00  (step t325.t10 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.00  (step t325.t11 (cl (= (not (tptp.ssList (tptp.app (tptp.app U V) W))) (not (tptp.ssList (tptp.app (tptp.app U V) W))))) :rule refl)
% 25.65/26.00  (step t325.t12 (cl (= (tptp.segmentP (tptp.app (tptp.app U V) W) V) (tptp.segmentP (tptp.app (tptp.app U V) W) V))) :rule refl)
% 25.65/26.00  (step t325.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 (t325.t7 t325.t8 t325.t9 t325.t10 t325.t11 t325.t12))
% 25.65/26.00  (step t325.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)
% 25.65/26.00  (step t325.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 (t325.t13 t325.t14))
% 25.65/26.00  (step t325 (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)
% 25.65/26.00  (step t326 (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 (t324 t325))
% 25.65/26.00  (step t327 (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 (t323 t326))
% 25.65/26.00  (step t328 (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 (t322 t327 a172))
% 25.65/26.00  (step t329 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6))) :rule resolution :premises (t321 t328))
% 25.65/26.00  (step t330 (cl (tptp.segmentP (tptp.app (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) tptp.nil) tptp.sk6)) :rule resolution :premises (t296 a7 t188 t230 t314 t329))
% 25.65/26.00  (step t331 (cl (tptp.segmentP tptp.sk3 tptp.sk6)) :rule resolution :premises (t268 t269 t283 t294 t330))
% 25.65/26.00  (step t332 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t333)
% 25.65/26.00  (assume t333.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))
% 25.65/26.00  (step t333.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule forall_inst :args ((:= A tptp.sk6)))
% 25.65/26.00  (step t333.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule or :premises (t333.t1))
% 25.65/26.00  (step t333.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule resolution :premises (t333.t2 t333.a0))
% 25.65/26.00  (step t333 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule subproof :discharge (t333.a0))
% 25.65/26.00  (step t334 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule resolution :premises (t332 t333))
% 25.65/26.00  (step t335 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule implies_neg2)
% 25.65/26.00  (step t336 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule resolution :premises (t334 t335))
% 25.65/26.00  (step t337 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6))))) :rule contraction :premises (t336))
% 25.65/26.00  (step t338 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule implies :premises (t337))
% 25.65/26.00  (step t339 (cl (not (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))))) (not (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))) :rule equiv_pos2)
% 25.65/26.00  (step t340 (cl (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))))) :rule all_simplify)
% 25.65/26.00  (step t341 (cl (= tptp.nil tptp.nil)) :rule refl)
% 25.65/26.00  (step t342 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t103))
% 25.65/26.00  (step t343 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk4))) :rule cong :premises (t341 t342))
% 25.65/26.00  (anchor :step t344 :args ((A $$unsorted) (:= A A)))
% 25.65/26.00  (step t344.t1 (cl (= A A)) :rule refl)
% 25.65/26.00  (step t344.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 25.65/26.00  (step t344.t3 (cl (= (not (tptp.neq A tptp.nil)) (not (tptp.neq A tptp.nil)))) :rule refl)
% 25.65/26.00  (step t344.t4 (cl (= A A)) :rule refl)
% 25.65/26.00  (step t344.t5 (cl (= (tptp.segmentP tptp.sk2 A) (tptp.segmentP tptp.sk4 A))) :rule cong :premises (t342 t344.t4))
% 25.65/26.00  (step t344.t6 (cl (= (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk4 A)))) :rule cong :premises (t344.t5))
% 25.65/26.00  (step t344.t7 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t103))
% 25.65/26.00  (step t344.t8 (cl (= (tptp.segmentP tptp.sk1 A) (tptp.segmentP tptp.sk3 A))) :rule cong :premises (t344.t7 t344.t4))
% 25.65/26.00  (step t344.t9 (cl (= (not (tptp.segmentP tptp.sk1 A)) (not (tptp.segmentP tptp.sk3 A)))) :rule cong :premises (t344.t8))
% 25.65/26.00  (step t344.t10 (cl (= (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 A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule cong :premises (t344.t2 t344.t3 t344.t6 t344.t9))
% 25.65/26.00  (step t344 (cl (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))) :rule bind)
% 25.65/26.00  (step t345 (cl (= (or (= tptp.nil tptp.sk2) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))))) :rule cong :premises (t343 t344))
% 25.65/26.00  (step t346 (cl (= (forall ((A $$unsorted)) (or (= tptp.nil tptp.sk2) (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))))) :rule trans :premises (t340 t345))
% 25.65/26.00  (step t347 (cl (or (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))) :rule resolution :premises (t339 t346 a197))
% 25.65/26.00  (step t348 (cl (= tptp.nil tptp.sk4) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule or :premises (t347))
% 25.65/26.00  (step t349 (cl (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule resolution :premises (t348 t186))
% 25.65/26.00  (step t350 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.neq tptp.sk6 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk6)) (not (tptp.segmentP tptp.sk3 tptp.sk6)))) :rule resolution :premises (t338 t349))
% 25.65/26.00  (step t351 (cl (not (tptp.neq tptp.sk6 tptp.nil))) :rule resolution :premises (t190 t188 t251 t331 t350))
% 25.65/26.00  (step t352 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t353)
% 25.65/26.00  (assume t353.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 25.65/26.00  (step t353.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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk6)))
% 25.65/26.00  (step t353.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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule or :premises (t353.t1))
% 25.65/26.00  (step t353.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule resolution :premises (t353.t2 t353.a0))
% 25.65/26.00  (step t353 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule subproof :discharge (t353.a0))
% 25.65/26.00  (step t354 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule resolution :premises (t352 t353))
% 25.65/26.00  (step t355 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule implies_neg2)
% 25.65/26.00  (step t356 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) (=> (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule resolution :premises (t354 t355))
% 25.65/26.00  (step t357 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6)))) :rule contraction :premises (t356))
% 25.65/26.00  (step t358 (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.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule implies :premises (t357))
% 25.65/26.00  (step t359 (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)
% 25.65/26.00  (anchor :step t360 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 25.65/26.00  (step t360.t1 (cl (= U U)) :rule refl)
% 25.65/26.00  (step t360.t2 (cl (= V V)) :rule refl)
% 25.65/26.00  (step t360.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 25.65/26.00  (step t360.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 25.65/26.00  (step t360.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 25.65/26.00  (step t360.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 25.65/26.00  (step t360.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 (t360.t3 t360.t4 t360.t5 t360.t6))
% 25.65/26.00  (step t360 (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)
% 25.65/26.00  (step t361 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t359 t360 a99))
% 25.65/26.00  (step t362 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk6)) (tptp.neq tptp.sk6 tptp.nil) (= tptp.nil tptp.sk6))) :rule resolution :premises (t358 t361))
% 25.65/26.00  (step t363 (cl (= tptp.nil tptp.sk6)) :rule resolution :premises (t97 a7 t188 t351 t362))
% 25.65/26.00  (step t364 (cl (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule or_pos)
% 25.65/26.00  (step t365 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule reordering :premises (t364))
% 25.65/26.00  (step t366 (cl (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)) :rule or_pos)
% 25.65/26.00  (step t367 (cl (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule reordering :premises (t366))
% 25.65/26.00  (step t368 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t369)
% 25.65/26.00  (assume t369.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 25.65/26.00  (step t369.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 25.65/26.00  (step t369.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule or :premises (t369.t1))
% 25.65/26.00  (step t369.t3 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t369.t2 t369.a0))
% 25.65/26.00  (step t369 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule subproof :discharge (t369.a0))
% 25.65/26.00  (step t370 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t368 t369))
% 25.65/26.00  (step t371 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule implies_neg2)
% 25.65/26.00  (step t372 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule resolution :premises (t370 t371))
% 25.65/26.00  (step t373 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule contraction :premises (t372))
% 25.65/26.00  (step t374 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule implies :premises (t373))
% 25.65/26.00  (step t375 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t374 a56))
% 25.65/26.00  (step t376 (cl (tptp.segmentP tptp.sk4 tptp.sk4)) :rule resolution :premises (t367 a188 t375))
% 25.65/26.00  (step t377 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t378)
% 25.65/26.00  (assume t378.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))))
% 25.65/26.00  (step t378.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule forall_inst :args ((:= A tptp.sk4)))
% 25.65/26.00  (step t378.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule or :premises (t378.t1))
% 25.65/26.00  (step t378.t3 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t378.t2 t378.a0))
% 25.65/26.00  (step t378 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule subproof :discharge (t378.a0))
% 25.65/26.00  (step t379 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t377 t378))
% 25.65/26.00  (step t380 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule implies_neg2)
% 25.65/26.00  (step t381 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t379 t380))
% 25.65/26.00  (step t382 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule contraction :premises (t381))
% 25.65/26.00  (step t383 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule implies :premises (t382))
% 25.65/26.00  (step t384 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t383 t349))
% 25.65/26.00  (step t385 (cl (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t365 t187 a188 t376 t384))
% 25.65/26.00  (step t386 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) :rule or_pos)
% 25.65/26.00  (step t387 (cl (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))))) :rule reordering :premises (t386))
% 25.65/26.00  (step t388 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) (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))))) :rule implies_neg1)
% 25.65/26.00  (anchor :step t389)
% 25.65/26.00  (assume t389.a0 (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)))))
% 25.65/26.00  (step t389.t1 (cl (or (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.sk6)))
% 25.65/26.00  (step t389.t2 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) :rule or :premises (t389.t1))
% 25.65/26.00  (step t389.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) :rule resolution :premises (t389.t2 t389.a0))
% 25.65/26.00  (step t389 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) :rule subproof :discharge (t389.a0))
% 25.65/26.00  (step t390 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) :rule resolution :premises (t388 t389))
% 25.65/26.00  (step t391 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))))) :rule implies_neg2)
% 25.65/26.00  (step t392 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))))) :rule resolution :premises (t390 t391))
% 25.65/26.00  (step t393 (cl (=> (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)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))))) :rule contraction :premises (t392))
% 25.65/26.00  (step t394 (cl (not (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))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) :rule implies :premises (t393))
% 25.65/26.00  (step t395 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.sk6)) (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6)))) :rule resolution :premises (t394 a119))
% 25.65/26.00  (step t396 (cl (= (tptp.app (tptp.cons tptp.sk5 tptp.nil) tptp.sk6) (tptp.cons tptp.sk5 tptp.sk6))) :rule resolution :premises (t387 t229 t188 t395))
% 25.65/26.00  (step t397 (cl) :rule resolution :premises (t81 t95 t363 t385 t396 t224 t213 t269 t376))
% 25.65/26.00  
% 25.65/26.00  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.eiVuASAQwe/cvc5---1.0.5_2915.smt2
% 25.65/26.00  % cvc5---1.0.5 exiting
% 25.65/26.00  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------