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

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 18:00:19 EDT 2024

% Result   : Unsatisfiable 26.01s 26.23s
% Output   : Proof 26.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : SWC089-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.15  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n028.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sun May 26 14:41:24 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.54  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.54  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.54/10.73  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.50/15.76  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.60/20.78  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.62/25.83  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 26.01/26.23  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.BS13DyQ30A/cvc5---1.0.5_28593.smt2
% 26.01/26.23  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.BS13DyQ30A/cvc5---1.0.5_28593.smt2
% 26.01/26.29  (assume a0 (tptp.equalelemsP tptp.nil))
% 26.01/26.29  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 26.01/26.29  (assume a2 (tptp.strictorderedP tptp.nil))
% 26.01/26.29  (assume a3 (tptp.totalorderedP tptp.nil))
% 26.01/26.29  (assume a4 (tptp.strictorderP tptp.nil))
% 26.01/26.29  (assume a5 (tptp.totalorderP tptp.nil))
% 26.01/26.29  (assume a6 (tptp.cyclefreeP tptp.nil))
% 26.01/26.29  (assume a7 (tptp.ssList tptp.nil))
% 26.01/26.29  (assume a8 (tptp.ssItem tptp.skac3))
% 26.01/26.29  (assume a9 (tptp.ssItem tptp.skac2))
% 26.01/26.29  (assume a10 (not (tptp.singletonP tptp.nil)))
% 26.01/26.29  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 26.01/26.29  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 26.01/26.29  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 26.01/26.29  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 26.01/26.29  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 26.01/26.29  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 26.01/26.29  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 26.01/26.29  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 26.01/26.29  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 26.01/26.29  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 26.01/26.29  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 26.01/26.29  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 26.01/26.29  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 26.01/26.29  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 26.01/26.29  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 26.01/26.29  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 26.01/26.29  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 26.01/26.29  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 26.01/26.29  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 26.01/26.29  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 26.01/26.29  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 26.01/26.29  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 26.01/26.29  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 26.01/26.29  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 26.01/26.29  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 26.01/26.29  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 26.01/26.29  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 26.01/26.29  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 26.01/26.29  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 26.01/26.29  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 26.01/26.29  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 26.01/26.29  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 26.01/26.29  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 26.01/26.29  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 26.01/26.29  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 26.01/26.29  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 26.01/26.29  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 26.01/26.29  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 26.01/26.29  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 26.01/26.29  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 26.01/26.29  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 26.01/26.29  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 26.01/26.29  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 26.01/26.29  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 26.01/26.29  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 26.01/26.29  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.01/26.29  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 26.01/26.29  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 26.01/26.29  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 26.01/26.29  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 26.01/26.29  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 26.01/26.29  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 26.01/26.29  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 26.01/26.29  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 26.01/26.29  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 26.01/26.29  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 26.01/26.29  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 26.01/26.29  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 26.01/26.29  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 26.01/26.29  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 26.01/26.29  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 26.01/26.29  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 26.01/26.29  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 26.01/26.29  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.01/26.29  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.01/26.29  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.01/26.29  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.01/26.29  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 26.01/26.29  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.01/26.29  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 26.01/26.29  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.01/26.29  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 26.01/26.29  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 26.01/26.29  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.01/26.29  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.01/26.29  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 26.01/26.29  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 26.01/26.29  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 26.01/26.29  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 26.01/26.29  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 26.01/26.29  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.01/26.29  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 26.01/26.29  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.01/26.29  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 26.01/26.29  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 26.01/26.29  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 26.01/26.29  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.01/26.29  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 26.01/26.29  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 26.01/26.29  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 26.01/26.29  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 26.01/26.29  (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))))
% 26.01/26.29  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 26.01/26.29  (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))))
% 26.01/26.29  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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))))
% 26.01/26.29  (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)))))
% 26.01/26.29  (assume a185 (tptp.ssList tptp.sk1))
% 26.01/26.29  (assume a186 (tptp.ssList tptp.sk2))
% 26.01/26.29  (assume a187 (tptp.ssList tptp.sk3))
% 26.01/26.29  (assume a188 (tptp.ssList tptp.sk4))
% 26.01/26.29  (assume a189 (= tptp.sk2 tptp.sk4))
% 26.01/26.29  (assume a190 (= tptp.sk1 tptp.sk3))
% 26.01/26.29  (assume a191 (tptp.neq tptp.sk2 tptp.nil))
% 26.01/26.29  (assume a192 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))))
% 26.01/26.29  (assume a193 (or (= tptp.nil tptp.sk3) (not (= tptp.nil tptp.sk4))))
% 26.01/26.29  (assume a194 (or (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk3 tptp.nil)))
% 26.01/26.29  (assume a195 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))))
% 26.01/26.29  (step t1 (cl (not (= (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) (not (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule equiv_pos2)
% 26.01/26.29  (step t2 (cl (= (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule refl)
% 26.01/26.29  (step t3 (cl (= (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.nil (tptp.tl tptp.sk3))))) :rule refl)
% 26.01/26.29  (step t4 (cl (= (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule refl)
% 26.01/26.29  (step t5 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))))) :rule refl)
% 26.01/26.29  (step t6 (cl (= (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule refl)
% 26.01/26.29  (step t7 (cl (= (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) true) (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.29  (step t8 (cl (not (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) true)) (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv1 :premises (t7))
% 26.01/26.29  (step t9 (cl (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) (= (tptp.segmentP tptp.sk4 tptp.sk3) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))))) :rule all_simplify)
% 26.01/26.29  (step t10 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule refl)
% 26.01/26.29  (step t11 (cl (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule all_simplify)
% 26.01/26.29  (step t12 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule cong :premises (t10 t11))
% 26.01/26.29  (step t13 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3)) true)) :rule all_simplify)
% 26.01/26.29  (step t14 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) true)) :rule trans :premises (t12 t13))
% 26.01/26.29  (step t15 (cl (= (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) true)) :rule trans :premises (t9 t14))
% 26.01/26.29  (step t16 (cl (= (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t8 t15))
% 26.01/26.29  (step t17 (cl (= (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule refl)
% 26.01/26.29  (step t18 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule refl)
% 26.01/26.29  (step t19 (cl (= (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule cong :premises (t2 t3 t4 t5 t6 t16 t17 t18))
% 26.01/26.29  (step t20 (cl (not (= (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) (not (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule equiv_pos2)
% 26.01/26.29  (step t21 (cl (= (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule refl)
% 26.01/26.29  (step t22 (cl (= (= (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule equiv_simplify)
% 26.01/26.29  (step t23 (cl (= (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) (not (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule equiv2 :premises (t22))
% 26.01/26.29  (step t24 (cl (not (not (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule not_not)
% 26.01/26.29  (step t25 (cl (= (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t23 t24))
% 26.01/26.29  (step t26 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule implies_neg1)
% 26.01/26.29  (anchor :step t27)
% 26.01/26.29  (assume t27.a0 (not (tptp.segmentP tptp.sk4 tptp.sk3)))
% 26.01/26.29  (assume t27.a1 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 26.01/26.29  (assume t27.a2 (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 26.01/26.29  (assume t27.a3 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 26.01/26.29  (assume t27.a4 (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))
% 26.01/26.29  (assume t27.a5 (= tptp.nil (tptp.tl tptp.sk3)))
% 26.01/26.29  (assume t27.a6 (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))
% 26.01/26.29  (assume t27.a7 (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))
% 26.01/26.29  (step t27.t1 (cl (not (= (= true false) false)) (not (= true false)) false) :rule equiv_pos2)
% 26.01/26.29  (step t27.t2 (cl (= (= true false) false)) :rule all_simplify)
% 26.01/26.29  (step t27.t3 (cl (= (= (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) true) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule equiv_simplify)
% 26.01/26.29  (step t27.t4 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) true) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule equiv2 :premises (t27.t3))
% 26.01/26.29  (step t27.t5 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) true)) :rule resolution :premises (t27.t4 t27.a7))
% 26.01/26.29  (step t27.t6 (cl (= true (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule symm :premises (t27.t5))
% 26.01/26.29  (step t27.t7 (cl (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk4)) :rule symm :premises (t27.a2))
% 26.01/26.29  (step t27.t8 (cl (= tptp.nil tptp.nil)) :rule refl)
% 26.01/26.29  (step t27.t9 (cl (= (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.app tptp.sk4 tptp.nil))) :rule cong :premises (t27.t7 t27.t8))
% 26.01/26.29  (step t27.t10 (cl (= (tptp.app tptp.sk4 tptp.nil) tptp.sk4)) :rule symm :premises (t27.a1))
% 26.01/26.29  (step t27.t11 (cl (= (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) tptp.sk4)) :rule trans :premises (t27.t9 t27.t10))
% 26.01/26.29  (step t27.t12 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule symm :premises (t27.a6))
% 26.01/26.29  (step t27.t13 (cl (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) :rule symm :premises (t27.t12))
% 26.01/26.29  (step t27.t14 (cl (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule refl)
% 26.01/26.29  (step t27.t15 (cl (= (tptp.tl tptp.sk3) tptp.nil)) :rule symm :premises (t27.a5))
% 26.01/26.29  (step t27.t16 (cl (= tptp.nil (tptp.tl tptp.sk3))) :rule symm :premises (t27.t15))
% 26.01/26.29  (step t27.t17 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule cong :premises (t27.t14 t27.t16))
% 26.01/26.29  (step t27.t18 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule symm :premises (t27.a4))
% 26.01/26.29  (step t27.t19 (cl (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk3)) :rule symm :premises (t27.a3))
% 26.01/26.29  (step t27.t20 (cl (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.sk3)) :rule trans :premises (t27.t13 t27.t17 t27.t18 t27.t19))
% 26.01/26.29  (step t27.t21 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule cong :premises (t27.t11 t27.t20))
% 26.01/26.29  (step t27.t22 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) false) (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.29  (step t27.t23 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) false) (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule equiv2 :premises (t27.t22))
% 26.01/26.29  (step t27.t24 (cl (not (not (not (tptp.segmentP tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule not_not)
% 26.01/26.29  (step t27.t25 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) false) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t27.t23 t27.t24))
% 26.01/26.29  (step t27.t26 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) false)) :rule resolution :premises (t27.t25 t27.a0))
% 26.01/26.29  (step t27.t27 (cl (= true false)) :rule trans :premises (t27.t6 t27.t21 t27.t26))
% 26.01/26.29  (step t27.t28 (cl false) :rule resolution :premises (t27.t1 t27.t2 t27.t27))
% 26.01/26.29  (step t27 (cl (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) :rule subproof :discharge (t27.a0 t27.a1 t27.a2 t27.a3 t27.a4 t27.a5 t27.a6 t27.a7))
% 26.01/26.29  (step t28 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule and_pos)
% 26.01/26.29  (step t29 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 26.01/26.29  (step t30 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule and_pos)
% 26.01/26.29  (step t31 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.29  (step t32 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.29  (step t33 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.nil (tptp.tl tptp.sk3))) :rule and_pos)
% 26.01/26.29  (step t34 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) :rule and_pos)
% 26.01/26.29  (step t35 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule and_pos)
% 26.01/26.29  (step t36 (cl false (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t27 t28 t29 t30 t31 t32 t33 t34 t35))
% 26.01/26.29  (step t37 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) false) :rule reordering :premises (t36))
% 26.01/26.29  (step t38 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) false) :rule contraction :premises (t37))
% 26.01/26.29  (step t39 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) false) :rule resolution :premises (t26 t38))
% 26.01/26.29  (step t40 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) (not false)) :rule implies_neg2)
% 26.01/26.29  (step t41 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false)) :rule resolution :premises (t39 t40))
% 26.01/26.29  (step t42 (cl (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false)) :rule contraction :premises (t41))
% 26.01/26.29  (step t43 (cl (= (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule implies_simplify)
% 26.01/26.29  (step t44 (cl (not (=> (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false)) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule equiv1 :premises (t43))
% 26.01/26.29  (step t45 (cl (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t42 t44))
% 26.01/26.29  (step t46 (cl (= (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false)) :rule resolution :premises (t25 t45))
% 26.01/26.29  (step t47 (cl (= (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) false))) :rule cong :premises (t21 t46))
% 26.01/26.29  (step t48 (cl (= (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) false) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule all_simplify)
% 26.01/26.29  (step t49 (cl (= (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule trans :premises (t47 t48))
% 26.01/26.29  (step t50 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule implies_neg1)
% 26.01/26.29  (anchor :step t51)
% 26.01/26.29  (assume t51.a0 (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 26.01/26.29  (assume t51.a1 (= tptp.nil (tptp.tl tptp.sk3)))
% 26.01/26.29  (assume t51.a2 (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))
% 26.01/26.29  (assume t51.a3 (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))
% 26.01/26.29  (assume t51.a4 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 26.01/26.29  (assume t51.a5 (not (tptp.segmentP tptp.sk4 tptp.sk3)))
% 26.01/26.29  (assume t51.a6 (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))
% 26.01/26.29  (assume t51.a7 (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))
% 26.01/26.29  (step t51.t1 (cl (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule and_neg)
% 26.01/26.29  (step t51.t2 (cl (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t51.t1 t51.a5 t51.a2 t51.a0 t51.a4 t51.a7 t51.a1 t51.a3 t51.a6))
% 26.01/26.29  (step t51 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule subproof :discharge (t51.a0 t51.a1 t51.a2 t51.a3 t51.a4 t51.a5 t51.a6 t51.a7))
% 26.01/26.29  (step t52 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule and_pos)
% 26.01/26.29  (step t53 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= tptp.nil (tptp.tl tptp.sk3))) :rule and_pos)
% 26.01/26.29  (step t54 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule and_pos)
% 26.01/26.29  (step t55 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) :rule and_pos)
% 26.01/26.29  (step t56 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.29  (step t57 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule and_pos)
% 26.01/26.29  (step t58 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule and_pos)
% 26.01/26.29  (step t59 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.29  (step t60 (cl (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t51 t52 t53 t54 t55 t56 t57 t58 t59))
% 26.01/26.29  (step t61 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule reordering :premises (t60))
% 26.01/26.29  (step t62 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule contraction :premises (t61))
% 26.01/26.29  (step t63 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t50 t62))
% 26.01/26.29  (step t64 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 26.01/26.29  (step t65 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t63 t64))
% 26.01/26.29  (step t66 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (and (not (tptp.segmentP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule contraction :premises (t65))
% 26.01/26.29  (step t67 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.nil (tptp.tl tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t20 t49 t66))
% 26.01/26.29  (step t68 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule not_and :premises (t67))
% 26.01/26.29  (step t69 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule or_neg)
% 26.01/26.29  (step t70 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= tptp.nil (tptp.tl tptp.sk3))))) :rule or_neg)
% 26.01/26.29  (step t71 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule or_neg)
% 26.01/26.29  (step t72 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))))) :rule or_neg)
% 26.01/26.29  (step t73 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule or_neg)
% 26.01/26.29  (step t74 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (not (tptp.segmentP tptp.sk4 tptp.sk3))))) :rule or_neg)
% 26.01/26.29  (step t75 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule or_neg)
% 26.01/26.29  (step t76 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule or_neg)
% 26.01/26.29  (step t77 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t68 t69 t70 t71 t72 t73 t74 t75 t76))
% 26.01/26.29  (step t78 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (not (tptp.segmentP tptp.sk4 tptp.sk3))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule contraction :premises (t77))
% 26.01/26.29  (step t79 (cl (or (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t1 t19 t78))
% 26.01/26.29  (step t80 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule or :premises (t79))
% 26.01/26.29  (step t81 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.nil (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule reordering :premises (t80))
% 26.01/26.29  (step t82 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3))) :rule or_pos)
% 26.01/26.29  (step t83 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (= tptp.nil (tptp.tl tptp.sk3)) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3))))) :rule reordering :premises (t82))
% 26.01/26.29  (step t84 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)) :rule or_pos)
% 26.01/26.29  (step t85 (cl (= tptp.nil tptp.sk3) (tptp.ssList (tptp.tl tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t84))
% 26.01/26.29  (step t86 (cl (not (= (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (tptp.neq tptp.sk3 tptp.sk3)))) (not (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3))))) (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (tptp.neq tptp.sk3 tptp.sk3))) :rule equiv_pos2)
% 26.01/26.29  (step t87 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 26.01/26.29  (step t88 (cl (= (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.neq tptp.sk3 tptp.nil)))) :rule refl)
% 26.01/26.29  (step t89 (cl (= (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) true) (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.29  (step t90 (cl (not (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) true)) (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3))) :rule equiv1 :premises (t89))
% 26.01/26.29  (step t91 (cl (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) (= (tptp.neq tptp.sk3 tptp.sk3) (not (not (tptp.neq tptp.sk3 tptp.sk3)))))) :rule all_simplify)
% 26.01/26.29  (step t92 (cl (= (tptp.neq tptp.sk3 tptp.sk3) (tptp.neq tptp.sk3 tptp.sk3))) :rule refl)
% 26.01/26.29  (step t93 (cl (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3))) :rule all_simplify)
% 26.01/26.29  (step t94 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (= (tptp.neq tptp.sk3 tptp.sk3) (tptp.neq tptp.sk3 tptp.sk3)))) :rule cong :premises (t92 t93))
% 26.01/26.29  (step t95 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) (tptp.neq tptp.sk3 tptp.sk3)) true)) :rule all_simplify)
% 26.01/26.29  (step t96 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) true)) :rule trans :premises (t94 t95))
% 26.01/26.29  (step t97 (cl (= (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3)) true)) :rule trans :premises (t91 t96))
% 26.01/26.29  (step t98 (cl (= (not (not (tptp.neq tptp.sk3 tptp.sk3))) (tptp.neq tptp.sk3 tptp.sk3))) :rule resolution :premises (t90 t97))
% 26.01/26.29  (step t99 (cl (= (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (tptp.neq tptp.sk3 tptp.sk3)))) :rule cong :premises (t87 t88 t98))
% 26.01/26.29  (step t100 (cl (not (= (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))))) (not (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule equiv_pos2)
% 26.01/26.29  (step t101 (cl (= (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule refl)
% 26.01/26.29  (step t102 (cl (= (= (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))))) :rule equiv_simplify)
% 26.01/26.29  (step t103 (cl (= (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (not (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))))) :rule equiv2 :premises (t102))
% 26.01/26.29  (step t104 (cl (not (not (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule not_not)
% 26.01/26.29  (step t105 (cl (= (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule resolution :premises (t103 t104))
% 26.01/26.29  (step t106 (cl (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule implies_neg1)
% 26.01/26.29  (anchor :step t107)
% 26.01/26.29  (assume t107.a0 (tptp.neq tptp.sk3 tptp.nil))
% 26.01/26.29  (assume t107.a1 (= tptp.nil tptp.sk3))
% 26.01/26.29  (assume t107.a2 (not (tptp.neq tptp.sk3 tptp.sk3)))
% 26.01/26.29  (step t107.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 26.01/26.29  (step t107.t2 (cl (= (= false true) false)) :rule all_simplify)
% 26.01/26.29  (step t107.t3 (cl (= (= (tptp.neq tptp.sk3 tptp.sk3) false) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.29  (step t107.t4 (cl (= (tptp.neq tptp.sk3 tptp.sk3) false) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule equiv2 :premises (t107.t3))
% 26.01/26.29  (step t107.t5 (cl (not (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (tptp.neq tptp.sk3 tptp.sk3)) :rule not_not)
% 26.01/26.29  (step t107.t6 (cl (= (tptp.neq tptp.sk3 tptp.sk3) false) (tptp.neq tptp.sk3 tptp.sk3)) :rule resolution :premises (t107.t4 t107.t5))
% 26.01/26.29  (step t107.t7 (cl (= (tptp.neq tptp.sk3 tptp.sk3) false)) :rule resolution :premises (t107.t6 t107.a2))
% 26.01/26.29  (step t107.t8 (cl (= false (tptp.neq tptp.sk3 tptp.sk3))) :rule symm :premises (t107.t7))
% 26.01/26.29  (step t107.t9 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 26.01/26.29  (step t107.t10 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t107.a1))
% 26.01/26.29  (step t107.t11 (cl (= (tptp.neq tptp.sk3 tptp.sk3) (tptp.neq tptp.sk3 tptp.nil))) :rule cong :premises (t107.t9 t107.t10))
% 26.01/26.29  (step t107.t12 (cl (= (= (tptp.neq tptp.sk3 tptp.nil) true) (tptp.neq tptp.sk3 tptp.nil))) :rule equiv_simplify)
% 26.01/26.29  (step t107.t13 (cl (= (tptp.neq tptp.sk3 tptp.nil) true) (not (tptp.neq tptp.sk3 tptp.nil))) :rule equiv2 :premises (t107.t12))
% 26.01/26.29  (step t107.t14 (cl (= (tptp.neq tptp.sk3 tptp.nil) true)) :rule resolution :premises (t107.t13 t107.a0))
% 26.01/26.29  (step t107.t15 (cl (= false true)) :rule trans :premises (t107.t8 t107.t11 t107.t14))
% 26.01/26.29  (step t107.t16 (cl false) :rule resolution :premises (t107.t1 t107.t2 t107.t15))
% 26.01/26.29  (step t107 (cl (not (tptp.neq tptp.sk3 tptp.nil)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) false) :rule subproof :discharge (t107.a0 t107.a1 t107.a2))
% 26.01/26.29  (step t108 (cl (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (tptp.neq tptp.sk3 tptp.nil)) :rule and_pos)
% 26.01/26.29  (step t109 (cl (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 26.01/26.29  (step t110 (cl (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.sk3))) :rule and_pos)
% 26.01/26.29  (step t111 (cl false (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule resolution :premises (t107 t108 t109 t110))
% 26.01/26.29  (step t112 (cl (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) false) :rule reordering :premises (t111))
% 26.01/26.29  (step t113 (cl (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) false) :rule contraction :premises (t112))
% 26.01/26.29  (step t114 (cl (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) false) :rule resolution :premises (t106 t113))
% 26.01/26.29  (step t115 (cl (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (not false)) :rule implies_neg2)
% 26.01/26.29  (step t116 (cl (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false)) :rule resolution :premises (t114 t115))
% 26.01/26.29  (step t117 (cl (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false)) :rule contraction :premises (t116))
% 26.01/26.29  (step t118 (cl (= (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))))) :rule implies_simplify)
% 26.01/26.29  (step t119 (cl (not (=> (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false)) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule equiv1 :premises (t118))
% 26.01/26.29  (step t120 (cl (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule resolution :premises (t117 t119))
% 26.01/26.29  (step t121 (cl (= (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) false)) :rule resolution :premises (t105 t120))
% 26.01/26.29  (step t122 (cl (= (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) false))) :rule cong :premises (t101 t121))
% 26.01/26.29  (step t123 (cl (= (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) false) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))))) :rule all_simplify)
% 26.01/26.29  (step t124 (cl (= (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))))) :rule trans :premises (t122 t123))
% 26.01/26.29  (step t125 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule implies_neg1)
% 26.01/26.29  (anchor :step t126)
% 26.01/26.29  (assume t126.a0 (= tptp.nil tptp.sk3))
% 26.01/26.29  (assume t126.a1 (tptp.neq tptp.sk3 tptp.nil))
% 26.01/26.29  (assume t126.a2 (not (tptp.neq tptp.sk3 tptp.sk3)))
% 26.01/26.29  (step t126.t1 (cl (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (tptp.neq tptp.sk3 tptp.nil)) (not (= tptp.nil tptp.sk3)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule and_neg)
% 26.01/26.29  (step t126.t2 (cl (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule resolution :premises (t126.t1 t126.a1 t126.a0 t126.a2))
% 26.01/26.29  (step t126 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule subproof :discharge (t126.a0 t126.a1 t126.a2))
% 26.01/26.29  (step t127 (cl (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 26.01/26.29  (step t128 (cl (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (tptp.neq tptp.sk3 tptp.nil)) :rule and_pos)
% 26.01/26.29  (step t129 (cl (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.sk3))) :rule and_pos)
% 26.01/26.29  (step t130 (cl (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule resolution :premises (t126 t127 t128 t129))
% 26.01/26.29  (step t131 (cl (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule reordering :premises (t130))
% 26.01/26.29  (step t132 (cl (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3)))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule contraction :premises (t131))
% 26.01/26.29  (step t133 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule resolution :premises (t125 t132))
% 26.01/26.29  (step t134 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule implies_neg2)
% 26.01/26.29  (step t135 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3)))) (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule resolution :premises (t133 t134))
% 26.01/26.29  (step t136 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))) (and (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule contraction :premises (t135))
% 26.01/26.29  (step t137 (cl (not (and (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule resolution :premises (t100 t124 t136))
% 26.01/26.29  (step t138 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) :rule not_and :premises (t137))
% 26.01/26.29  (step t139 (cl (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 26.01/26.29  (step t140 (cl (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (not (tptp.neq tptp.sk3 tptp.nil)))) :rule or_neg)
% 26.01/26.29  (step t141 (cl (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (not (not (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule or_neg)
% 26.01/26.29  (step t142 (cl (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3)))) (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule resolution :premises (t138 t139 t140 t141))
% 26.01/26.29  (step t143 (cl (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (not (tptp.neq tptp.sk3 tptp.sk3))))) :rule contraction :premises (t142))
% 26.01/26.29  (step t144 (cl (or (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (tptp.neq tptp.sk3 tptp.sk3))) :rule resolution :premises (t86 t99 t143))
% 26.01/26.29  (step t145 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (tptp.neq tptp.sk3 tptp.sk3)) :rule or :premises (t144))
% 26.01/26.29  (step t146 (cl (not (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))) :rule or_pos)
% 26.01/26.29  (step t147 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.sk3)) (not (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule reordering :premises (t146))
% 26.01/26.29  (step t148 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 26.01/26.29  (anchor :step t149)
% 26.01/26.29  (assume t149.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 26.01/26.29  (step t149.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule forall_inst :args ((:= V tptp.sk3)))
% 26.01/26.29  (step t149.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule or :premises (t149.t1))
% 26.01/26.29  (step t149.t3 (cl (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule resolution :premises (t149.t2 t149.a0))
% 26.01/26.29  (step t149 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule subproof :discharge (t149.a0))
% 26.01/26.29  (step t150 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule resolution :premises (t148 t149))
% 26.01/26.29  (step t151 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (not (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule implies_neg2)
% 26.01/26.29  (step t152 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule resolution :premises (t150 t151))
% 26.01/26.29  (step t153 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3))))) :rule contraction :premises (t152))
% 26.01/26.29  (step t154 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule implies :premises (t153))
% 26.01/26.29  (step t155 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U))))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 26.01/26.29  (step t156 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))))) :rule all_simplify)
% 26.01/26.30  (anchor :step t157 :args ((V $$unsorted) (:= V V)))
% 26.01/26.30  (step t157.t1 (cl (= V V)) :rule refl)
% 26.01/26.30  (step t157.t2 (cl (= (= V V) true)) :rule all_simplify)
% 26.01/26.30  (step t157.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t157.t2))
% 26.01/26.30  (step t157.t4 (cl (= (not true) false)) :rule all_simplify)
% 26.01/26.30  (step t157.t5 (cl (= (not (= V V)) false)) :rule trans :premises (t157.t3 t157.t4))
% 26.01/26.30  (step t157.t6 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 26.01/26.30  (step t157.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.01/26.30  (step t157.t8 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))))) :rule cong :premises (t157.t5 t157.t6 t157.t7 t157.t7))
% 26.01/26.30  (step t157.t9 (cl (= (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule all_simplify)
% 26.01/26.30  (step t157.t10 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule trans :premises (t157.t8 t157.t9))
% 26.01/26.30  (step t157 (cl (= (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule bind)
% 26.01/26.30  (step t158 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule trans :premises (t156 t157))
% 26.01/26.30  (step t159 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t155 t158 a114))
% 26.01/26.30  (step t160 (cl (or (not (tptp.neq tptp.sk3 tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule resolution :premises (t154 t159))
% 26.01/26.30  (step t161 (cl (not (tptp.neq tptp.sk3 tptp.sk3))) :rule resolution :premises (t147 a187 t160))
% 26.01/26.30  (step t162 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk3 tptp.nil)) :rule or :premises (a194))
% 26.01/26.30  (step t163 (cl (not (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule equiv_pos2)
% 26.01/26.30  (step t164 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 26.01/26.30  (step t165 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t164 a190 a189))
% 26.01/26.30  (step t166 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t165))
% 26.01/26.30  (step t167 (cl (= tptp.nil tptp.nil)) :rule refl)
% 26.01/26.30  (step t168 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t166 t167))
% 26.01/26.30  (step t169 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t163 t168 a191))
% 26.01/26.30  (step t170 (cl (tptp.neq tptp.sk3 tptp.nil)) :rule resolution :premises (t162 t169))
% 26.01/26.30  (step t171 (cl (not (= tptp.nil tptp.sk3))) :rule resolution :premises (t145 t161 t170))
% 26.01/26.30  (step t172 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t173)
% 26.01/26.30  (assume t173.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 26.01/26.30  (step t173.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.01/26.30  (step t173.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule or :premises (t173.t1))
% 26.01/26.30  (step t173.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t173.t2 t173.a0))
% 26.01/26.30  (step t173 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t173.a0))
% 26.01/26.30  (step t174 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t172 t173))
% 26.01/26.30  (step t175 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t176 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t174 t175))
% 26.01/26.30  (step t177 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t176))
% 26.01/26.30  (step t178 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule implies :premises (t177))
% 26.01/26.30  (step t179 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssList (tptp.tl tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t178 a74))
% 26.01/26.30  (step t180 (cl (tptp.ssList (tptp.tl tptp.sk3))) :rule resolution :premises (t85 t171 a187 t179))
% 26.01/26.30  (step t181 (cl (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule or_pos)
% 26.01/26.30  (step t182 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))))) :rule reordering :premises (t181))
% 26.01/26.30  (step t183 (cl (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule and_neg)
% 26.01/26.30  (step t184 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t185)
% 26.01/26.30  (assume t185.a0 (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 26.01/26.30  (assume t185.a1 (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))
% 26.01/26.30  (assume t185.a2 (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))
% 26.01/26.30  (step t185.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t185.t2)
% 26.01/26.30  (assume t185.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))
% 26.01/26.30  (assume t185.t2.a1 (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))
% 26.01/26.30  (assume t185.t2.a2 (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 26.01/26.30  (step t185.t2.t1 (cl (= (= (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)) true) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.30  (step t185.t2.t2 (cl (not (= (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)) true)) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule equiv1 :premises (t185.t2.t1))
% 26.01/26.30  (step t185.t2.t3 (cl (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.sk4)) :rule symm :premises (t185.t2.a2))
% 26.01/26.30  (step t185.t2.t4 (cl (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule symm :premises (t185.t2.t3))
% 26.01/26.30  (step t185.t2.t5 (cl (= (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.tl tptp.sk3))) :rule symm :premises (t185.t2.a1))
% 26.01/26.30  (step t185.t2.t6 (cl (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) :rule symm :premises (t185.t2.t5))
% 26.01/26.30  (step t185.t2.t7 (cl (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule refl)
% 26.01/26.30  (step t185.t2.t8 (cl (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule cong :premises (t185.t2.t6 t185.t2.t7))
% 26.01/26.30  (step t185.t2.t9 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule trans :premises (t185.t2.t4 t185.t2.t8))
% 26.01/26.30  (step t185.t2.t10 (cl (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) :rule refl)
% 26.01/26.30  (step t185.t2.t11 (cl (= (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule cong :premises (t185.t2.t9 t185.t2.t10))
% 26.01/26.30  (step t185.t2.t12 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.30  (step t185.t2.t13 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule equiv2 :premises (t185.t2.t12))
% 26.01/26.30  (step t185.t2.t14 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) true)) :rule resolution :premises (t185.t2.t13 t185.t2.a0))
% 26.01/26.30  (step t185.t2.t15 (cl (= (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)) true)) :rule trans :premises (t185.t2.t11 t185.t2.t14))
% 26.01/26.30  (step t185.t2.t16 (cl (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule resolution :premises (t185.t2.t2 t185.t2.t15))
% 26.01/26.30  (step t185.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule subproof :discharge (t185.t2.a0 t185.t2.a1 t185.t2.a2))
% 26.01/26.30  (step t185.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) :rule and_pos)
% 26.01/26.30  (step t185.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.30  (step t185.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule and_pos)
% 26.01/26.30  (step t185.t6 (cl (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule resolution :premises (t185.t2 t185.t3 t185.t4 t185.t5))
% 26.01/26.30  (step t185.t7 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule reordering :premises (t185.t6))
% 26.01/26.30  (step t185.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule contraction :premises (t185.t7))
% 26.01/26.30  (step t185.t9 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule resolution :premises (t185.t1 t185.t8))
% 26.01/26.30  (step t185.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t185.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)))) :rule resolution :premises (t185.t9 t185.t10))
% 26.01/26.30  (step t185.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)))) :rule contraction :premises (t185.t11))
% 26.01/26.30  (step t185.t13 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule implies :premises (t185.t12))
% 26.01/26.30  (step t185.t14 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule and_neg)
% 26.01/26.30  (step t185.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t185.t14 t185.a2 t185.a1 t185.a0))
% 26.01/26.30  (step t185.t16 (cl (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule resolution :premises (t185.t13 t185.t15))
% 26.01/26.30  (step t185 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule subproof :discharge (t185.a0 t185.a1 t185.a2))
% 26.01/26.30  (step t186 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule and_pos)
% 26.01/26.30  (step t187 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.30  (step t188 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) :rule and_pos)
% 26.01/26.30  (step t189 (cl (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))))) :rule resolution :premises (t185 t186 t187 t188))
% 26.01/26.30  (step t190 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule reordering :premises (t189))
% 26.01/26.30  (step t191 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule contraction :premises (t190))
% 26.01/26.30  (step t192 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule resolution :premises (t184 t191))
% 26.01/26.30  (step t193 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t194 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)))) :rule resolution :premises (t192 t193))
% 26.01/26.30  (step t195 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)))) :rule contraction :premises (t194))
% 26.01/26.30  (step t196 (cl (not (and (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule implies :premises (t195))
% 26.01/26.30  (step t197 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule resolution :premises (t183 t196))
% 26.01/26.30  (step t198 (cl (not (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3)) (not (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule reordering :premises (t197))
% 26.01/26.30  (step t199 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) :rule equiv_pos2)
% 26.01/26.30  (anchor :step t200 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C) (D $$unsorted) (:= D D)))
% 26.01/26.30  (step t200.t1 (cl (= A A)) :rule refl)
% 26.01/26.30  (step t200.t2 (cl (= B B)) :rule refl)
% 26.01/26.30  (step t200.t3 (cl (= C C)) :rule refl)
% 26.01/26.30  (step t200.t4 (cl (= D D)) :rule refl)
% 26.01/26.30  (step t200.t5 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 26.01/26.30  (step t200.t6 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 26.01/26.30  (step t200.t7 (cl (= (= tptp.sk4 A) (= tptp.sk4 A))) :rule refl)
% 26.01/26.30  (step t200.t8 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 26.01/26.30  (step t200.t9 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 26.01/26.30  (step t200.t10 (cl (= (= (tptp.tl tptp.sk3) B) (= B (tptp.tl tptp.sk3)))) :rule all_simplify)
% 26.01/26.30  (step t200.t11 (cl (= (not (= (tptp.tl tptp.sk3) B)) (not (= B (tptp.tl tptp.sk3))))) :rule cong :premises (t200.t10))
% 26.01/26.30  (step t200.t12 (cl (= (= (tptp.app B C) A) (= A (tptp.app B C)))) :rule all_simplify)
% 26.01/26.30  (step t200.t13 (cl (= (not (= (tptp.app B C) A)) (not (= A (tptp.app B C))))) :rule cong :premises (t200.t12))
% 26.01/26.30  (step t200.t14 (cl (= (not (tptp.ssItem D)) (not (tptp.ssItem D)))) :rule refl)
% 26.01/26.30  (step t200.t15 (cl (= (= (tptp.cons D tptp.nil) C) (= C (tptp.cons D tptp.nil)))) :rule all_simplify)
% 26.01/26.30  (step t200.t16 (cl (= (not (= (tptp.cons D tptp.nil) C)) (not (= C (tptp.cons D tptp.nil))))) :rule cong :premises (t200.t15))
% 26.01/26.30  (step t200.t17 (cl (= (= (tptp.hd tptp.sk3) D) (= D (tptp.hd tptp.sk3)))) :rule all_simplify)
% 26.01/26.30  (step t200.t18 (cl (= (not (= (tptp.hd tptp.sk3) D)) (not (= D (tptp.hd tptp.sk3))))) :rule cong :premises (t200.t17))
% 26.01/26.30  (step t200.t19 (cl (= (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) :rule refl)
% 26.01/26.30  (step t200.t20 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3))))) :rule cong :premises (t200.t5 t200.t6 t200.t7 t200.t8 t200.t9 t200.t11 t200.t13 t200.t14 t200.t16 t200.t18 t200.t19 t200.t19))
% 26.01/26.30  (step t200 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))))) :rule bind)
% 26.01/26.30  (step t201 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)))))) :rule all_simplify)
% 26.01/26.30  (step t202 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3)))))))) :rule all_simplify)
% 26.01/26.30  (step t203 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 26.01/26.30  (step t204 (cl (= (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) :rule refl)
% 26.01/26.30  (step t205 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)))))) :rule all_simplify)
% 26.01/26.30  (step t206 (cl (= (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule refl)
% 26.01/26.30  (step t207 (cl (= (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule refl)
% 26.01/26.30  (step t208 (cl (= (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))))) :rule refl)
% 26.01/26.30  (step t209 (cl (= (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)) true)) :rule all_simplify)
% 26.01/26.30  (step t210 (cl (= (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not true))) :rule cong :premises (t209))
% 26.01/26.30  (step t211 (cl (= (not true) false)) :rule all_simplify)
% 26.01/26.30  (step t212 (cl (= (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) false)) :rule trans :premises (t210 t211))
% 26.01/26.30  (step t213 (cl (= (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule refl)
% 26.01/26.30  (step t214 (cl (= (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) true)) :rule all_simplify)
% 26.01/26.30  (step t215 (cl (= (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not true))) :rule cong :premises (t214))
% 26.01/26.30  (step t216 (cl (= (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) false)) :rule trans :premises (t215 t211))
% 26.01/26.30  (step t217 (cl (= (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) :rule refl)
% 26.01/26.30  (step t218 (cl (= (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) true)) :rule all_simplify)
% 26.01/26.30  (step t219 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not true))) :rule cong :premises (t218))
% 26.01/26.30  (step t220 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false)) :rule trans :premises (t219 t211))
% 26.01/26.30  (step t221 (cl (= (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)) true)) :rule all_simplify)
% 26.01/26.30  (step t222 (cl (= (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3))) (not true))) :rule cong :premises (t221))
% 26.01/26.30  (step t223 (cl (= (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3))) false)) :rule trans :premises (t222 t211))
% 26.01/26.30  (step t224 (cl (= (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false (not (tptp.ssItem (tptp.hd tptp.sk3))) false false))) :rule cong :premises (t206 t207 t208 t212 t213 t216 t217 t220 t223))
% 26.01/26.30  (step t225 (cl (= (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) false (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) false (not (tptp.ssItem (tptp.hd tptp.sk3))) false false) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule all_simplify)
% 26.01/26.30  (step t226 (cl (= (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (= (tptp.hd tptp.sk3) (tptp.hd tptp.sk3)))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t224 t225))
% 26.01/26.30  (step t227 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))))) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t205 t226))
% 26.01/26.30  (step t228 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3)))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))))) :rule cong :premises (t203 t204 t227))
% 26.01/26.30  (step t229 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (or (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule all_simplify)
% 26.01/26.30  (step t230 (cl (= (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= B (tptp.tl tptp.sk3))) (not (tptp.ssList C)) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3)))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t228 t229))
% 26.01/26.30  (step t231 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t202 t230))
% 26.01/26.30  (step t232 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= B (tptp.tl tptp.sk3))) (not (= A (tptp.app B C))) (not (tptp.ssItem D)) (not (= C (tptp.cons D tptp.nil))) (not (= D (tptp.hd tptp.sk3))) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t201 t231))
% 26.01/26.30  (step t233 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.tl tptp.sk3) B)) (not (= (tptp.app B C) A)) (not (tptp.ssItem D)) (not (= (tptp.cons D tptp.nil) C)) (not (= (tptp.hd tptp.sk3) D)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.neq tptp.nil tptp.sk3)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))))) :rule trans :premises (t200 t232))
% 26.01/26.30  (step t234 (cl (or (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3))))) :rule resolution :premises (t199 t233 a195))
% 26.01/26.30  (step t235 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))) :rule or :premises (t234))
% 26.01/26.30  (step t236 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk3)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk3)))) :rule reordering :premises (t235))
% 26.01/26.30  (step t237 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)) :rule or_pos)
% 26.01/26.30  (step t238 (cl (= tptp.nil tptp.sk3) (tptp.neq tptp.nil tptp.sk3) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t237))
% 26.01/26.30  (step t239 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (=> (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))))) (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) (=> (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule equiv_pos2)
% 26.01/26.30  (step t240 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule refl)
% 26.01/26.30  (step t241 (cl (= (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule refl)
% 26.01/26.30  (step t242 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 26.01/26.30  (step t243 (cl (= (tptp.neq tptp.nil tptp.sk3) (tptp.neq tptp.nil tptp.sk3))) :rule refl)
% 26.01/26.30  (step t244 (cl (= (= tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule all_simplify)
% 26.01/26.30  (step t245 (cl (= (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule cong :premises (t241 t242 t243 t244))
% 26.01/26.30  (step t246 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (=> (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))))) :rule cong :premises (t240 t245))
% 26.01/26.30  (step t247 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t248)
% 26.01/26.30  (assume t248.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 26.01/26.30  (step t248.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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.nil)))
% 26.01/26.30  (step t248.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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule or :premises (t248.t1))
% 26.01/26.30  (step t248.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule resolution :premises (t248.t2 t248.a0))
% 26.01/26.30  (step t248 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule subproof :discharge (t248.a0))
% 26.01/26.30  (step t249 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) :rule resolution :premises (t247 t248))
% 26.01/26.30  (step t250 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule implies_neg2)
% 26.01/26.30  (step t251 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil))) (=> (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule resolution :premises (t249 t250))
% 26.01/26.30  (step t252 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.sk3 tptp.nil)))) :rule contraction :premises (t251))
% 26.01/26.30  (step t253 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t239 t246 t252))
% 26.01/26.30  (step t254 (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.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) :rule implies :premises (t253))
% 26.01/26.30  (step t255 (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)
% 26.01/26.30  (anchor :step t256 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 26.01/26.30  (step t256.t1 (cl (= U U)) :rule refl)
% 26.01/26.30  (step t256.t2 (cl (= V V)) :rule refl)
% 26.01/26.30  (step t256.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.01/26.30  (step t256.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 26.01/26.30  (step t256.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 26.01/26.30  (step t256.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 26.01/26.30  (step t256.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 (t256.t3 t256.t4 t256.t5 t256.t6))
% 26.01/26.30  (step t256 (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)
% 26.01/26.30  (step t257 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t255 t256 a99))
% 26.01/26.30  (step t258 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk3) (= tptp.nil tptp.sk3))) :rule resolution :premises (t254 t257))
% 26.01/26.30  (step t259 (cl (tptp.neq tptp.nil tptp.sk3)) :rule resolution :premises (t238 t171 a7 a187 t258))
% 26.01/26.30  (step t260 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule or_pos)
% 26.01/26.30  (step t261 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule reordering :premises (t260))
% 26.01/26.30  (step t262 (cl (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule or_pos)
% 26.01/26.30  (step t263 (cl (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule reordering :premises (t262))
% 26.01/26.30  (step t264 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)) :rule or_pos)
% 26.01/26.30  (step t265 (cl (= tptp.nil tptp.sk3) (tptp.ssItem (tptp.hd tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t264))
% 26.01/26.30  (step t266 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t267)
% 26.01/26.30  (assume t267.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 26.01/26.30  (step t267.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.01/26.30  (step t267.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule or :premises (t267.t1))
% 26.01/26.30  (step t267.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t267.t2 t267.a0))
% 26.01/26.30  (step t267 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t267.a0))
% 26.01/26.30  (step t268 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t266 t267))
% 26.01/26.30  (step t269 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t270 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t268 t269))
% 26.01/26.30  (step t271 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t270))
% 26.01/26.30  (step t272 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule implies :premises (t271))
% 26.01/26.30  (step t273 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.ssItem (tptp.hd tptp.sk3)) (= tptp.nil tptp.sk3))) :rule resolution :premises (t272 a75))
% 26.01/26.30  (step t274 (cl (tptp.ssItem (tptp.hd tptp.sk3))) :rule resolution :premises (t265 t171 a187 t273))
% 26.01/26.30  (step t275 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) 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)
% 26.01/26.30  (anchor :step t276)
% 26.01/26.30  (assume t276.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 26.01/26.30  (step t276.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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk3)) (:= V tptp.nil)))
% 26.01/26.30  (step t276.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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule or :premises (t276.t1))
% 26.01/26.30  (step t276.t3 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t276.t2 t276.a0))
% 26.01/26.30  (step t276 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule subproof :discharge (t276.a0))
% 26.01/26.30  (step t277 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t275 t276))
% 26.01/26.30  (step t278 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 26.01/26.30  (step t279 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) 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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t277 t278))
% 26.01/26.30  (step t280 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule contraction :premises (t279))
% 26.01/26.30  (step t281 (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.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule implies :premises (t280))
% 26.01/26.30  (step t282 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t281 a85))
% 26.01/26.30  (step t283 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule resolution :premises (t263 a7 t274 t282))
% 26.01/26.30  (step t284 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t285)
% 26.01/26.30  (assume t285.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 26.01/26.30  (step t285.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (:= V (tptp.tl tptp.sk3))))
% 26.01/26.30  (step t285.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule or :premises (t285.t1))
% 26.01/26.30  (step t285.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t285.t2 t285.a0))
% 26.01/26.30  (step t285 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule subproof :discharge (t285.a0))
% 26.01/26.30  (step t286 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t284 t285))
% 26.01/26.30  (step t287 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule implies_neg2)
% 26.01/26.30  (step t288 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule resolution :premises (t286 t287))
% 26.01/26.30  (step t289 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))))) :rule contraction :premises (t288))
% 26.01/26.30  (step t290 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies :premises (t289))
% 26.01/26.30  (step t291 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t290 a84))
% 26.01/26.30  (step t292 (cl (tptp.ssList (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t261 t180 t283 t291))
% 26.01/26.30  (step t293 (cl (= tptp.sk4 (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t236 t169 t259 t180 t292 t283 t274))
% 26.01/26.30  (step t294 (cl (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) :rule or_pos)
% 26.01/26.30  (step t295 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))) (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))))) :rule reordering :premises (t294))
% 26.01/26.30  (step t296 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t297)
% 26.01/26.30  (assume t297.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 26.01/26.30  (step t297.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))))) :rule forall_inst :args ((:= U (tptp.tl tptp.sk3))))
% 26.01/26.30  (step t297.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) :rule or :premises (t297.t1))
% 26.01/26.30  (step t297.t3 (cl (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) :rule resolution :premises (t297.t2 t297.a0))
% 26.01/26.30  (step t297 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) :rule subproof :discharge (t297.a0))
% 26.01/26.30  (step t298 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) :rule resolution :premises (t296 t297))
% 26.01/26.30  (step t299 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))))) :rule implies_neg2)
% 26.01/26.30  (step t300 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))))) :rule resolution :premises (t298 t299))
% 26.01/26.30  (step t301 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))))) :rule contraction :premises (t300))
% 26.01/26.30  (step t302 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) :rule implies :premises (t301))
% 26.01/26.30  (step t303 (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)
% 26.01/26.30  (anchor :step t304 :args ((U $$unsorted) (:= U U)))
% 26.01/26.30  (step t304.t1 (cl (= U U)) :rule refl)
% 26.01/26.30  (step t304.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.01/26.30  (step t304.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 26.01/26.30  (step t304.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 (t304.t2 t304.t3))
% 26.01/26.30  (step t304 (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)
% 26.01/26.30  (step t305 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t303 t304 a73))
% 26.01/26.30  (step t306 (cl (or (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3))))) :rule resolution :premises (t302 t305))
% 26.01/26.30  (step t307 (cl (= (tptp.tl tptp.sk3) (tptp.app tptp.nil (tptp.tl tptp.sk3)))) :rule resolution :premises (t295 t180 t306))
% 26.01/26.30  (step t308 (cl (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) :rule or_pos)
% 26.01/26.30  (step t309 (cl (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) :rule contraction :premises (t308))
% 26.01/26.30  (step t310 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)) (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))))) :rule reordering :premises (t309))
% 26.01/26.30  (step t311 (cl (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) :rule or_pos)
% 26.01/26.30  (step t312 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)) (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))))) :rule reordering :premises (t311))
% 26.01/26.30  (step t313 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t314)
% 26.01/26.30  (assume t314.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.01/26.30  (step t314.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))))) :rule forall_inst :args ((:= U (tptp.tl tptp.sk3))))
% 26.01/26.30  (step t314.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) :rule or :premises (t314.t1))
% 26.01/26.30  (step t314.t3 (cl (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) :rule resolution :premises (t314.t2 t314.a0))
% 26.01/26.30  (step t314 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) :rule subproof :discharge (t314.a0))
% 26.01/26.30  (step t315 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) :rule resolution :premises (t313 t314))
% 26.01/26.30  (step t316 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))))) :rule implies_neg2)
% 26.01/26.30  (step t317 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))))) :rule resolution :premises (t315 t316))
% 26.01/26.30  (step t318 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))))) :rule contraction :premises (t317))
% 26.01/26.30  (step t319 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) :rule implies :premises (t318))
% 26.01/26.30  (step t320 (cl (or (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3)))) :rule resolution :premises (t319 a56))
% 26.01/26.30  (step t321 (cl (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) :rule resolution :premises (t312 t180 t320))
% 26.01/26.30  (step t322 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (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)
% 26.01/26.30  (anchor :step t323)
% 26.01/26.30  (assume t323.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))))
% 26.01/26.30  (step t323.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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))))) :rule forall_inst :args ((:= U (tptp.tl tptp.sk3)) (:= V (tptp.tl tptp.sk3)) (:= W (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (:= X tptp.nil)))
% 26.01/26.30  (step t323.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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule or :premises (t323.t1))
% 26.01/26.30  (step t323.t3 (cl (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule resolution :premises (t323.t2 t323.a0))
% 26.01/26.30  (step t323 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule subproof :discharge (t323.a0))
% 26.01/26.30  (step t324 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule resolution :premises (t322 t323))
% 26.01/26.30  (step t325 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))))) :rule implies_neg2)
% 26.01/26.30  (step t326 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) (=> (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))))) :rule resolution :premises (t324 t325))
% 26.01/26.30  (step t327 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))))) :rule contraction :premises (t326))
% 26.01/26.30  (step t328 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule implies :premises (t327))
% 26.01/26.30  (step t329 (cl (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3)))) :rule resolution :premises (t328 a171))
% 26.01/26.30  (step t330 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (tptp.tl tptp.sk3))) :rule resolution :premises (t310 a7 t180 t283 t321 t329))
% 26.01/26.30  (step t331 (cl (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) :rule resolution :premises (t198 t293 t307 t330))
% 26.01/26.30  (step t332 (cl (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule and_neg)
% 26.01/26.30  (step t333 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t334)
% 26.01/26.30  (assume t334.a0 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 26.01/26.30  (assume t334.a1 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 26.01/26.30  (assume t334.a2 (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))
% 26.01/26.30  (assume t334.a3 (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))
% 26.01/26.30  (step t334.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t334.t2)
% 26.01/26.30  (assume t334.t2.a0 (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))
% 26.01/26.30  (assume t334.t2.a1 (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))
% 26.01/26.30  (assume t334.t2.a2 (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))
% 26.01/26.30  (assume t334.t2.a3 (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))
% 26.01/26.30  (step t334.t2.t1 (cl (= (= (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)) true) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.30  (step t334.t2.t2 (cl (not (= (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)) true)) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule equiv1 :premises (t334.t2.t1))
% 26.01/26.30  (step t334.t2.t3 (cl (= (tptp.app tptp.sk3 tptp.nil) tptp.sk3)) :rule symm :premises (t334.t2.a3))
% 26.01/26.30  (step t334.t2.t4 (cl (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) tptp.sk3)) :rule symm :premises (t334.t2.a2))
% 26.01/26.30  (step t334.t2.t5 (cl (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule symm :premises (t334.t2.t4))
% 26.01/26.30  (step t334.t2.t6 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule symm :premises (t334.t2.a1))
% 26.01/26.30  (step t334.t2.t7 (cl (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule symm :premises (t334.t2.t6))
% 26.01/26.30  (step t334.t2.t8 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule trans :premises (t334.t2.t3 t334.t2.t5 t334.t2.t7))
% 26.01/26.30  (step t334.t2.t9 (cl (= tptp.sk3 (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule trans :premises (t334.t2.a3 t334.t2.t8))
% 26.01/26.30  (step t334.t2.t10 (cl (= tptp.nil tptp.nil)) :rule refl)
% 26.01/26.30  (step t334.t2.t11 (cl (= (tptp.app tptp.sk3 tptp.nil) (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil))) :rule cong :premises (t334.t2.t9 t334.t2.t10))
% 26.01/26.30  (step t334.t2.t12 (cl (= tptp.sk3 (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil))) :rule trans :premises (t334.t2.a3 t334.t2.t11))
% 26.01/26.30  (step t334.t2.t13 (cl (= (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) :rule refl)
% 26.01/26.30  (step t334.t2.t14 (cl (= (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule cong :premises (t334.t2.t12 t334.t2.t13))
% 26.01/26.30  (step t334.t2.t15 (cl (= (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) true) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule equiv_simplify)
% 26.01/26.30  (step t334.t2.t16 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) true) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule equiv2 :premises (t334.t2.t15))
% 26.01/26.30  (step t334.t2.t17 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) true)) :rule resolution :premises (t334.t2.t16 t334.t2.a0))
% 26.01/26.30  (step t334.t2.t18 (cl (= (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)) true)) :rule trans :premises (t334.t2.t14 t334.t2.t17))
% 26.01/26.30  (step t334.t2.t19 (cl (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule resolution :premises (t334.t2.t2 t334.t2.t18))
% 26.01/26.30  (step t334.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule subproof :discharge (t334.t2.a0 t334.t2.a1 t334.t2.a2 t334.t2.a3))
% 26.01/26.30  (step t334.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) :rule and_pos)
% 26.01/26.30  (step t334.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.30  (step t334.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.30  (step t334.t6 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 26.01/26.30  (step t334.t7 (cl (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule resolution :premises (t334.t2 t334.t3 t334.t4 t334.t5 t334.t6))
% 26.01/26.30  (step t334.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule reordering :premises (t334.t7))
% 26.01/26.30  (step t334.t9 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule contraction :premises (t334.t8))
% 26.01/26.30  (step t334.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule resolution :premises (t334.t1 t334.t9))
% 26.01/26.30  (step t334.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t334.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule resolution :premises (t334.t10 t334.t11))
% 26.01/26.30  (step t334.t13 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule contraction :premises (t334.t12))
% 26.01/26.30  (step t334.t14 (cl (not (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule implies :premises (t334.t13))
% 26.01/26.30  (step t334.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule and_neg)
% 26.01/26.30  (step t334.t16 (cl (and (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t334.t15 t334.a3 t334.a2 t334.a1 t334.a0))
% 26.01/26.30  (step t334.t17 (cl (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule resolution :premises (t334.t14 t334.t16))
% 26.01/26.30  (step t334 (cl (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule subproof :discharge (t334.a0 t334.a1 t334.a2 t334.a3))
% 26.01/26.30  (step t335 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule and_pos)
% 26.01/26.30  (step t336 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.30  (step t337 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule and_pos)
% 26.01/26.30  (step t338 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) :rule and_pos)
% 26.01/26.30  (step t339 (cl (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))))) :rule resolution :premises (t334 t335 t336 t337 t338))
% 26.01/26.30  (step t340 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule reordering :premises (t339))
% 26.01/26.30  (step t341 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule contraction :premises (t340))
% 26.01/26.30  (step t342 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule resolution :premises (t333 t341))
% 26.01/26.30  (step t343 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t344 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule resolution :premises (t342 t343))
% 26.01/26.30  (step t345 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))) :rule contraction :premises (t344))
% 26.01/26.30  (step t346 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule implies :premises (t345))
% 26.01/26.30  (step t347 (cl (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule resolution :premises (t332 t346))
% 26.01/26.30  (step t348 (cl (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (not (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule reordering :premises (t347))
% 26.01/26.30  (step t349 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule or_pos)
% 26.01/26.30  (step t350 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule reordering :premises (t349))
% 26.01/26.30  (step t351 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t352)
% 26.01/26.30  (assume t352.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 26.01/26.30  (step t352.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.01/26.30  (step t352.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule or :premises (t352.t1))
% 26.01/26.30  (step t352.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t352.t2 t352.a0))
% 26.01/26.30  (step t352 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule subproof :discharge (t352.a0))
% 26.01/26.30  (step t353 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t351 t352))
% 26.01/26.30  (step t354 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule implies_neg2)
% 26.01/26.30  (step t355 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule resolution :premises (t353 t354))
% 26.01/26.30  (step t356 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))))) :rule contraction :premises (t355))
% 26.01/26.30  (step t357 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule implies :premises (t356))
% 26.01/26.30  (step t358 (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)
% 26.01/26.30  (anchor :step t359 :args ((U $$unsorted) (:= U U)))
% 26.01/26.30  (step t359.t1 (cl (= U U)) :rule refl)
% 26.01/26.30  (step t359.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.01/26.30  (step t359.t3 (cl (= (= (tptp.app U tptp.nil) U) (= U (tptp.app U tptp.nil)))) :rule all_simplify)
% 26.01/26.30  (step t359.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 (t359.t2 t359.t3))
% 26.01/26.30  (step t359 (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)
% 26.01/26.30  (step t360 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule resolution :premises (t358 t359 a72))
% 26.01/26.30  (step t361 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil)))) :rule resolution :premises (t357 t360))
% 26.01/26.30  (step t362 (cl (= tptp.sk3 (tptp.app tptp.sk3 tptp.nil))) :rule resolution :premises (t350 a187 t361))
% 26.01/26.30  (step t363 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)) :rule or_pos)
% 26.01/26.30  (step t364 (cl (= tptp.nil tptp.sk3) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t363))
% 26.01/26.30  (step t365 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t366)
% 26.01/26.30  (assume t366.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))))
% 26.01/26.30  (step t366.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.01/26.30  (step t366.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule or :premises (t366.t1))
% 26.01/26.30  (step t366.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t366.t2 t366.a0))
% 26.01/26.30  (step t366 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t366.a0))
% 26.01/26.30  (step t367 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t365 t366))
% 26.01/26.30  (step t368 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t369 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t367 t368))
% 26.01/26.30  (step t370 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t369))
% 26.01/26.30  (step t371 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule implies :premises (t370))
% 26.01/26.30  (step t372 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule equiv_pos2)
% 26.01/26.30  (anchor :step t373 :args ((U $$unsorted) (:= U U)))
% 26.01/26.30  (step t373.t1 (cl (= U U)) :rule refl)
% 26.01/26.30  (step t373.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 26.01/26.30  (step t373.t3 (cl (= (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= U (tptp.cons (tptp.hd U) (tptp.tl U))))) :rule all_simplify)
% 26.01/26.30  (step t373.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 26.01/26.30  (step t373.t5 (cl (= (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule cong :premises (t373.t2 t373.t3 t373.t4))
% 26.01/26.30  (step t373 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U))))) :rule bind)
% 26.01/26.30  (step t374 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.hd U) (tptp.tl U))) (= tptp.nil U)))) :rule resolution :premises (t372 t373 a103))
% 26.01/26.30  (step t375 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= tptp.nil tptp.sk3))) :rule resolution :premises (t371 t374))
% 26.01/26.30  (step t376 (cl (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) :rule resolution :premises (t364 t171 a187 t375))
% 26.01/26.30  (step t377 (cl (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule or_pos)
% 26.01/26.30  (step t378 (cl (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule reordering :premises (t377))
% 26.01/26.30  (step t379 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule equiv_pos2)
% 26.01/26.30  (step t380 (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)))) (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 refl)
% 26.01/26.30  (step t381 (cl (= (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule all_simplify)
% 26.01/26.30  (step t382 (cl (= (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))) (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule cong :premises (t217 t208 t381))
% 26.01/26.30  (step t383 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))))) :rule cong :premises (t380 t382))
% 26.01/26.30  (step t384 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (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)
% 26.01/26.30  (anchor :step t385)
% 26.01/26.30  (assume t385.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)))))
% 26.01/26.30  (step t385.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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk3)) (:= V (tptp.tl tptp.sk3))))
% 26.01/26.30  (step t385.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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule or :premises (t385.t1))
% 26.01/26.30  (step t385.t3 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule resolution :premises (t385.t2 t385.a0))
% 26.01/26.30  (step t385 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule subproof :discharge (t385.a0))
% 26.01/26.30  (step t386 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) :rule resolution :premises (t384 t385))
% 26.01/26.30  (step t387 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule implies_neg2)
% 26.01/26.30  (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3))))) (=> (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t386 t387))
% 26.01/26.30  (step t389 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)))))) :rule contraction :premises (t388))
% 26.01/26.30  (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))))) :rule resolution :premises (t379 t383 t389))
% 26.01/26.30  (step t391 (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.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule implies :premises (t390))
% 26.01/26.30  (step t392 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3))))) :rule resolution :premises (t391 a119))
% 26.01/26.30  (step t393 (cl (= (tptp.cons (tptp.hd tptp.sk3) (tptp.tl tptp.sk3)) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)))) :rule resolution :premises (t378 t180 t274 t392))
% 26.01/26.30  (step t394 (cl (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) :rule or_pos)
% 26.01/26.30  (step t395 (cl (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) :rule contraction :premises (t394))
% 26.01/26.30  (step t396 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)) (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))))) :rule reordering :premises (t395))
% 26.01/26.30  (step t397 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (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)
% 26.01/26.30  (anchor :step t398)
% 26.01/26.30  (assume t398.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))))
% 26.01/26.30  (step t398.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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))))) :rule forall_inst :args ((:= U (tptp.tl tptp.sk3)) (:= V (tptp.tl tptp.sk3)) (:= W tptp.nil) (:= X (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 26.01/26.30  (step t398.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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule or :premises (t398.t1))
% 26.01/26.30  (step t398.t3 (cl (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule resolution :premises (t398.t2 t398.a0))
% 26.01/26.30  (step t398 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule subproof :discharge (t398.a0))
% 26.01/26.30  (step t399 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule resolution :premises (t397 t398))
% 26.01/26.30  (step t400 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (not (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))))) :rule implies_neg2)
% 26.01/26.30  (step t401 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) (=> (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))))) :rule resolution :premises (t399 t400))
% 26.01/26.30  (step t402 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))))) :rule contraction :premises (t401))
% 26.01/26.30  (step t403 (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.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule implies :premises (t402))
% 26.01/26.30  (step t404 (cl (or (not (tptp.segmentP (tptp.tl tptp.sk3) (tptp.tl tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3)))) :rule resolution :premises (t403 a171))
% 26.01/26.30  (step t405 (cl (tptp.segmentP (tptp.app (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.tl tptp.sk3)) tptp.nil) (tptp.tl tptp.sk3))) :rule resolution :premises (t396 a7 t180 t283 t321 t404))
% 26.01/26.30  (step t406 (cl (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))) :rule resolution :premises (t348 t362 t376 t393 t405))
% 26.01/26.30  (step t407 (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) (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)
% 26.01/26.30  (anchor :step t408)
% 26.01/26.30  (assume t408.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)))))
% 26.01/26.30  (step t408.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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))))) :rule forall_inst :args ((:= A (tptp.tl tptp.sk3))))
% 26.01/26.30  (step t408.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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) :rule or :premises (t408.t1))
% 26.01/26.30  (step t408.t3 (cl (or (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) :rule resolution :premises (t408.t2 t408.a0))
% 26.01/26.30  (step t408 (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) :rule subproof :discharge (t408.a0))
% 26.01/26.30  (step t409 (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) (or (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) :rule resolution :premises (t407 t408))
% 26.01/26.30  (step t410 (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) (not (or (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))))) :rule implies_neg2)
% 26.01/26.30  (step t411 (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) (=> (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))))) :rule resolution :premises (t409 t410))
% 26.01/26.30  (step t412 (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3)))))) :rule contraction :premises (t411))
% 26.01/26.30  (step t413 (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.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) :rule implies :premises (t412))
% 26.01/26.30  (step t414 (cl (not (= (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (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 (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 equiv_pos2)
% 26.01/26.30  (anchor :step t415 :args ((A $$unsorted) (:= A A)))
% 26.01/26.30  (step t415.t1 (cl (= A A)) :rule refl)
% 26.01/26.30  (step t415.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 26.01/26.30  (step t415.t3 (cl (= (not (tptp.neq A tptp.nil)) (not (tptp.neq A tptp.nil)))) :rule refl)
% 26.01/26.30  (step t415.t4 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t165))
% 26.01/26.30  (step t415.t5 (cl (= A A)) :rule refl)
% 26.01/26.30  (step t415.t6 (cl (= (tptp.segmentP tptp.sk2 A) (tptp.segmentP tptp.sk4 A))) :rule cong :premises (t415.t4 t415.t5))
% 26.01/26.30  (step t415.t7 (cl (= (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk4 A)))) :rule cong :premises (t415.t6))
% 26.01/26.30  (step t415.t8 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t165))
% 26.01/26.30  (step t415.t9 (cl (= (tptp.segmentP tptp.sk1 A) (tptp.segmentP tptp.sk3 A))) :rule cong :premises (t415.t8 t415.t5))
% 26.01/26.30  (step t415.t10 (cl (= (not (tptp.segmentP tptp.sk1 A)) (not (tptp.segmentP tptp.sk3 A)))) :rule cong :premises (t415.t9))
% 26.01/26.30  (step t415.t11 (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 (t415.t2 t415.t3 t415.t7 t415.t10))
% 26.01/26.30  (step t415 (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)
% 26.01/26.30  (step t416 (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 (t414 t415 a192))
% 26.01/26.30  (step t417 (cl (or (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil)) (not (tptp.segmentP tptp.sk4 (tptp.tl tptp.sk3))) (not (tptp.segmentP tptp.sk3 (tptp.tl tptp.sk3))))) :rule resolution :premises (t413 t416))
% 26.01/26.30  (step t418 (cl (not (tptp.neq (tptp.tl tptp.sk3) tptp.nil))) :rule resolution :premises (t182 t180 t331 t406 t417))
% 26.01/26.30  (step t419 (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t420)
% 26.01/26.30  (assume t420.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 26.01/26.30  (step t420.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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3))))) :rule forall_inst :args ((:= U tptp.nil) (:= V (tptp.tl tptp.sk3))))
% 26.01/26.30  (step t420.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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) :rule or :premises (t420.t1))
% 26.01/26.30  (step t420.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) :rule resolution :premises (t420.t2 t420.a0))
% 26.01/26.30  (step t420 (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) :rule subproof :discharge (t420.a0))
% 26.01/26.30  (step t421 (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) :rule resolution :premises (t419 t420))
% 26.01/26.30  (step t422 (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3))))) :rule implies_neg2)
% 26.01/26.30  (step t423 (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) (=> (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3))))) :rule resolution :premises (t421 t422))
% 26.01/26.30  (step t424 (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3))))) :rule contraction :premises (t423))
% 26.01/26.30  (step t425 (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.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) :rule implies :premises (t424))
% 26.01/26.30  (step t426 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (tptp.neq (tptp.tl tptp.sk3) tptp.nil) (= tptp.nil (tptp.tl tptp.sk3)))) :rule resolution :premises (t425 t257))
% 26.01/26.30  (step t427 (cl (= tptp.nil (tptp.tl tptp.sk3))) :rule resolution :premises (t83 a7 t180 t418 t426))
% 26.01/26.30  (step t428 (cl (not (or (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule or_pos)
% 26.01/26.30  (step t429 (cl (not (or (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule contraction :premises (t428))
% 26.01/26.30  (step t430 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (not (or (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule reordering :premises (t429))
% 26.01/26.30  (step t431 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule or_pos)
% 26.01/26.30  (step t432 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule reordering :premises (t431))
% 26.01/26.30  (step t433 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t434)
% 26.01/26.30  (assume t434.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.01/26.30  (step t434.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 26.01/26.30  (step t434.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule or :premises (t434.t1))
% 26.01/26.30  (step t434.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t434.t2 t434.a0))
% 26.01/26.30  (step t434 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule subproof :discharge (t434.a0))
% 26.01/26.30  (step t435 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t433 t434))
% 26.01/26.30  (step t436 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 26.01/26.30  (step t437 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t435 t436))
% 26.01/26.30  (step t438 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule contraction :premises (t437))
% 26.01/26.30  (step t439 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule implies :premises (t438))
% 26.01/26.30  (step t440 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t439 a56))
% 26.01/26.30  (step t441 (cl (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule resolution :premises (t432 t283 t440))
% 26.01/26.30  (step t442 (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (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)
% 26.01/26.30  (anchor :step t443)
% 26.01/26.30  (assume t443.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))))
% 26.01/26.30  (step t443.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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (:= V (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) (:= W tptp.nil) (:= X (tptp.tl tptp.sk3))))
% 26.01/26.30  (step t443.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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule or :premises (t443.t1))
% 26.01/26.30  (step t443.t3 (cl (or (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t443.t2 t443.a0))
% 26.01/26.30  (step t443 (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule subproof :discharge (t443.a0))
% 26.01/26.30  (step t444 (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (or (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t442 t443))
% 26.01/26.30  (step t445 (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (not (or (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule implies_neg2)
% 26.01/26.30  (step t446 (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) (=> (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule resolution :premises (t444 t445))
% 26.01/26.30  (step t447 (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))) :rule contraction :premises (t446))
% 26.01/26.30  (step t448 (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.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule implies :premises (t447))
% 26.01/26.30  (step t449 (cl (or (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.tl tptp.sk3))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)))) :rule resolution :premises (t448 a171))
% 26.01/26.30  (step t450 (cl (tptp.segmentP (tptp.app (tptp.app (tptp.tl tptp.sk3) (tptp.cons (tptp.hd tptp.sk3) tptp.nil)) tptp.nil) (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) :rule resolution :premises (t430 a7 t180 t283 t441 t449))
% 26.01/26.30  (step t451 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3))) :rule or_pos)
% 26.01/26.30  (step t452 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3))))) :rule reordering :premises (t451))
% 26.01/26.30  (step t453 (cl (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)) :rule or_pos)
% 26.01/26.30  (step t454 (cl (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule reordering :premises (t453))
% 26.01/26.30  (step t455 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t456)
% 26.01/26.30  (assume t456.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 26.01/26.30  (step t456.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3)))
% 26.01/26.30  (step t456.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule or :premises (t456.t1))
% 26.01/26.30  (step t456.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t456.t2 t456.a0))
% 26.01/26.30  (step t456 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule subproof :discharge (t456.a0))
% 26.01/26.30  (step t457 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t455 t456))
% 26.01/26.30  (step t458 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (not (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule implies_neg2)
% 26.01/26.30  (step t459 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule resolution :premises (t457 t458))
% 26.01/26.30  (step t460 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule contraction :premises (t459))
% 26.01/26.30  (step t461 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule implies :premises (t460))
% 26.01/26.30  (step t462 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t461 a56))
% 26.01/26.30  (step t463 (cl (tptp.segmentP tptp.sk3 tptp.sk3)) :rule resolution :premises (t454 a187 t462))
% 26.01/26.30  (step t464 (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) (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)
% 26.01/26.30  (anchor :step t465)
% 26.01/26.30  (assume t465.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)))))
% 26.01/26.30  (step t465.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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3))))) :rule forall_inst :args ((:= A tptp.sk3)))
% 26.01/26.30  (step t465.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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule or :premises (t465.t1))
% 26.01/26.30  (step t465.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule resolution :premises (t465.t2 t465.a0))
% 26.01/26.30  (step t465 (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule subproof :discharge (t465.a0))
% 26.01/26.30  (step t466 (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule resolution :premises (t464 t465))
% 26.01/26.30  (step t467 (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3))))) :rule implies_neg2)
% 26.01/26.30  (step t468 (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) (=> (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3))))) :rule resolution :premises (t466 t467))
% 26.01/26.30  (step t469 (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3))))) :rule contraction :premises (t468))
% 26.01/26.30  (step t470 (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.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule implies :premises (t469))
% 26.01/26.30  (step t471 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)))) :rule resolution :premises (t470 t416))
% 26.01/26.30  (step t472 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t452 a187 t170 t463 t471))
% 26.01/26.30  (step t473 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) :rule or_pos)
% 26.01/26.30  (step t474 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))))) :rule reordering :premises (t473))
% 26.01/26.30  (step t475 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t476)
% 26.01/26.30  (assume t476.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 26.01/26.30  (step t476.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk3) tptp.nil))))
% 26.01/26.30  (step t476.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) :rule or :premises (t476.t1))
% 26.01/26.30  (step t476.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) :rule resolution :premises (t476.t2 t476.a0))
% 26.01/26.30  (step t476 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) :rule subproof :discharge (t476.a0))
% 26.01/26.30  (step t477 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) :rule resolution :premises (t475 t476))
% 26.01/26.30  (step t478 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))))) :rule implies_neg2)
% 26.01/26.30  (step t479 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))))) :rule resolution :premises (t477 t478))
% 26.01/26.30  (step t480 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))))) :rule contraction :premises (t479))
% 26.01/26.30  (step t481 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) :rule implies :premises (t480))
% 26.01/26.30  (step t482 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk3) tptp.nil))) (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil)))) :rule resolution :premises (t481 t360))
% 26.01/26.30  (step t483 (cl (= (tptp.cons (tptp.hd tptp.sk3) tptp.nil) (tptp.app (tptp.cons (tptp.hd tptp.sk3) tptp.nil) tptp.nil))) :rule resolution :premises (t474 t283 t482))
% 26.01/26.30  (step t484 (cl (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule or_pos)
% 26.01/26.30  (step t485 (cl (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule reordering :premises (t484))
% 26.01/26.30  (step t486 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) :rule implies_neg1)
% 26.01/26.30  (anchor :step t487)
% 26.01/26.30  (assume t487.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))))
% 26.01/26.30  (step t487.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk4)))
% 26.01/26.30  (step t487.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule or :premises (t487.t1))
% 26.01/26.30  (step t487.t3 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t487.t2 t487.a0))
% 26.01/26.30  (step t487 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule subproof :discharge (t487.a0))
% 26.01/26.30  (step t488 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t486 t487))
% 26.01/26.30  (step t489 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule implies_neg2)
% 26.01/26.30  (step t490 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule resolution :premises (t488 t489))
% 26.01/26.30  (step t491 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))))) :rule contraction :premises (t490))
% 26.01/26.30  (step t492 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app U tptp.nil))))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule implies :premises (t491))
% 26.01/26.30  (step t493 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil)))) :rule resolution :premises (t492 t360))
% 26.01/26.30  (step t494 (cl (= tptp.sk4 (tptp.app tptp.sk4 tptp.nil))) :rule resolution :premises (t485 a188 t493))
% 26.01/26.30  (step t495 (cl) :rule resolution :premises (t81 t427 t393 t450 t472 t376 t483 t494 t293))
% 26.01/26.30  
% 26.01/26.30  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.BS13DyQ30A/cvc5---1.0.5_28593.smt2
% 26.01/26.30  % cvc5---1.0.5 exiting
% 26.13/26.30  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------