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

% Computer : n004.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 79.16s 79.42s
% Output   : Proof 79.25s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SWC091-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n004.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 26 15:51:54 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.53  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.50/10.72  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.54/15.74  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.51/20.76  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.56/25.80  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.62/30.85  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.60/35.88  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.71/40.92  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 45.72/45.98  --- Run --prenex-quant=none --full-saturate-quant at 5...
% 50.73/51.02  --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 5...
% 55.78/56.08  --- Run --relevant-triggers --full-saturate-quant at 5...
% 60.91/61.13  --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 5...
% 65.95/66.22  --- Run --pre-skolem-quant=on --full-saturate-quant at 10...
% 76.04/76.28  --- Run --cbqi-vo-exp --full-saturate-quant at 10...
% 79.16/79.42  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.BYXbkpOMzB/cvc5---1.0.5_11208.smt2
% 79.16/79.42  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.BYXbkpOMzB/cvc5---1.0.5_11208.smt2
% 79.25/79.56  (assume a0 (tptp.equalelemsP tptp.nil))
% 79.25/79.56  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 79.25/79.56  (assume a2 (tptp.strictorderedP tptp.nil))
% 79.25/79.56  (assume a3 (tptp.totalorderedP tptp.nil))
% 79.25/79.56  (assume a4 (tptp.strictorderP tptp.nil))
% 79.25/79.56  (assume a5 (tptp.totalorderP tptp.nil))
% 79.25/79.56  (assume a6 (tptp.cyclefreeP tptp.nil))
% 79.25/79.56  (assume a7 (tptp.ssList tptp.nil))
% 79.25/79.56  (assume a8 (tptp.ssItem tptp.skac3))
% 79.25/79.56  (assume a9 (tptp.ssItem tptp.skac2))
% 79.25/79.56  (assume a10 (not (tptp.singletonP tptp.nil)))
% 79.25/79.56  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 79.25/79.56  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 79.25/79.56  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 79.25/79.56  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 79.25/79.56  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 79.25/79.56  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 79.25/79.56  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 79.25/79.56  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 79.25/79.56  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 79.25/79.56  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 79.25/79.56  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 79.25/79.56  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 79.25/79.56  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 79.25/79.56  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 79.25/79.56  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 79.25/79.56  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 79.25/79.56  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 79.25/79.56  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 79.25/79.56  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 79.25/79.56  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 79.25/79.56  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 79.25/79.56  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 79.25/79.56  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 79.25/79.56  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 79.25/79.56  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 79.25/79.56  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 79.25/79.56  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 79.25/79.56  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 79.25/79.56  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 79.25/79.56  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 79.25/79.56  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 79.25/79.56  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 79.25/79.56  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 79.25/79.56  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 79.25/79.56  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 79.25/79.56  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 79.25/79.56  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 79.25/79.56  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 79.25/79.56  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 79.25/79.56  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 79.25/79.56  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 79.25/79.56  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 79.25/79.56  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 79.25/79.56  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 79.25/79.56  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 79.25/79.56  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 79.25/79.56  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 79.25/79.56  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 79.25/79.56  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 79.25/79.56  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 79.25/79.56  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 79.25/79.56  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 79.25/79.56  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 79.25/79.56  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 79.25/79.56  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 79.25/79.56  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 79.25/79.56  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 79.25/79.56  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 79.25/79.56  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 79.25/79.56  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 79.25/79.56  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 79.25/79.56  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 79.25/79.56  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 79.25/79.56  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 79.25/79.56  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 79.25/79.56  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 79.25/79.56  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 79.25/79.56  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 79.25/79.56  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 79.25/79.56  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 79.25/79.56  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 79.25/79.56  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 79.25/79.56  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 79.25/79.56  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 79.25/79.56  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 79.25/79.56  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 79.25/79.56  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 79.25/79.56  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 79.25/79.56  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 79.25/79.56  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 79.25/79.56  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 79.25/79.56  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 79.25/79.56  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 79.25/79.56  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 79.25/79.56  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 79.25/79.56  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 79.25/79.56  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 79.25/79.56  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 79.25/79.56  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 79.25/79.56  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 79.25/79.56  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 79.25/79.56  (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))))
% 79.25/79.56  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 79.25/79.56  (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))))
% 79.25/79.56  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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))))
% 79.25/79.56  (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)))))
% 79.25/79.56  (assume a185 (tptp.ssList tptp.sk1))
% 79.25/79.56  (assume a186 (tptp.ssList tptp.sk2))
% 79.25/79.56  (assume a187 (tptp.ssList tptp.sk3))
% 79.25/79.56  (assume a188 (tptp.ssList tptp.sk4))
% 79.25/79.56  (assume a189 (= tptp.sk2 tptp.sk4))
% 79.25/79.56  (assume a190 (= tptp.sk1 tptp.sk3))
% 79.25/79.56  (assume a191 (tptp.neq tptp.sk2 tptp.nil))
% 79.25/79.56  (assume a192 (tptp.frontsegP tptp.sk4 tptp.sk3))
% 79.25/79.56  (assume a193 (tptp.totalorderedP tptp.sk3))
% 79.25/79.56  (assume a194 (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)))))
% 79.25/79.56  (assume a195 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))))
% 79.25/79.56  (step t1 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule or_pos)
% 79.25/79.56  (step t2 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule reordering :premises (t1))
% 79.25/79.56  (step t3 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t4)
% 79.25/79.56  (assume t4.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))))
% 79.25/79.56  (step t4.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule forall_inst :args ((:= A (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))
% 79.25/79.56  (step t4.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule or :premises (t4.t1))
% 79.25/79.56  (step t4.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t4.t2 t4.a0))
% 79.25/79.56  (step t4 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule subproof :discharge (t4.a0))
% 79.25/79.56  (step t5 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t3 t4))
% 79.25/79.56  (step t6 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule implies_neg2)
% 79.25/79.56  (step t7 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule resolution :premises (t5 t6))
% 79.25/79.56  (step t8 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule contraction :premises (t7))
% 79.25/79.56  (step t9 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq tptp.sk3 A)) (not (tptp.frontsegP tptp.sk4 A)) (not (tptp.segmentP A tptp.sk3)) (not (tptp.totalorderedP A))))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule implies :premises (t8))
% 79.25/79.56  (step t10 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t9 a195))
% 79.25/79.56  (step t11 (cl (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (not (= tptp.nil tptp.sk3)) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule and_neg)
% 79.25/79.56  (step t12 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t13)
% 79.25/79.56  (assume t13.a0 (= tptp.nil tptp.sk3))
% 79.25/79.56  (assume t13.a1 (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))
% 79.25/79.56  (step t13.t1 (cl (=> (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t13.t2)
% 79.25/79.56  (assume t13.t2.a0 (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))
% 79.25/79.56  (assume t13.t2.a1 (= tptp.nil tptp.sk3))
% 79.25/79.56  (step t13.t2.t1 (cl (= (= (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) true) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule equiv_simplify)
% 79.25/79.56  (step t13.t2.t2 (cl (not (= (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) true)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule equiv1 :premises (t13.t2.t1))
% 79.25/79.56  (step t13.t2.t3 (cl (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule refl)
% 79.25/79.56  (step t13.t2.t4 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t13.t2.a1))
% 79.25/79.56  (step t13.t2.t5 (cl (= (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule cong :premises (t13.t2.t3 t13.t2.t4))
% 79.25/79.56  (step t13.t2.t6 (cl (= (= (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) true) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule equiv_simplify)
% 79.25/79.56  (step t13.t2.t7 (cl (= (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) true) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule equiv2 :premises (t13.t2.t6))
% 79.25/79.56  (step t13.t2.t8 (cl (= (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) true)) :rule resolution :premises (t13.t2.t7 t13.t2.a0))
% 79.25/79.56  (step t13.t2.t9 (cl (= (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) true)) :rule trans :premises (t13.t2.t5 t13.t2.t8))
% 79.25/79.56  (step t13.t2.t10 (cl (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule resolution :premises (t13.t2.t2 t13.t2.t9))
% 79.25/79.56  (step t13.t2 (cl (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (not (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule subproof :discharge (t13.t2.a0 t13.t2.a1))
% 79.25/79.56  (step t13.t3 (cl (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) :rule and_pos)
% 79.25/79.56  (step t13.t4 (cl (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 79.25/79.56  (step t13.t5 (cl (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t13.t2 t13.t3 t13.t4))
% 79.25/79.56  (step t13.t6 (cl (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule reordering :premises (t13.t5))
% 79.25/79.56  (step t13.t7 (cl (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule contraction :premises (t13.t6))
% 79.25/79.56  (step t13.t8 (cl (=> (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule resolution :premises (t13.t1 t13.t7))
% 79.25/79.56  (step t13.t9 (cl (=> (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule implies_neg2)
% 79.25/79.56  (step t13.t10 (cl (=> (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (=> (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule resolution :premises (t13.t8 t13.t9))
% 79.25/79.56  (step t13.t11 (cl (=> (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule contraction :premises (t13.t10))
% 79.25/79.56  (step t13.t12 (cl (not (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule implies :premises (t13.t11))
% 79.25/79.56  (step t13.t13 (cl (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3)) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (not (= tptp.nil tptp.sk3))) :rule and_neg)
% 79.25/79.56  (step t13.t14 (cl (and (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t13.t13 t13.a1 t13.a0))
% 79.25/79.56  (step t13.t15 (cl (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule resolution :premises (t13.t12 t13.t14))
% 79.25/79.56  (step t13 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule subproof :discharge (t13.a0 t13.a1))
% 79.25/79.56  (step t14 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 79.25/79.56  (step t15 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) :rule and_pos)
% 79.25/79.56  (step t16 (cl (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)))) :rule resolution :premises (t13 t14 t15))
% 79.25/79.56  (step t17 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule reordering :premises (t16))
% 79.25/79.56  (step t18 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule contraction :premises (t17))
% 79.25/79.56  (step t19 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule resolution :premises (t12 t18))
% 79.25/79.56  (step t20 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule implies_neg2)
% 79.25/79.56  (step t21 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule resolution :premises (t19 t20))
% 79.25/79.56  (step t22 (cl (=> (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule contraction :premises (t21))
% 79.25/79.56  (step t23 (cl (not (and (= tptp.nil tptp.sk3) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule implies :premises (t22))
% 79.25/79.56  (step t24 (cl (not (= tptp.nil tptp.sk3)) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) :rule resolution :premises (t11 t23))
% 79.25/79.56  (step t25 (cl (not (= tptp.nil tptp.sk3)) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (not (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule reordering :premises (t24))
% 79.25/79.56  (step t26 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)) :rule or_pos)
% 79.25/79.56  (step t27 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule reordering :premises (t26))
% 79.25/79.56  (step t28 (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)
% 79.25/79.56  (step t29 (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 (t28))
% 79.25/79.56  (step t30 (cl (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule and_neg)
% 79.25/79.56  (step t31 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t32)
% 79.25/79.56  (assume t32.a0 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 79.25/79.56  (assume t32.a1 (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))
% 79.25/79.56  (assume t32.a2 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))
% 79.25/79.56  (step t32.t1 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t32.t2)
% 79.25/79.56  (assume t32.t2.a0 (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))
% 79.25/79.56  (assume t32.t2.a1 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 79.25/79.56  (assume t32.t2.a2 (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))
% 79.25/79.56  (step t32.t2.t1 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) true) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv_simplify)
% 79.25/79.56  (step t32.t2.t2 (cl (not (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule equiv1 :premises (t32.t2.t1))
% 79.25/79.56  (step t32.t2.t3 (cl (= (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk4)) :rule symm :premises (t32.t2.a2))
% 79.25/79.56  (step t32.t2.t4 (cl (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule symm :premises (t32.t2.t3))
% 79.25/79.56  (step t32.t2.t5 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t32.t2.a1))
% 79.25/79.56  (step t32.t2.t6 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule symm :premises (t32.t2.t5))
% 79.25/79.56  (step t32.t2.t7 (cl (= (tptp.skaf45 tptp.sk4 tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule refl)
% 79.25/79.56  (step t32.t2.t8 (cl (= (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)) (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule cong :premises (t32.t2.t6 t32.t2.t7))
% 79.25/79.56  (step t32.t2.t9 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule trans :premises (t32.t2.t4 t32.t2.t8))
% 79.25/79.56  (step t32.t2.t10 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 79.25/79.56  (step t32.t2.t11 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule cong :premises (t32.t2.t9 t32.t2.t10))
% 79.25/79.56  (step t32.t2.t12 (cl (= (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) true) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule equiv_simplify)
% 79.25/79.56  (step t32.t2.t13 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) true) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule equiv2 :premises (t32.t2.t12))
% 79.25/79.56  (step t32.t2.t14 (cl (= (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) true)) :rule resolution :premises (t32.t2.t13 t32.t2.a0))
% 79.25/79.56  (step t32.t2.t15 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) :rule trans :premises (t32.t2.t11 t32.t2.t14))
% 79.25/79.56  (step t32.t2.t16 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t32.t2.t2 t32.t2.t15))
% 79.25/79.56  (step t32.t2 (cl (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule subproof :discharge (t32.t2.a0 t32.t2.a1 t32.t2.a2))
% 79.25/79.56  (step t32.t3 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) :rule and_pos)
% 79.25/79.56  (step t32.t4 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 79.25/79.56  (step t32.t5 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule and_pos)
% 79.25/79.56  (step t32.t6 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule resolution :premises (t32.t2 t32.t3 t32.t4 t32.t5))
% 79.25/79.56  (step t32.t7 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule reordering :premises (t32.t6))
% 79.25/79.56  (step t32.t8 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule contraction :premises (t32.t7))
% 79.25/79.56  (step t32.t9 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t32.t1 t32.t8))
% 79.25/79.56  (step t32.t10 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg2)
% 79.25/79.56  (step t32.t11 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3)) (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t32.t9 t32.t10))
% 79.25/79.56  (step t32.t12 (cl (=> (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule contraction :premises (t32.t11))
% 79.25/79.56  (step t32.t13 (cl (not (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule implies :premises (t32.t12))
% 79.25/79.56  (step t32.t14 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule and_neg)
% 79.25/79.56  (step t32.t15 (cl (and (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule resolution :premises (t32.t14 t32.a2 t32.a0 t32.a1))
% 79.25/79.56  (step t32.t16 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t32.t13 t32.t15))
% 79.25/79.56  (step t32 (cl (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule subproof :discharge (t32.a0 t32.a1 t32.a2))
% 79.25/79.56  (step t33 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 79.25/79.56  (step t34 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule and_pos)
% 79.25/79.56  (step t35 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) :rule and_pos)
% 79.25/79.56  (step t36 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)))) :rule resolution :premises (t32 t33 t34 t35))
% 79.25/79.56  (step t37 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule reordering :premises (t36))
% 79.25/79.56  (step t38 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule contraction :premises (t37))
% 79.25/79.56  (step t39 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t31 t38))
% 79.25/79.56  (step t40 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg2)
% 79.25/79.56  (step t41 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule resolution :premises (t39 t40))
% 79.25/79.56  (step t42 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule contraction :premises (t41))
% 79.25/79.56  (step t43 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule implies :premises (t42))
% 79.25/79.56  (step t44 (cl (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t30 t43))
% 79.25/79.56  (step t45 (cl (tptp.segmentP tptp.sk4 tptp.sk3) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) (not (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule reordering :premises (t44))
% 79.25/79.56  (step t46 (cl (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule or_pos)
% 79.25/79.56  (step t47 (cl (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule reordering :premises (t46))
% 79.25/79.56  (step t48 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t49)
% 79.25/79.56  (assume t49.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 79.25/79.56  (step t49.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3)))
% 79.25/79.56  (step t49.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule or :premises (t49.t1))
% 79.25/79.56  (step t49.t3 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t49.t2 t49.a0))
% 79.25/79.56  (step t49 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule subproof :discharge (t49.a0))
% 79.25/79.56  (step t50 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t48 t49))
% 79.25/79.56  (step t51 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule implies_neg2)
% 79.25/79.56  (step t52 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule resolution :premises (t50 t51))
% 79.25/79.56  (step t53 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule contraction :premises (t52))
% 79.25/79.56  (step t54 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule implies :premises (t53))
% 79.25/79.56  (step t55 (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)
% 79.25/79.56  (anchor :step t56 :args ((U $$unsorted) (:= U U)))
% 79.25/79.56  (step t56.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t56.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.56  (step t56.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 79.25/79.56  (step t56.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 (t56.t2 t56.t3))
% 79.25/79.56  (step t56 (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)
% 79.25/79.56  (step t57 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t55 t56 a73))
% 79.25/79.56  (step t58 (cl (or (not (tptp.ssList tptp.sk3)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))) :rule resolution :premises (t54 t57))
% 79.25/79.56  (step t59 (cl (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule resolution :premises (t47 a187 t58))
% 79.25/79.56  (step t60 (cl (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule or_pos)
% 79.25/79.56  (step t61 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule reordering :premises (t60))
% 79.25/79.56  (step t62 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t63)
% 79.25/79.56  (assume t63.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))
% 79.25/79.56  (step t63.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk3)))
% 79.25/79.56  (step t63.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule or :premises (t63.t1))
% 79.25/79.56  (step t63.t3 (cl (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule resolution :premises (t63.t2 t63.a0))
% 79.25/79.56  (step t63 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule subproof :discharge (t63.a0))
% 79.25/79.56  (step t64 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule resolution :premises (t62 t63))
% 79.25/79.56  (step t65 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (not (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule implies_neg2)
% 79.25/79.56  (step t66 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule resolution :premises (t64 t65))
% 79.25/79.56  (step t67 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))))) :rule contraction :premises (t66))
% 79.25/79.56  (step t68 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule implies :premises (t67))
% 79.25/79.56  (step t69 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule equiv_pos2)
% 79.25/79.56  (anchor :step t70 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 79.25/79.56  (step t70.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t70.t2 (cl (= V V)) :rule refl)
% 79.25/79.56  (step t70.t3 (cl (= (not (tptp.frontsegP U V)) (not (tptp.frontsegP U V)))) :rule refl)
% 79.25/79.56  (step t70.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.56  (step t70.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.56  (step t70.t6 (cl (= (= (tptp.app V (tptp.skaf45 U V)) U) (= U (tptp.app V (tptp.skaf45 U V))))) :rule all_simplify)
% 79.25/79.56  (step t70.t7 (cl (= (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule cong :premises (t70.t3 t70.t4 t70.t5 t70.t6))
% 79.25/79.56  (step t70 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) :rule bind)
% 79.25/79.56  (step t71 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule resolution :premises (t69 t70 a131))
% 79.25/79.56  (step t72 (cl (or (not (tptp.frontsegP tptp.sk4 tptp.sk3)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3))))) :rule resolution :premises (t68 t71))
% 79.25/79.56  (step t73 (cl (= tptp.sk4 (tptp.app tptp.sk3 (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule resolution :premises (t61 a187 a188 a192 t72))
% 79.25/79.56  (step t74 (cl (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) :rule or_pos)
% 79.25/79.56  (step t75 (cl (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) :rule contraction :premises (t74))
% 79.25/79.56  (step t76 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3) (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)))) :rule reordering :premises (t75))
% 79.25/79.56  (step t77 (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)
% 79.25/79.56  (step t78 (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 (t77))
% 79.25/79.56  (step t79 (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)
% 79.25/79.56  (anchor :step t80)
% 79.25/79.56  (assume t80.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 79.25/79.56  (step t80.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)))
% 79.25/79.56  (step t80.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 (t80.t1))
% 79.25/79.56  (step t80.t3 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t80.t2 t80.a0))
% 79.25/79.56  (step t80 (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 (t80.a0))
% 79.25/79.56  (step t81 (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 (t79 t80))
% 79.25/79.56  (step t82 (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)
% 79.25/79.56  (step t83 (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 (t81 t82))
% 79.25/79.56  (step t84 (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 (t83))
% 79.25/79.56  (step t85 (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 (t84))
% 79.25/79.56  (step t86 (cl (or (not (tptp.ssList tptp.sk3)) (tptp.segmentP tptp.sk3 tptp.sk3))) :rule resolution :premises (t85 a56))
% 79.25/79.56  (step t87 (cl (tptp.segmentP tptp.sk3 tptp.sk3)) :rule resolution :premises (t78 a187 t86))
% 79.25/79.56  (step t88 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t89)
% 79.25/79.56  (assume t89.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 79.25/79.56  (step t89.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.sk3)))
% 79.25/79.56  (step t89.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule or :premises (t89.t1))
% 79.25/79.56  (step t89.t3 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule resolution :premises (t89.t2 t89.a0))
% 79.25/79.56  (step t89 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule subproof :discharge (t89.a0))
% 79.25/79.56  (step t90 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule resolution :premises (t88 t89))
% 79.25/79.56  (step t91 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule implies_neg2)
% 79.25/79.56  (step t92 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule resolution :premises (t90 t91))
% 79.25/79.56  (step t93 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3)))) :rule contraction :premises (t92))
% 79.25/79.56  (step t94 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule implies :premises (t93))
% 79.25/79.56  (step t95 (cl (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) :rule resolution :premises (t94 a50))
% 79.25/79.56  (step t96 (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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) 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)
% 79.25/79.56  (anchor :step t97)
% 79.25/79.56  (assume t97.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))))
% 79.25/79.56  (step t97.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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)))) :rule forall_inst :args ((:= U tptp.sk3) (:= V tptp.sk3) (:= W (tptp.skaf45 tptp.sk4 tptp.sk3)) (:= X tptp.nil)))
% 79.25/79.56  (step t97.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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule or :premises (t97.t1))
% 79.25/79.56  (step t97.t3 (cl (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule resolution :premises (t97.t2 t97.a0))
% 79.25/79.56  (step t97 (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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule subproof :discharge (t97.a0))
% 79.25/79.56  (step t98 (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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule resolution :premises (t96 t97))
% 79.25/79.56  (step t99 (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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) (not (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)))) :rule implies_neg2)
% 79.25/79.56  (step t100 (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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) 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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)))) :rule resolution :premises (t98 t99))
% 79.25/79.56  (step t101 (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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)))) :rule contraction :premises (t100))
% 79.25/79.56  (step t102 (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.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule implies :premises (t101))
% 79.25/79.56  (step t103 (cl (or (not (tptp.segmentP tptp.sk3 tptp.sk3)) (not (tptp.ssList (tptp.skaf45 tptp.sk4 tptp.sk3))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)) (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3))) :rule resolution :premises (t102 a171))
% 79.25/79.56  (step t104 (cl (tptp.segmentP (tptp.app (tptp.app tptp.nil tptp.sk3) (tptp.skaf45 tptp.sk4 tptp.sk3)) tptp.sk3)) :rule resolution :premises (t76 a7 a187 t87 t95 t103))
% 79.25/79.56  (step t105 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t45 t59 t73 t104))
% 79.25/79.56  (step t106 (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)
% 79.25/79.56  (anchor :step t107)
% 79.25/79.56  (assume t107.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)))))
% 79.25/79.56  (step t107.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)))
% 79.25/79.56  (step t107.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 (t107.t1))
% 79.25/79.56  (step t107.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 (t107.t2 t107.a0))
% 79.25/79.56  (step t107 (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 (t107.a0))
% 79.25/79.56  (step t108 (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 (t106 t107))
% 79.25/79.56  (step t109 (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)
% 79.25/79.56  (step t110 (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 (t108 t109))
% 79.25/79.56  (step t111 (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 (t110))
% 79.25/79.56  (step t112 (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 (t111))
% 79.25/79.56  (step t113 (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)
% 79.25/79.56  (anchor :step t114 :args ((A $$unsorted) (:= A A)))
% 79.25/79.56  (step t114.t1 (cl (= A A)) :rule refl)
% 79.25/79.56  (step t114.t2 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 79.25/79.56  (step t114.t3 (cl (= (not (tptp.neq A tptp.nil)) (not (tptp.neq A tptp.nil)))) :rule refl)
% 79.25/79.56  (step t114.t4 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 79.25/79.56  (step t114.t5 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t114.t4 a190 a189))
% 79.25/79.56  (step t114.t6 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t114.t5))
% 79.25/79.56  (step t114.t7 (cl (= A A)) :rule refl)
% 79.25/79.56  (step t114.t8 (cl (= (tptp.segmentP tptp.sk2 A) (tptp.segmentP tptp.sk4 A))) :rule cong :premises (t114.t6 t114.t7))
% 79.25/79.56  (step t114.t9 (cl (= (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk4 A)))) :rule cong :premises (t114.t8))
% 79.25/79.56  (step t114.t10 (cl (= tptp.sk1 tptp.sk3)) :rule and :premises (t114.t5))
% 79.25/79.56  (step t114.t11 (cl (= (tptp.segmentP tptp.sk1 A) (tptp.segmentP tptp.sk3 A))) :rule cong :premises (t114.t10 t114.t7))
% 79.25/79.56  (step t114.t12 (cl (= (not (tptp.segmentP tptp.sk1 A)) (not (tptp.segmentP tptp.sk3 A)))) :rule cong :premises (t114.t11))
% 79.25/79.56  (step t114.t13 (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 (t114.t2 t114.t3 t114.t9 t114.t12))
% 79.25/79.56  (step t114 (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)
% 79.25/79.56  (step t115 (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 (t113 t114 a194))
% 79.25/79.56  (step t116 (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 (t112 t115))
% 79.25/79.56  (step t117 (cl (not (tptp.neq tptp.sk3 tptp.nil))) :rule resolution :premises (t29 a187 t105 t87 t116))
% 79.25/79.56  (step t118 (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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil 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)
% 79.25/79.56  (anchor :step t119)
% 79.25/79.56  (assume t119.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 79.25/79.56  (step t119.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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.sk3)))
% 79.25/79.56  (step t119.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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule or :premises (t119.t1))
% 79.25/79.56  (step t119.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t119.t2 t119.a0))
% 79.25/79.56  (step t119 (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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule subproof :discharge (t119.a0))
% 79.25/79.56  (step t120 (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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t118 t119))
% 79.25/79.56  (step t121 (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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule implies_neg2)
% 79.25/79.56  (step t122 (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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil 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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule resolution :premises (t120 t121))
% 79.25/79.56  (step t123 (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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3)))) :rule contraction :premises (t122))
% 79.25/79.56  (step t124 (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.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule implies :premises (t123))
% 79.25/79.56  (step t125 (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)
% 79.25/79.56  (anchor :step t126 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 79.25/79.56  (step t126.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t126.t2 (cl (= V V)) :rule refl)
% 79.25/79.56  (step t126.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.56  (step t126.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.56  (step t126.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 79.25/79.56  (step t126.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 79.25/79.56  (step t126.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 (t126.t3 t126.t4 t126.t5 t126.t6))
% 79.25/79.56  (step t126 (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)
% 79.25/79.56  (step t127 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t125 t126 a99))
% 79.25/79.56  (step t128 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 tptp.nil) (= tptp.nil tptp.sk3))) :rule resolution :premises (t124 t127))
% 79.25/79.56  (step t129 (cl (= tptp.nil tptp.sk3)) :rule resolution :premises (t27 a7 a187 t117 t128))
% 79.25/79.56  (step t130 (cl (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule and_neg)
% 79.25/79.56  (step t131 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t132)
% 79.25/79.56  (assume t132.a0 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t132.a1 (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))
% 79.25/79.56  (assume t132.a2 (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t132.a3 (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))
% 79.25/79.56  (step t132.t1 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t132.t2)
% 79.25/79.56  (assume t132.t2.a0 (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))
% 79.25/79.56  (assume t132.t2.a1 (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t132.t2.a2 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t132.t2.a3 (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))
% 79.25/79.56  (step t132.t2.t1 (cl (= (= (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule equiv_simplify)
% 79.25/79.56  (step t132.t2.t2 (cl (not (= (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true)) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule equiv1 :premises (t132.t2.t1))
% 79.25/79.56  (step t132.t2.t3 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) tptp.sk4)) :rule symm :premises (t132.t2.a2))
% 79.25/79.56  (step t132.t2.t4 (cl (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t132.t2.t3))
% 79.25/79.56  (step t132.t2.t5 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t132.t2.a1))
% 79.25/79.56  (step t132.t2.t6 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t132.t2.t5))
% 79.25/79.56  (step t132.t2.t7 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule trans :premises (t132.t2.t4 t132.t2.t6))
% 79.25/79.56  (step t132.t2.t8 (cl (= (tptp.hd tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule cong :premises (t132.t2.t4))
% 79.25/79.56  (step t132.t2.t9 (cl (= (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (tptp.skaf83 tptp.sk4))) :rule symm :premises (t132.t2.a3))
% 79.25/79.56  (step t132.t2.t10 (cl (= (tptp.hd tptp.sk4) (tptp.skaf83 tptp.sk4))) :rule trans :premises (t132.t2.t8 t132.t2.t9))
% 79.25/79.56  (step t132.t2.t11 (cl (= tptp.nil tptp.nil)) :rule refl)
% 79.25/79.56  (step t132.t2.t12 (cl (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule cong :premises (t132.t2.t10 t132.t2.t11))
% 79.25/79.56  (step t132.t2.t13 (cl (= (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule cong :premises (t132.t2.t7 t132.t2.t12))
% 79.25/79.56  (step t132.t2.t14 (cl (= (= (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) true) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule equiv_simplify)
% 79.25/79.56  (step t132.t2.t15 (cl (= (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) true) (not (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule equiv2 :premises (t132.t2.t14))
% 79.25/79.56  (step t132.t2.t16 (cl (= (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) true)) :rule resolution :premises (t132.t2.t15 t132.t2.a0))
% 79.25/79.56  (step t132.t2.t17 (cl (= (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true)) :rule trans :premises (t132.t2.t13 t132.t2.t16))
% 79.25/79.56  (step t132.t2.t18 (cl (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t132.t2.t2 t132.t2.t17))
% 79.25/79.56  (step t132.t2 (cl (not (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule subproof :discharge (t132.t2.a0 t132.t2.a1 t132.t2.a2 t132.t2.a3))
% 79.25/79.56  (step t132.t3 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule and_pos)
% 79.25/79.56  (step t132.t4 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t132.t5 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t132.t6 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_pos)
% 79.25/79.56  (step t132.t7 (cl (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule resolution :premises (t132.t2 t132.t3 t132.t4 t132.t5 t132.t6))
% 79.25/79.56  (step t132.t8 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule reordering :premises (t132.t7))
% 79.25/79.56  (step t132.t9 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule contraction :premises (t132.t8))
% 79.25/79.56  (step t132.t10 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t132.t1 t132.t9))
% 79.25/79.56  (step t132.t11 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies_neg2)
% 79.25/79.56  (step t132.t12 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (=> (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t132.t10 t132.t11))
% 79.25/79.56  (step t132.t13 (cl (=> (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule contraction :premises (t132.t12))
% 79.25/79.56  (step t132.t14 (cl (not (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule implies :premises (t132.t13))
% 79.25/79.56  (step t132.t15 (cl (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule and_neg)
% 79.25/79.56  (step t132.t16 (cl (and (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t132.t15 t132.a3 t132.a2 t132.a0 t132.a1))
% 79.25/79.56  (step t132.t17 (cl (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t132.t14 t132.t16))
% 79.25/79.56  (step t132 (cl (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule subproof :discharge (t132.a0 t132.a1 t132.a2 t132.a3))
% 79.25/79.56  (step t133 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t134 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_pos)
% 79.25/79.56  (step t135 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t136 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule and_pos)
% 79.25/79.56  (step t137 (cl (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule resolution :premises (t132 t133 t134 t135 t136))
% 79.25/79.56  (step t138 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule reordering :premises (t137))
% 79.25/79.56  (step t139 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule contraction :premises (t138))
% 79.25/79.56  (step t140 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t131 t139))
% 79.25/79.56  (step t141 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies_neg2)
% 79.25/79.56  (step t142 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t140 t141))
% 79.25/79.56  (step t143 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule contraction :premises (t142))
% 79.25/79.56  (step t144 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule implies :premises (t143))
% 79.25/79.56  (step t145 (cl (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t130 t144))
% 79.25/79.56  (step t146 (cl (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP tptp.sk4 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule reordering :premises (t145))
% 79.25/79.56  (step t147 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule or_pos)
% 79.25/79.56  (step t148 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))))) :rule reordering :premises (t147))
% 79.25/79.56  (step t149 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t150)
% 79.25/79.56  (assume t150.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 79.25/79.56  (step t150.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 79.25/79.56  (step t150.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) :rule or :premises (t150.t1))
% 79.25/79.56  (step t150.t3 (cl (tptp.ssItem (tptp.skaf83 tptp.sk4))) :rule resolution :premises (t150.t2 t150.a0))
% 79.25/79.56  (step t150 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) :rule subproof :discharge (t150.a0))
% 79.25/79.56  (step t151 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) :rule resolution :premises (t149 t150))
% 79.25/79.56  (step t152 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4)))) :rule implies_neg2)
% 79.25/79.56  (step t153 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk4)))) :rule resolution :premises (t151 t152))
% 79.25/79.56  (step t154 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk4)))) :rule contraction :premises (t153))
% 79.25/79.56  (step t155 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk4))) :rule implies :premises (t154))
% 79.25/79.56  (step t156 (cl (tptp.ssItem (tptp.skaf83 tptp.sk4))) :rule resolution :premises (t155 a11))
% 79.25/79.56  (step t157 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk4))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t158)
% 79.25/79.56  (assume t158.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 79.25/79.56  (step t158.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 79.25/79.56  (step t158.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk4))) :rule or :premises (t158.t1))
% 79.25/79.56  (step t158.t3 (cl (tptp.ssList (tptp.skaf82 tptp.sk4))) :rule resolution :premises (t158.t2 t158.a0))
% 79.25/79.56  (step t158 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk4))) :rule subproof :discharge (t158.a0))
% 79.25/79.56  (step t159 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk4))) (tptp.ssList (tptp.skaf82 tptp.sk4))) :rule resolution :premises (t157 t158))
% 79.25/79.56  (step t160 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4)))) :rule implies_neg2)
% 79.25/79.56  (step t161 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk4))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t159 t160))
% 79.25/79.56  (step t162 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk4)))) :rule contraction :premises (t161))
% 79.25/79.56  (step t163 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk4))) :rule implies :premises (t162))
% 79.25/79.56  (step t164 (cl (tptp.ssList (tptp.skaf82 tptp.sk4))) :rule resolution :premises (t163 a12))
% 79.25/79.56  (step t165 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (=> (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))))) (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (=> (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))))) :rule equiv_pos2)
% 79.25/79.56  (step t166 (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)
% 79.25/79.56  (step t167 (cl (= (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))))) :rule refl)
% 79.25/79.56  (step t168 (cl (= (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))))) :rule refl)
% 79.25/79.56  (step t169 (cl (= (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule all_simplify)
% 79.25/79.56  (step t170 (cl (= (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))))) :rule cong :premises (t167 t168 t169))
% 79.25/79.56  (step t171 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (=> (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))))) :rule cong :premises (t166 t170))
% 79.25/79.56  (step t172 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (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)
% 79.25/79.56  (anchor :step t173)
% 79.25/79.56  (assume t173.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)))))
% 79.25/79.56  (step t173.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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk4)) (:= V (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (step t173.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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule or :premises (t173.t1))
% 79.25/79.56  (step t173.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t173.t2 t173.a0))
% 79.25/79.56  (step t173 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule subproof :discharge (t173.a0))
% 79.25/79.56  (step t174 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t172 t173))
% 79.25/79.56  (step t175 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule implies_neg2)
% 79.25/79.56  (step t176 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (=> (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t174 t175))
% 79.25/79.56  (step t177 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule contraction :premises (t176))
% 79.25/79.56  (step t178 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t165 t171 t177))
% 79.25/79.56  (step t179 (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.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule implies :premises (t178))
% 79.25/79.56  (step t180 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t179 a119))
% 79.25/79.56  (step t181 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t148 t156 t164 t180))
% 79.25/79.56  (step t182 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule or_pos)
% 79.25/79.56  (step t183 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule reordering :premises (t182))
% 79.25/79.56  (step t184 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t185)
% 79.25/79.56  (assume t185.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 79.25/79.56  (step t185.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk4)) (:= V (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (step t185.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule or :premises (t185.t1))
% 79.25/79.56  (step t185.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t185.t2 t185.a0))
% 79.25/79.56  (step t185 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule subproof :discharge (t185.a0))
% 79.25/79.56  (step t186 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t184 t185))
% 79.25/79.56  (step t187 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule implies_neg2)
% 79.25/79.56  (step t188 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule resolution :premises (t186 t187))
% 79.25/79.56  (step t189 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule contraction :premises (t188))
% 79.25/79.56  (step t190 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule implies :premises (t189))
% 79.25/79.56  (step t191 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule equiv_pos2)
% 79.25/79.56  (anchor :step t192 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 79.25/79.56  (step t192.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t192.t2 (cl (= V V)) :rule refl)
% 79.25/79.56  (step t192.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 79.25/79.56  (step t192.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.56  (step t192.t5 (cl (= (= (tptp.hd (tptp.cons U V)) U) (= U (tptp.hd (tptp.cons U V))))) :rule all_simplify)
% 79.25/79.56  (step t192.t6 (cl (= (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule cong :premises (t192.t3 t192.t4 t192.t5))
% 79.25/79.56  (step t192 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))) :rule bind)
% 79.25/79.56  (step t193 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule resolution :premises (t191 t192 a96))
% 79.25/79.56  (step t194 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t190 t193))
% 79.25/79.56  (step t195 (cl (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t183 t156 t164 t194))
% 79.25/79.56  (step t196 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)) :rule or_pos)
% 79.25/79.56  (step t197 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)))) :rule reordering :premises (t196))
% 79.25/79.56  (step t198 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t199)
% 79.25/79.56  (assume t199.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 79.25/79.56  (step t199.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))
% 79.25/79.56  (step t199.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule or :premises (t199.t1))
% 79.25/79.56  (step t199.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule resolution :premises (t199.t2 t199.a0))
% 79.25/79.56  (step t199 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule subproof :discharge (t199.a0))
% 79.25/79.56  (step t200 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule resolution :premises (t198 t199))
% 79.25/79.56  (step t201 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)))) :rule implies_neg2)
% 79.25/79.56  (step t202 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)))) :rule resolution :premises (t200 t201))
% 79.25/79.56  (step t203 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil)))) :rule contraction :premises (t202))
% 79.25/79.56  (step t204 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil)))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule implies :premises (t203))
% 79.25/79.56  (step t205 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.segmentP (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.nil))) :rule resolution :premises (t204 a55))
% 79.25/79.56  (step t206 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule or_pos)
% 79.25/79.56  (step t207 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule reordering :premises (t206))
% 79.25/79.56  (step t208 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) 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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) 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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule equiv_pos2)
% 79.25/79.56  (step t209 (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)
% 79.25/79.56  (step t210 (cl (= (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule refl)
% 79.25/79.56  (step t211 (cl (= (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk3)))) :rule refl)
% 79.25/79.56  (step t212 (cl (= (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule refl)
% 79.25/79.56  (step t213 (cl (= (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule all_simplify)
% 79.25/79.56  (step t214 (cl (= (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule cong :premises (t210 t211 t212 t213))
% 79.25/79.56  (step t215 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) 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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule cong :premises (t209 t214))
% 79.25/79.56  (step t216 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) 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)
% 79.25/79.56  (anchor :step t217)
% 79.25/79.56  (assume t217.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 79.25/79.56  (step t217.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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule forall_inst :args ((:= U (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (:= V tptp.sk3)))
% 79.25/79.56  (step t217.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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule or :premises (t217.t1))
% 79.25/79.56  (step t217.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule resolution :premises (t217.t2 t217.a0))
% 79.25/79.56  (step t217 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule subproof :discharge (t217.a0))
% 79.25/79.56  (step t218 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule resolution :premises (t216 t217))
% 79.25/79.56  (step t219 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule implies_neg2)
% 79.25/79.56  (step t220 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) 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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule resolution :premises (t218 t219))
% 79.25/79.56  (step t221 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule contraction :premises (t220))
% 79.25/79.56  (step t222 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t208 t215 t221))
% 79.25/79.56  (step t223 (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.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies :premises (t222))
% 79.25/79.56  (step t224 (cl (or (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (tptp.neq tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t223 t127))
% 79.25/79.56  (step t225 (cl (not (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule or_pos)
% 79.25/79.56  (step t226 (cl (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule reordering :premises (t225))
% 79.25/79.56  (step t227 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t228)
% 79.25/79.56  (assume t228.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))
% 79.25/79.56  (step t228.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (:= V (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (step t228.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule or :premises (t228.t1))
% 79.25/79.56  (step t228.t3 (cl (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t228.t2 t228.a0))
% 79.25/79.56  (step t228 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule subproof :discharge (t228.a0))
% 79.25/79.56  (step t229 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t227 t228))
% 79.25/79.56  (step t230 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule implies_neg2)
% 79.25/79.56  (step t231 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule resolution :premises (t229 t230))
% 79.25/79.56  (step t232 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule contraction :premises (t231))
% 79.25/79.56  (step t233 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule implies :premises (t232))
% 79.25/79.56  (step t234 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule equiv_pos2)
% 79.25/79.56  (anchor :step t235 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 79.25/79.56  (step t235.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t235.t2 (cl (= V V)) :rule refl)
% 79.25/79.56  (step t235.t3 (cl (= W W)) :rule refl)
% 79.25/79.56  (step t235.t4 (cl (= (= (tptp.app U V) W) (= W (tptp.app U V)))) :rule all_simplify)
% 79.25/79.56  (step t235.t5 (cl (= (not (= (tptp.app U V) W)) (not (= W (tptp.app U V))))) :rule cong :premises (t235.t4))
% 79.25/79.56  (step t235.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.56  (step t235.t7 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.56  (step t235.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 79.25/79.56  (step t235.t9 (cl (= (tptp.frontsegP W U) (tptp.frontsegP W U))) :rule refl)
% 79.25/79.56  (step t235.t10 (cl (= (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U)))) :rule cong :premises (t235.t5 t235.t6 t235.t7 t235.t8 t235.t9))
% 79.25/79.56  (step t235 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))) :rule bind)
% 79.25/79.56  (step t236 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule all_simplify)
% 79.25/79.56  (anchor :step t237 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 79.25/79.56  (step t237.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t237.t2 (cl (= V V)) :rule refl)
% 79.25/79.56  (step t237.t3 (cl (= (= (tptp.app U V) (tptp.app U V)) true)) :rule all_simplify)
% 79.25/79.56  (step t237.t4 (cl (= (not (= (tptp.app U V) (tptp.app U V))) (not true))) :rule cong :premises (t237.t3))
% 79.25/79.56  (step t237.t5 (cl (= (not true) false)) :rule all_simplify)
% 79.25/79.56  (step t237.t6 (cl (= (not (= (tptp.app U V) (tptp.app U V))) false)) :rule trans :premises (t237.t4 t237.t5))
% 79.25/79.56  (step t237.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.56  (step t237.t8 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.56  (step t237.t9 (cl (= (not (tptp.ssList (tptp.app U V))) (not (tptp.ssList (tptp.app U V))))) :rule refl)
% 79.25/79.56  (step t237.t10 (cl (= (tptp.frontsegP (tptp.app U V) U) (tptp.frontsegP (tptp.app U V) U))) :rule refl)
% 79.25/79.56  (step t237.t11 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule cong :premises (t237.t6 t237.t7 t237.t8 t237.t9 t237.t10))
% 79.25/79.56  (step t237.t12 (cl (= (or false (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule all_simplify)
% 79.25/79.56  (step t237.t13 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule trans :premises (t237.t11 t237.t12))
% 79.25/79.56  (step t237 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule bind)
% 79.25/79.56  (step t238 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t236 t237))
% 79.25/79.56  (step t239 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U))))) :rule trans :premises (t235 t238))
% 79.25/79.56  (step t240 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList (tptp.app U V))) (tptp.frontsegP (tptp.app U V) U)))) :rule resolution :premises (t234 t239 a143))
% 79.25/79.56  (step t241 (cl (or (not (tptp.ssList (tptp.skaf82 tptp.sk4))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.frontsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t233 t240))
% 79.25/79.56  (step t242 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule or_pos)
% 79.25/79.56  (step t243 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule reordering :premises (t242))
% 79.25/79.56  (step t244 (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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) 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)
% 79.25/79.56  (anchor :step t245)
% 79.25/79.56  (assume t245.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 79.25/79.56  (step t245.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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk4)) (:= V tptp.nil)))
% 79.25/79.56  (step t245.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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule or :premises (t245.t1))
% 79.25/79.56  (step t245.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t245.t2 t245.a0))
% 79.25/79.56  (step t245 (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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule subproof :discharge (t245.a0))
% 79.25/79.56  (step t246 (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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t244 t245))
% 79.25/79.56  (step t247 (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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule implies_neg2)
% 79.25/79.56  (step t248 (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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) 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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule resolution :premises (t246 t247))
% 79.25/79.56  (step t249 (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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule contraction :premises (t248))
% 79.25/79.56  (step t250 (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.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule implies :premises (t249))
% 79.25/79.56  (step t251 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t250 a85))
% 79.25/79.56  (step t252 (cl (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule resolution :premises (t243 a7 t156 t251))
% 79.25/79.56  (step t253 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t2 t10 t25 t129 t146 t181 t195 t197 t205 t207 t224 a187 t226 t241 t252 t164))
% 79.25/79.56  (step t254 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule contraction :premises (t253))
% 79.25/79.56  (step t255 (cl (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule and_neg)
% 79.25/79.56  (step t256 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t257)
% 79.25/79.56  (assume t257.a0 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t257.a1 (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))
% 79.25/79.56  (assume t257.a2 (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))
% 79.25/79.56  (step t257.t1 (cl (=> (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t257.t2)
% 79.25/79.56  (assume t257.t2.a0 (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))
% 79.25/79.56  (assume t257.t2.a1 (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))
% 79.25/79.56  (assume t257.t2.a2 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (step t257.t2.t1 (cl (= (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule equiv_simplify)
% 79.25/79.56  (step t257.t2.t2 (cl (not (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule equiv1 :premises (t257.t2.t1))
% 79.25/79.56  (step t257.t2.t3 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) tptp.sk4)) :rule symm :premises (t257.t2.a2))
% 79.25/79.56  (step t257.t2.t4 (cl (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t257.t2.t3))
% 79.25/79.56  (step t257.t2.t5 (cl (= (tptp.hd tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule cong :premises (t257.t2.t4))
% 79.25/79.56  (step t257.t2.t6 (cl (= (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (tptp.skaf83 tptp.sk4))) :rule symm :premises (t257.t2.a1))
% 79.25/79.56  (step t257.t2.t7 (cl (= (tptp.hd tptp.sk4) (tptp.skaf83 tptp.sk4))) :rule trans :premises (t257.t2.t5 t257.t2.t6))
% 79.25/79.56  (step t257.t2.t8 (cl (= tptp.nil tptp.nil)) :rule refl)
% 79.25/79.56  (step t257.t2.t9 (cl (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule cong :premises (t257.t2.t7 t257.t2.t8))
% 79.25/79.56  (step t257.t2.t10 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule cong :premises (t257.t2.t9))
% 79.25/79.56  (step t257.t2.t11 (cl (= (= (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) true) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule equiv_simplify)
% 79.25/79.56  (step t257.t2.t12 (cl (= (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) true) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule equiv2 :premises (t257.t2.t11))
% 79.25/79.56  (step t257.t2.t13 (cl (= (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) true)) :rule resolution :premises (t257.t2.t12 t257.t2.a0))
% 79.25/79.56  (step t257.t2.t14 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true)) :rule trans :premises (t257.t2.t10 t257.t2.t13))
% 79.25/79.56  (step t257.t2.t15 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t257.t2.t2 t257.t2.t14))
% 79.25/79.56  (step t257.t2 (cl (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule subproof :discharge (t257.t2.a0 t257.t2.a1 t257.t2.a2))
% 79.25/79.56  (step t257.t3 (cl (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule and_pos)
% 79.25/79.56  (step t257.t4 (cl (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_pos)
% 79.25/79.56  (step t257.t5 (cl (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t257.t6 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t257.t2 t257.t3 t257.t4 t257.t5))
% 79.25/79.56  (step t257.t7 (cl (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule reordering :premises (t257.t6))
% 79.25/79.56  (step t257.t8 (cl (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule contraction :premises (t257.t7))
% 79.25/79.56  (step t257.t9 (cl (=> (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t257.t1 t257.t8))
% 79.25/79.56  (step t257.t10 (cl (=> (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies_neg2)
% 79.25/79.56  (step t257.t11 (cl (=> (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (=> (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t257.t9 t257.t10))
% 79.25/79.56  (step t257.t12 (cl (=> (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule contraction :premises (t257.t11))
% 79.25/79.56  (step t257.t13 (cl (not (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule implies :premises (t257.t12))
% 79.25/79.56  (step t257.t14 (cl (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_neg)
% 79.25/79.56  (step t257.t15 (cl (and (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t257.t14 t257.a2 t257.a1 t257.a0))
% 79.25/79.56  (step t257.t16 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t257.t13 t257.t15))
% 79.25/79.56  (step t257 (cl (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule subproof :discharge (t257.a0 t257.a1 t257.a2))
% 79.25/79.56  (step t258 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t259 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_pos)
% 79.25/79.56  (step t260 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule and_pos)
% 79.25/79.56  (step t261 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule resolution :premises (t257 t258 t259 t260))
% 79.25/79.56  (step t262 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule reordering :premises (t261))
% 79.25/79.56  (step t263 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule contraction :premises (t262))
% 79.25/79.56  (step t264 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t256 t263))
% 79.25/79.56  (step t265 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies_neg2)
% 79.25/79.56  (step t266 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t264 t265))
% 79.25/79.56  (step t267 (cl (=> (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule contraction :premises (t266))
% 79.25/79.56  (step t268 (cl (not (and (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule implies :premises (t267))
% 79.25/79.56  (step t269 (cl (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t255 t268))
% 79.25/79.56  (step t270 (cl (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule reordering :premises (t269))
% 79.25/79.56  (step t271 (cl (not (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) (not (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule equiv_pos2)
% 79.25/79.56  (step t272 (cl (= (not (= tptp.nil tptp.sk3)) (not (= tptp.nil tptp.sk3)))) :rule refl)
% 79.25/79.56  (step t273 (cl (= (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule refl)
% 79.25/79.56  (step t274 (cl (= (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule refl)
% 79.25/79.56  (step t275 (cl (= (= (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) true) (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule equiv_simplify)
% 79.25/79.56  (step t276 (cl (not (= (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) true)) (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule equiv1 :premises (t275))
% 79.25/79.56  (step t277 (cl (= (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))))) :rule all_simplify)
% 79.25/79.56  (step t278 (cl (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule refl)
% 79.25/79.56  (step t279 (cl (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule all_simplify)
% 79.25/79.56  (step t280 (cl (= (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule cong :premises (t278 t279))
% 79.25/79.56  (step t281 (cl (= (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) true)) :rule all_simplify)
% 79.25/79.56  (step t282 (cl (= (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) true)) :rule trans :premises (t280 t281))
% 79.25/79.56  (step t283 (cl (= (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) true)) :rule trans :premises (t277 t282))
% 79.25/79.56  (step t284 (cl (= (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t276 t283))
% 79.25/79.56  (step t285 (cl (= (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule refl)
% 79.25/79.56  (step t286 (cl (= (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule cong :premises (t272 t273 t274 t284 t285))
% 79.25/79.56  (step t287 (cl (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule and_neg)
% 79.25/79.56  (step t288 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t289)
% 79.25/79.56  (assume t289.a0 (= tptp.nil tptp.sk3))
% 79.25/79.56  (assume t289.a1 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t289.a2 (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))
% 79.25/79.56  (assume t289.a3 (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))
% 79.25/79.56  (step t289.t1 (cl (=> (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t289.t2)
% 79.25/79.56  (assume t289.t2.a0 (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))
% 79.25/79.56  (assume t289.t2.a1 (= tptp.nil tptp.sk3))
% 79.25/79.56  (assume t289.t2.a2 (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))
% 79.25/79.56  (assume t289.t2.a3 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (step t289.t2.t1 (cl (= (= (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) false) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule equiv_simplify)
% 79.25/79.56  (step t289.t2.t2 (cl (not (= (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) false)) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule equiv1 :premises (t289.t2.t1))
% 79.25/79.56  (step t289.t2.t3 (cl (= tptp.sk3 tptp.nil)) :rule symm :premises (t289.t2.a1))
% 79.25/79.56  (step t289.t2.t4 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) tptp.sk4)) :rule symm :premises (t289.t2.a3))
% 79.25/79.56  (step t289.t2.t5 (cl (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t289.t2.t4))
% 79.25/79.56  (step t289.t2.t6 (cl (= (tptp.hd tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule cong :premises (t289.t2.t5))
% 79.25/79.56  (step t289.t2.t7 (cl (= (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (tptp.skaf83 tptp.sk4))) :rule symm :premises (t289.t2.a2))
% 79.25/79.56  (step t289.t2.t8 (cl (= (tptp.hd tptp.sk4) (tptp.skaf83 tptp.sk4))) :rule trans :premises (t289.t2.t6 t289.t2.t7))
% 79.25/79.56  (step t289.t2.t9 (cl (= tptp.nil tptp.nil)) :rule refl)
% 79.25/79.56  (step t289.t2.t10 (cl (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule cong :premises (t289.t2.t8 t289.t2.t9))
% 79.25/79.56  (step t289.t2.t11 (cl (= (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule cong :premises (t289.t2.t3 t289.t2.t10))
% 79.25/79.56  (step t289.t2.t12 (cl (= (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) false) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule equiv_simplify)
% 79.25/79.56  (step t289.t2.t13 (cl (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) false) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) :rule equiv2 :premises (t289.t2.t12))
% 79.25/79.56  (step t289.t2.t14 (cl (not (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule not_not)
% 79.25/79.56  (step t289.t2.t15 (cl (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) false) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) :rule resolution :premises (t289.t2.t13 t289.t2.t14))
% 79.25/79.56  (step t289.t2.t16 (cl (= (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) false)) :rule resolution :premises (t289.t2.t15 t289.t2.a0))
% 79.25/79.56  (step t289.t2.t17 (cl (= (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) false)) :rule trans :premises (t289.t2.t11 t289.t2.t16))
% 79.25/79.56  (step t289.t2.t18 (cl (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t289.t2.t2 t289.t2.t17))
% 79.25/79.56  (step t289.t2 (cl (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.nil tptp.sk3)) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule subproof :discharge (t289.t2.a0 t289.t2.a1 t289.t2.a2 t289.t2.a3))
% 79.25/79.56  (step t289.t3 (cl (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule and_pos)
% 79.25/79.56  (step t289.t4 (cl (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 79.25/79.56  (step t289.t5 (cl (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_pos)
% 79.25/79.56  (step t289.t6 (cl (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t289.t7 (cl (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t289.t2 t289.t3 t289.t4 t289.t5 t289.t6))
% 79.25/79.56  (step t289.t8 (cl (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule reordering :premises (t289.t7))
% 79.25/79.56  (step t289.t9 (cl (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule contraction :premises (t289.t8))
% 79.25/79.56  (step t289.t10 (cl (=> (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t289.t1 t289.t9))
% 79.25/79.56  (step t289.t11 (cl (=> (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule implies_neg2)
% 79.25/79.56  (step t289.t12 (cl (=> (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (=> (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t289.t10 t289.t11))
% 79.25/79.56  (step t289.t13 (cl (=> (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule contraction :premises (t289.t12))
% 79.25/79.56  (step t289.t14 (cl (not (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies :premises (t289.t13))
% 79.25/79.56  (step t289.t15 (cl (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.nil tptp.sk3)) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_neg)
% 79.25/79.56  (step t289.t16 (cl (and (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (= tptp.nil tptp.sk3) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t289.t15 t289.a3 t289.a0 t289.a2 t289.a1))
% 79.25/79.56  (step t289.t17 (cl (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t289.t14 t289.t16))
% 79.25/79.56  (step t289 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule subproof :discharge (t289.a0 t289.a1 t289.a2 t289.a3))
% 79.25/79.56  (step t290 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (= tptp.nil tptp.sk3)) :rule and_pos)
% 79.25/79.56  (step t291 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t292 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule and_pos)
% 79.25/79.56  (step t293 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule and_pos)
% 79.25/79.56  (step t294 (cl (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))))) :rule resolution :premises (t289 t290 t291 t292 t293))
% 79.25/79.56  (step t295 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule reordering :premises (t294))
% 79.25/79.56  (step t296 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule contraction :premises (t295))
% 79.25/79.56  (step t297 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t288 t296))
% 79.25/79.56  (step t298 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule implies_neg2)
% 79.25/79.56  (step t299 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (=> (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t297 t298))
% 79.25/79.56  (step t300 (cl (=> (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule contraction :premises (t299))
% 79.25/79.56  (step t301 (cl (not (and (= tptp.nil tptp.sk3) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies :premises (t300))
% 79.25/79.56  (step t302 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t287 t301))
% 79.25/79.56  (step t303 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (not (= tptp.nil tptp.sk3)))) :rule or_neg)
% 79.25/79.56  (step t304 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))))) :rule or_neg)
% 79.25/79.56  (step t305 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))))) :rule or_neg)
% 79.25/79.56  (step t306 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))))) :rule or_neg)
% 79.25/79.56  (step t307 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule or_neg)
% 79.25/79.56  (step t308 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t302 t303 t304 t305 t306 t307))
% 79.25/79.56  (step t309 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (not (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule contraction :premises (t308))
% 79.25/79.56  (step t310 (cl (or (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t271 t286 t309))
% 79.25/79.56  (step t311 (cl (not (= tptp.nil tptp.sk3)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.skaf83 tptp.sk4) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)) (not (= tptp.sk3 (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule or :premises (t310))
% 79.25/79.56  (step t312 (cl (not (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 79.25/79.56  (step t313 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t312))
% 79.25/79.56  (step t314 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t315)
% 79.25/79.56  (assume t315.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 79.25/79.56  (step t315.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk4)) (:= V tptp.nil)))
% 79.25/79.56  (step t315.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule or :premises (t315.t1))
% 79.25/79.56  (step t315.t3 (cl (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t315.t2 t315.a0))
% 79.25/79.56  (step t315 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t315.a0))
% 79.25/79.56  (step t316 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t314 t315))
% 79.25/79.56  (step t317 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 79.25/79.56  (step t318 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t316 t317))
% 79.25/79.56  (step t319 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t318))
% 79.25/79.56  (step t320 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t319))
% 79.25/79.56  (step t321 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 79.25/79.56  (anchor :step t322 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 79.25/79.56  (step t322.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t322.t2 (cl (= V V)) :rule refl)
% 79.25/79.56  (step t322.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 79.25/79.56  (step t322.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t322.t3))
% 79.25/79.56  (step t322.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 79.25/79.56  (step t322.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.56  (step t322.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t322.t4 t322.t5 t322.t6))
% 79.25/79.56  (step t322 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 79.25/79.56  (step t323 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t321 t322 a97))
% 79.25/79.56  (step t324 (cl (or (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.skaf83 tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t320 t323))
% 79.25/79.56  (step t325 (cl (not (= tptp.nil (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil)))) :rule resolution :premises (t313 a7 t156 t324))
% 79.25/79.56  (step t326 (cl (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (tptp.ssList tptp.sk4)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule and_neg)
% 79.25/79.56  (step t327 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t328)
% 79.25/79.56  (assume t328.a0 (tptp.ssList tptp.sk4))
% 79.25/79.56  (assume t328.a1 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t328.a2 (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (step t328.t1 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t328.t2)
% 79.25/79.56  (assume t328.t2.a0 (tptp.ssList tptp.sk4))
% 79.25/79.56  (assume t328.t2.a1 (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (assume t328.t2.a2 (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))
% 79.25/79.56  (step t328.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) true) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule equiv_simplify)
% 79.25/79.56  (step t328.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) true)) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule equiv1 :premises (t328.t2.t1))
% 79.25/79.56  (step t328.t2.t3 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t328.t2.a2))
% 79.25/79.56  (step t328.t2.t4 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t328.t2.t3))
% 79.25/79.56  (step t328.t2.t5 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t328.t2.t4))
% 79.25/79.56  (step t328.t2.t6 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) tptp.sk4)) :rule symm :premises (t328.t2.a1))
% 79.25/79.56  (step t328.t2.t7 (cl (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule symm :premises (t328.t2.t6))
% 79.25/79.56  (step t328.t2.t8 (cl (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) tptp.sk4)) :rule symm :premises (t328.t2.t7))
% 79.25/79.56  (step t328.t2.t9 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)) tptp.sk4)) :rule trans :premises (t328.t2.t5 t328.t2.t8))
% 79.25/79.56  (step t328.t2.t10 (cl (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (tptp.ssList tptp.sk4))) :rule cong :premises (t328.t2.t9))
% 79.25/79.56  (step t328.t2.t11 (cl (= (= (tptp.ssList tptp.sk4) true) (tptp.ssList tptp.sk4))) :rule equiv_simplify)
% 79.25/79.56  (step t328.t2.t12 (cl (= (tptp.ssList tptp.sk4) true) (not (tptp.ssList tptp.sk4))) :rule equiv2 :premises (t328.t2.t11))
% 79.25/79.56  (step t328.t2.t13 (cl (= (tptp.ssList tptp.sk4) true)) :rule resolution :premises (t328.t2.t12 t328.t2.a0))
% 79.25/79.56  (step t328.t2.t14 (cl (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) true)) :rule trans :premises (t328.t2.t10 t328.t2.t13))
% 79.25/79.56  (step t328.t2.t15 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t328.t2.t2 t328.t2.t14))
% 79.25/79.56  (step t328.t2 (cl (not (tptp.ssList tptp.sk4)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule subproof :discharge (t328.t2.a0 t328.t2.a1 t328.t2.a2))
% 79.25/79.56  (step t328.t3 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList tptp.sk4)) :rule and_pos)
% 79.25/79.56  (step t328.t4 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t328.t5 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t328.t6 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t328.t2 t328.t3 t328.t4 t328.t5))
% 79.25/79.56  (step t328.t7 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule reordering :premises (t328.t6))
% 79.25/79.56  (step t328.t8 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule contraction :premises (t328.t7))
% 79.25/79.56  (step t328.t9 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t328.t1 t328.t8))
% 79.25/79.56  (step t328.t10 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule implies_neg2)
% 79.25/79.56  (step t328.t11 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t328.t9 t328.t10))
% 79.25/79.56  (step t328.t12 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule contraction :premises (t328.t11))
% 79.25/79.56  (step t328.t13 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule implies :premises (t328.t12))
% 79.25/79.56  (step t328.t14 (cl (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (tptp.ssList tptp.sk4)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule and_neg)
% 79.25/79.56  (step t328.t15 (cl (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t328.t14 t328.a0 t328.a1 t328.a2))
% 79.25/79.56  (step t328.t16 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t328.t13 t328.t15))
% 79.25/79.56  (step t328 (cl (not (tptp.ssList tptp.sk4)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule subproof :discharge (t328.a0 t328.a1 t328.a2))
% 79.25/79.56  (step t329 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList tptp.sk4)) :rule and_pos)
% 79.25/79.56  (step t330 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t331 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule and_pos)
% 79.25/79.56  (step t332 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))))) :rule resolution :premises (t328 t329 t330 t331))
% 79.25/79.56  (step t333 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule reordering :premises (t332))
% 79.25/79.56  (step t334 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule contraction :premises (t333))
% 79.25/79.56  (step t335 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t327 t334))
% 79.25/79.56  (step t336 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule implies_neg2)
% 79.25/79.56  (step t337 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t335 t336))
% 79.25/79.56  (step t338 (cl (=> (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) :rule contraction :premises (t337))
% 79.25/79.56  (step t339 (cl (not (and (tptp.ssList tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule implies :premises (t338))
% 79.25/79.56  (step t340 (cl (not (tptp.ssList tptp.sk4)) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk4) tptp.nil) (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t326 t339))
% 79.25/79.56  (step t341 (cl (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule resolution :premises (t254 t270 t252 t195 t311 t325 t129 t195 t340 t181 a188))
% 79.25/79.56  (step t342 (cl (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))))) :rule contraction :premises (t341))
% 79.25/79.56  (step t343 (cl (not (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) (not (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule reordering :premises (t342))
% 79.25/79.56  (step t344 (cl (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule or_pos)
% 79.25/79.56  (step t345 (cl (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule reordering :premises (t344))
% 79.25/79.56  (step t346 (cl (not (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4)) :rule or_pos)
% 79.25/79.56  (step t347 (cl (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4) (not (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t346))
% 79.25/79.56  (step t348 (cl (not (= (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule equiv_pos2)
% 79.25/79.56  (step t349 (cl (= (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.segmentP tptp.nil tptp.nil)))) :rule refl)
% 79.25/79.56  (step t350 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 79.25/79.56  (step t351 (cl (= (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule refl)
% 79.25/79.56  (step t352 (cl (= (= (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) true) (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule equiv_simplify)
% 79.25/79.56  (step t353 (cl (not (= (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) true)) (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule equiv1 :premises (t352))
% 79.25/79.56  (step t354 (cl (= (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) :rule all_simplify)
% 79.25/79.56  (step t355 (cl (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule refl)
% 79.25/79.56  (step t356 (cl (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule all_simplify)
% 79.25/79.56  (step t357 (cl (= (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule cong :premises (t355 t356))
% 79.25/79.56  (step t358 (cl (= (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) true)) :rule all_simplify)
% 79.25/79.56  (step t359 (cl (= (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) true)) :rule trans :premises (t357 t358))
% 79.25/79.56  (step t360 (cl (= (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) true)) :rule trans :premises (t354 t359))
% 79.25/79.56  (step t361 (cl (= (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule resolution :premises (t353 t360))
% 79.25/79.56  (step t362 (cl (= (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule cong :premises (t349 t350 t351 t361))
% 79.25/79.56  (step t363 (cl (not (= (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) (not (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule equiv_pos2)
% 79.25/79.56  (step t364 (cl (= (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule refl)
% 79.25/79.56  (step t365 (cl (= (= (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) :rule equiv_simplify)
% 79.25/79.56  (step t366 (cl (= (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (not (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) :rule equiv2 :premises (t365))
% 79.25/79.56  (step t367 (cl (not (not (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule not_not)
% 79.25/79.56  (step t368 (cl (= (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule resolution :premises (t366 t367))
% 79.25/79.56  (step t369 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t370)
% 79.25/79.56  (assume t370.a0 (tptp.segmentP tptp.nil tptp.nil))
% 79.25/79.56  (assume t370.a1 (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))
% 79.25/79.56  (assume t370.a2 (= tptp.nil tptp.sk4))
% 79.25/79.56  (assume t370.a3 (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))
% 79.25/79.56  (step t370.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 79.25/79.56  (step t370.t2 (cl (= (= false true) false)) :rule all_simplify)
% 79.25/79.56  (step t370.t3 (cl (= (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) false) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule equiv_simplify)
% 79.25/79.56  (step t370.t4 (cl (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) false) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule equiv2 :premises (t370.t3))
% 79.25/79.56  (step t370.t5 (cl (not (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) :rule not_not)
% 79.25/79.56  (step t370.t6 (cl (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) false) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) :rule resolution :premises (t370.t4 t370.t5))
% 79.25/79.56  (step t370.t7 (cl (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) false)) :rule resolution :premises (t370.t6 t370.a3))
% 79.25/79.56  (step t370.t8 (cl (= false (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule symm :premises (t370.t7))
% 79.25/79.56  (step t370.t9 (cl (= (tptp.skaf48 tptp.nil tptp.nil) tptp.nil)) :rule symm :premises (t370.a1))
% 79.25/79.56  (step t370.t10 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t370.a2))
% 79.25/79.56  (step t370.t11 (cl (= (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (tptp.segmentP tptp.nil tptp.nil))) :rule cong :premises (t370.t9 t370.t10))
% 79.25/79.56  (step t370.t12 (cl (= (= (tptp.segmentP tptp.nil tptp.nil) true) (tptp.segmentP tptp.nil tptp.nil))) :rule equiv_simplify)
% 79.25/79.56  (step t370.t13 (cl (= (tptp.segmentP tptp.nil tptp.nil) true) (not (tptp.segmentP tptp.nil tptp.nil))) :rule equiv2 :premises (t370.t12))
% 79.25/79.56  (step t370.t14 (cl (= (tptp.segmentP tptp.nil tptp.nil) true)) :rule resolution :premises (t370.t13 t370.a0))
% 79.25/79.56  (step t370.t15 (cl (= false true)) :rule trans :premises (t370.t8 t370.t11 t370.t14))
% 79.25/79.56  (step t370.t16 (cl false) :rule resolution :premises (t370.t1 t370.t2 t370.t15))
% 79.25/79.56  (step t370 (cl (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) :rule subproof :discharge (t370.a0 t370.a1 t370.a2 t370.a3))
% 79.25/79.56  (step t371 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (tptp.segmentP tptp.nil tptp.nil)) :rule and_pos)
% 79.25/79.56  (step t372 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule and_pos)
% 79.25/79.56  (step t373 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 79.25/79.56  (step t374 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule and_pos)
% 79.25/79.56  (step t375 (cl false (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule resolution :premises (t370 t371 t372 t373 t374))
% 79.25/79.56  (step t376 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) false) :rule reordering :premises (t375))
% 79.25/79.56  (step t377 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) false) :rule contraction :premises (t376))
% 79.25/79.56  (step t378 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) false) :rule resolution :premises (t369 t377))
% 79.25/79.56  (step t379 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (not false)) :rule implies_neg2)
% 79.25/79.56  (step t380 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false)) :rule resolution :premises (t378 t379))
% 79.25/79.56  (step t381 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false)) :rule contraction :premises (t380))
% 79.25/79.56  (step t382 (cl (= (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) :rule implies_simplify)
% 79.25/79.56  (step t383 (cl (not (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false)) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule equiv1 :premises (t382))
% 79.25/79.56  (step t384 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule resolution :premises (t381 t383))
% 79.25/79.56  (step t385 (cl (= (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false)) :rule resolution :premises (t368 t384))
% 79.25/79.56  (step t386 (cl (= (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false))) :rule cong :premises (t364 t385))
% 79.25/79.56  (step t387 (cl (= (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) false) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) :rule all_simplify)
% 79.25/79.56  (step t388 (cl (= (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))))) :rule trans :premises (t386 t387))
% 79.25/79.56  (step t389 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t390)
% 79.25/79.56  (assume t390.a0 (tptp.segmentP tptp.nil tptp.nil))
% 79.25/79.56  (assume t390.a1 (= tptp.nil tptp.sk4))
% 79.25/79.56  (assume t390.a2 (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))
% 79.25/79.56  (assume t390.a3 (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))
% 79.25/79.56  (step t390.t1 (cl (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (= tptp.nil tptp.sk4)) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule and_neg)
% 79.25/79.56  (step t390.t2 (cl (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule resolution :premises (t390.t1 t390.a0 t390.a2 t390.a1 t390.a3))
% 79.25/79.56  (step t390 (cl (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule subproof :discharge (t390.a0 t390.a1 t390.a2 t390.a3))
% 79.25/79.56  (step t391 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (tptp.segmentP tptp.nil tptp.nil)) :rule and_pos)
% 79.25/79.56  (step t392 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 79.25/79.56  (step t393 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule and_pos)
% 79.25/79.56  (step t394 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule and_pos)
% 79.25/79.56  (step t395 (cl (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule resolution :premises (t390 t391 t392 t393 t394))
% 79.25/79.56  (step t396 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule reordering :premises (t395))
% 79.25/79.56  (step t397 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule contraction :premises (t396))
% 79.25/79.56  (step t398 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule resolution :premises (t389 t397))
% 79.25/79.56  (step t399 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule implies_neg2)
% 79.25/79.56  (step t400 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule resolution :premises (t398 t399))
% 79.25/79.56  (step t401 (cl (=> (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (= tptp.nil tptp.sk4) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule contraction :premises (t400))
% 79.25/79.56  (step t402 (cl (not (and (tptp.segmentP tptp.nil tptp.nil) (= tptp.nil tptp.sk4) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule resolution :premises (t363 t388 t401))
% 79.25/79.56  (step t403 (cl (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) :rule not_and :premises (t402))
% 79.25/79.56  (step t404 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (not (tptp.segmentP tptp.nil tptp.nil)))) :rule or_neg)
% 79.25/79.56  (step t405 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 79.25/79.56  (step t406 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule or_neg)
% 79.25/79.56  (step t407 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (not (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule or_neg)
% 79.25/79.56  (step t408 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule resolution :premises (t403 t404 t405 t406 t407))
% 79.25/79.56  (step t409 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (not (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))))) :rule contraction :premises (t408))
% 79.25/79.56  (step t410 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule resolution :premises (t348 t362 t409))
% 79.25/79.56  (step t411 (cl (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) :rule or :premises (t410))
% 79.25/79.56  (step t412 (cl (not (tptp.segmentP tptp.nil tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4) (not (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule reordering :premises (t411))
% 79.25/79.56  (step t413 (cl (not (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) (not (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U)))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil))) :rule equiv_pos2)
% 79.25/79.56  (step t414 (cl (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule all_simplify)
% 79.25/79.56  (step t415 (cl (= (= tptp.nil tptp.nil) true)) :rule all_simplify)
% 79.25/79.56  (step t416 (cl (= (not (= tptp.nil tptp.nil)) (not true))) :rule cong :premises (t415))
% 79.25/79.56  (step t417 (cl (= (not true) false)) :rule all_simplify)
% 79.25/79.56  (step t418 (cl (= (not (= tptp.nil tptp.nil)) false)) :rule trans :premises (t416 t417))
% 79.25/79.56  (step t419 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 79.25/79.56  (step t420 (cl (= (tptp.segmentP tptp.nil tptp.nil) (tptp.segmentP tptp.nil tptp.nil))) :rule refl)
% 79.25/79.56  (step t421 (cl (= (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or false (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule cong :premises (t418 t419 t420))
% 79.25/79.56  (step t422 (cl (= (or false (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule all_simplify)
% 79.25/79.56  (step t423 (cl (= (or (not (= tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule trans :premises (t421 t422))
% 79.25/79.56  (step t424 (cl (= (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))) (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)))) :rule trans :premises (t414 t423))
% 79.25/79.56  (step t425 (cl (or (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil))) :rule resolution :premises (t413 t424 a78))
% 79.25/79.56  (step t426 (cl (not (tptp.ssList tptp.nil)) (tptp.segmentP tptp.nil tptp.nil)) :rule or :premises (t425))
% 79.25/79.56  (step t427 (cl (tptp.segmentP tptp.nil tptp.nil)) :rule resolution :premises (t426 a7))
% 79.25/79.56  (step t428 (cl (not (or (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)) :rule or_pos)
% 79.25/79.56  (step t429 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4) (not (or (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule reordering :premises (t428))
% 79.25/79.56  (step t430 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t431)
% 79.25/79.56  (assume t431.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 79.25/79.56  (step t431.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 79.25/79.56  (step t431.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule or :premises (t431.t1))
% 79.25/79.56  (step t431.t3 (cl (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t431.t2 t431.a0))
% 79.25/79.56  (step t431 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule subproof :discharge (t431.a0))
% 79.25/79.56  (step t432 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t430 t431))
% 79.25/79.56  (step t433 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule implies_neg2)
% 79.25/79.56  (step t434 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t432 t433))
% 79.25/79.56  (step t435 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil)))) :rule contraction :premises (t434))
% 79.25/79.56  (step t436 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V)))) (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule implies :premises (t435))
% 79.25/79.56  (step t437 (cl (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t436 a47))
% 79.25/79.56  (step t438 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule or_pos)
% 79.25/79.56  (step t439 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule reordering :premises (t438))
% 79.25/79.56  (step t440 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t441)
% 79.25/79.56  (assume t441.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 79.25/79.56  (step t441.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 79.25/79.56  (step t441.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule or :premises (t441.t1))
% 79.25/79.56  (step t441.t3 (cl (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t441.t2 t441.a0))
% 79.25/79.56  (step t441 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule subproof :discharge (t441.a0))
% 79.25/79.56  (step t442 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t440 t441))
% 79.25/79.56  (step t443 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule implies_neg2)
% 79.25/79.56  (step t444 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule resolution :premises (t442 t443))
% 79.25/79.56  (step t445 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil)))) :rule contraction :premises (t444))
% 79.25/79.56  (step t446 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V)))) (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule implies :premises (t445))
% 79.25/79.56  (step t447 (cl (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) :rule resolution :premises (t446 a48))
% 79.25/79.56  (step t448 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) 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)
% 79.25/79.56  (anchor :step t449)
% 79.25/79.56  (assume t449.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 79.25/79.56  (step t449.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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= U tptp.nil) (:= V (tptp.skaf47 tptp.nil tptp.nil))))
% 79.25/79.56  (step t449.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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule or :premises (t449.t1))
% 79.25/79.56  (step t449.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t449.t2 t449.a0))
% 79.25/79.56  (step t449 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule subproof :discharge (t449.a0))
% 79.25/79.56  (step t450 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t448 t449))
% 79.25/79.56  (step t451 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule implies_neg2)
% 79.25/79.56  (step t452 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) 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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule resolution :premises (t450 t451))
% 79.25/79.56  (step t453 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))) :rule contraction :premises (t452))
% 79.25/79.56  (step t454 (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.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule implies :premises (t453))
% 79.25/79.56  (step t455 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.skaf47 tptp.nil tptp.nil))) (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)))) :rule resolution :premises (t454 a84))
% 79.25/79.56  (step t456 (cl (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) :rule resolution :premises (t439 a7 t447 t455))
% 79.25/79.56  (step t457 (cl (not (= (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))))) (not (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule equiv_pos2)
% 79.25/79.56  (step t458 (cl (= (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule refl)
% 79.25/79.56  (step t459 (cl (= (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule refl)
% 79.25/79.56  (step t460 (cl (= (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true) (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv_simplify)
% 79.25/79.56  (step t461 (cl (not (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule equiv1 :premises (t460))
% 79.25/79.56  (step t462 (cl (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))))) :rule all_simplify)
% 79.25/79.56  (step t463 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule refl)
% 79.25/79.56  (step t464 (cl (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule all_simplify)
% 79.25/79.56  (step t465 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule cong :premises (t463 t464))
% 79.25/79.56  (step t466 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) :rule all_simplify)
% 79.25/79.56  (step t467 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) true)) :rule trans :premises (t465 t466))
% 79.25/79.56  (step t468 (cl (= (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4)) true)) :rule trans :premises (t462 t467))
% 79.25/79.56  (step t469 (cl (= (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t461 t468))
% 79.25/79.56  (step t470 (cl (= (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule refl)
% 79.25/79.56  (step t471 (cl (= (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))))) :rule cong :premises (t458 t459 t469 t470))
% 79.25/79.56  (step t472 (cl (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule and_neg)
% 79.25/79.56  (step t473 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t474)
% 79.25/79.56  (assume t474.a0 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 79.25/79.56  (assume t474.a1 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 79.25/79.56  (assume t474.a2 (not (tptp.segmentP tptp.sk3 tptp.sk4)))
% 79.25/79.56  (step t474.t1 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t474.t2)
% 79.25/79.56  (assume t474.t2.a0 (not (tptp.segmentP tptp.sk3 tptp.sk4)))
% 79.25/79.56  (assume t474.t2.a1 (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)))
% 79.25/79.56  (assume t474.t2.a2 (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))
% 79.25/79.56  (step t474.t2.t1 (cl (= (= (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4) false) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule equiv_simplify)
% 79.25/79.56  (step t474.t2.t2 (cl (not (= (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4) false)) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule equiv1 :premises (t474.t2.t1))
% 79.25/79.56  (step t474.t2.t3 (cl (= (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.nil)) :rule symm :premises (t474.t2.a2))
% 79.25/79.56  (step t474.t2.t4 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 79.25/79.56  (step t474.t2.t5 (cl (= (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) (tptp.app tptp.nil tptp.sk3))) :rule cong :premises (t474.t2.t3 t474.t2.t4))
% 79.25/79.56  (step t474.t2.t6 (cl (= (tptp.app tptp.nil tptp.sk3) tptp.sk3)) :rule symm :premises (t474.t2.a1))
% 79.25/79.56  (step t474.t2.t7 (cl (= (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk3)) :rule trans :premises (t474.t2.t5 t474.t2.t6))
% 79.25/79.56  (step t474.t2.t8 (cl (= tptp.sk4 tptp.sk4)) :rule refl)
% 79.25/79.56  (step t474.t2.t9 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4) (tptp.segmentP tptp.sk3 tptp.sk4))) :rule cong :premises (t474.t2.t7 t474.t2.t8))
% 79.25/79.56  (step t474.t2.t10 (cl (= (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv_simplify)
% 79.25/79.56  (step t474.t2.t11 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule equiv2 :premises (t474.t2.t10))
% 79.25/79.56  (step t474.t2.t12 (cl (not (not (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule not_not)
% 79.25/79.56  (step t474.t2.t13 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false) (tptp.segmentP tptp.sk3 tptp.sk4)) :rule resolution :premises (t474.t2.t11 t474.t2.t12))
% 79.25/79.56  (step t474.t2.t14 (cl (= (tptp.segmentP tptp.sk3 tptp.sk4) false)) :rule resolution :premises (t474.t2.t13 t474.t2.a0))
% 79.25/79.56  (step t474.t2.t15 (cl (= (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4) false)) :rule trans :premises (t474.t2.t9 t474.t2.t14))
% 79.25/79.56  (step t474.t2.t16 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t474.t2.t2 t474.t2.t15))
% 79.25/79.56  (step t474.t2 (cl (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule subproof :discharge (t474.t2.a0 t474.t2.a1 t474.t2.a2))
% 79.25/79.56  (step t474.t3 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule and_pos)
% 79.25/79.56  (step t474.t4 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 79.25/79.56  (step t474.t5 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 79.25/79.56  (step t474.t6 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t474.t2 t474.t3 t474.t4 t474.t5))
% 79.25/79.56  (step t474.t7 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule reordering :premises (t474.t6))
% 79.25/79.56  (step t474.t8 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule contraction :premises (t474.t7))
% 79.25/79.56  (step t474.t9 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t474.t1 t474.t8))
% 79.25/79.56  (step t474.t10 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule implies_neg2)
% 79.25/79.56  (step t474.t11 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule resolution :premises (t474.t9 t474.t10))
% 79.25/79.56  (step t474.t12 (cl (=> (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule contraction :premises (t474.t11))
% 79.25/79.56  (step t474.t13 (cl (not (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule implies :premises (t474.t12))
% 79.25/79.56  (step t474.t14 (cl (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule and_neg)
% 79.25/79.56  (step t474.t15 (cl (and (not (tptp.segmentP tptp.sk3 tptp.sk4)) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t474.t14 t474.a2 t474.a0 t474.a1))
% 79.25/79.56  (step t474.t16 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t474.t13 t474.t15))
% 79.25/79.56  (step t474 (cl (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule subproof :discharge (t474.a0 t474.a1 t474.a2))
% 79.25/79.56  (step t475 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) :rule and_pos)
% 79.25/79.56  (step t476 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule and_pos)
% 79.25/79.56  (step t477 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule and_pos)
% 79.25/79.56  (step t478 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t474 t475 t476 t477))
% 79.25/79.56  (step t479 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule reordering :premises (t478))
% 79.25/79.56  (step t480 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule contraction :premises (t479))
% 79.25/79.56  (step t481 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t473 t480))
% 79.25/79.56  (step t482 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule implies_neg2)
% 79.25/79.56  (step t483 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule resolution :premises (t481 t482))
% 79.25/79.56  (step t484 (cl (=> (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule contraction :premises (t483))
% 79.25/79.56  (step t485 (cl (not (and (= tptp.sk3 (tptp.app tptp.nil tptp.sk3)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule implies :premises (t484))
% 79.25/79.56  (step t486 (cl (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t472 t485))
% 79.25/79.56  (step t487 (cl (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))))) :rule or_neg)
% 79.25/79.56  (step t488 (cl (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule or_neg)
% 79.25/79.56  (step t489 (cl (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (not (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule or_neg)
% 79.25/79.56  (step t490 (cl (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule or_neg)
% 79.25/79.56  (step t491 (cl (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule resolution :premises (t486 t487 t488 t489 t490))
% 79.25/79.56  (step t492 (cl (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (not (tptp.segmentP tptp.sk3 tptp.sk4))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule contraction :premises (t491))
% 79.25/79.56  (step t493 (cl (or (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule resolution :premises (t457 t471 t492))
% 79.25/79.56  (step t494 (cl (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (tptp.segmentP tptp.sk3 tptp.sk4) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule or :premises (t493))
% 79.25/79.56  (step t495 (cl (tptp.segmentP tptp.sk3 tptp.sk4) (not (= tptp.sk3 (tptp.app tptp.nil tptp.sk3))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule reordering :premises (t494))
% 79.25/79.56  (step t496 (cl (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule or_pos)
% 79.25/79.56  (step t497 (cl (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule reordering :premises (t496))
% 79.25/79.56  (step t498 (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)
% 79.25/79.56  (step t499 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 79.25/79.56  (step t500 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t499 a190 a189))
% 79.25/79.56  (step t501 (cl (= tptp.sk2 tptp.sk4)) :rule and :premises (t500))
% 79.25/79.56  (step t502 (cl (= tptp.nil tptp.nil)) :rule refl)
% 79.25/79.56  (step t503 (cl (= (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t501 t502))
% 79.25/79.56  (step t504 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t498 t503 a191))
% 79.25/79.56  (step t505 (cl (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)) :rule or_pos)
% 79.25/79.56  (step t506 (cl (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule reordering :premises (t505))
% 79.25/79.56  (step t507 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t508)
% 79.25/79.56  (assume t508.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 79.25/79.56  (step t508.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 79.25/79.56  (step t508.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule or :premises (t508.t1))
% 79.25/79.56  (step t508.t3 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t508.t2 t508.a0))
% 79.25/79.56  (step t508 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule subproof :discharge (t508.a0))
% 79.25/79.56  (step t509 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t507 t508))
% 79.25/79.56  (step t510 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (not (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule implies_neg2)
% 79.25/79.56  (step t511 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule resolution :premises (t509 t510))
% 79.25/79.56  (step t512 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4)))) :rule contraction :premises (t511))
% 79.25/79.56  (step t513 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule implies :premises (t512))
% 79.25/79.56  (step t514 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.segmentP tptp.sk4 tptp.sk4))) :rule resolution :premises (t513 a56))
% 79.25/79.56  (step t515 (cl (tptp.segmentP tptp.sk4 tptp.sk4)) :rule resolution :premises (t506 a188 t514))
% 79.25/79.56  (step t516 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t517)
% 79.25/79.56  (assume t517.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)))))
% 79.25/79.56  (step t517.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule forall_inst :args ((:= A tptp.sk4)))
% 79.25/79.56  (step t517.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule or :premises (t517.t1))
% 79.25/79.56  (step t517.t3 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t517.t2 t517.a0))
% 79.25/79.56  (step t517 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule subproof :discharge (t517.a0))
% 79.25/79.56  (step t518 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t516 t517))
% 79.25/79.56  (step t519 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule implies_neg2)
% 79.25/79.56  (step t520 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule resolution :premises (t518 t519))
% 79.25/79.56  (step t521 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A)))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4))))) :rule contraction :premises (t520))
% 79.25/79.56  (step t522 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk4 A)) (not (tptp.segmentP tptp.sk3 A))))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule implies :premises (t521))
% 79.25/79.56  (step t523 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.segmentP tptp.sk4 tptp.sk4)) (not (tptp.segmentP tptp.sk3 tptp.sk4)))) :rule resolution :premises (t522 t115))
% 79.25/79.56  (step t524 (cl (not (tptp.segmentP tptp.sk3 tptp.sk4))) :rule resolution :premises (t497 a188 t504 t515 t523))
% 79.25/79.56  (step t525 (cl (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule or_pos)
% 79.25/79.56  (step t526 (cl (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule contraction :premises (t525))
% 79.25/79.56  (step t527 (cl (not (tptp.ssList tptp.nil)) (not (tptp.segmentP tptp.nil tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))) (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule reordering :premises (t526))
% 79.25/79.56  (step t528 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule implies_neg1)
% 79.25/79.56  (anchor :step t529)
% 79.25/79.56  (assume t529.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))
% 79.25/79.56  (step t529.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule forall_inst :args ((:= U tptp.nil) (:= V tptp.nil)))
% 79.25/79.56  (step t529.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule or :premises (t529.t1))
% 79.25/79.56  (step t529.t3 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t529.t2 t529.a0))
% 79.25/79.56  (step t529 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule subproof :discharge (t529.a0))
% 79.25/79.56  (step t530 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t528 t529))
% 79.25/79.56  (step t531 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (not (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule implies_neg2)
% 79.25/79.56  (step t532 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule resolution :premises (t530 t531))
% 79.25/79.56  (step t533 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))))) :rule contraction :premises (t532))
% 79.25/79.56  (step t534 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies :premises (t533))
% 79.25/79.56  (step t535 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule equiv_pos2)
% 79.25/79.56  (anchor :step t536 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 79.25/79.56  (step t536.t1 (cl (= U U)) :rule refl)
% 79.25/79.56  (step t536.t2 (cl (= V V)) :rule refl)
% 79.25/79.56  (step t536.t3 (cl (= (not (tptp.segmentP U V)) (not (tptp.segmentP U V)))) :rule refl)
% 79.25/79.56  (step t536.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.56  (step t536.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.56  (step t536.t6 (cl (= (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))) :rule all_simplify)
% 79.25/79.56  (step t536.t7 (cl (= (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)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule cong :premises (t536.t3 t536.t4 t536.t5 t536.t6))
% 79.25/79.56  (step t536 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U))))))) :rule bind)
% 79.25/79.56  (step t537 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)))))) :rule resolution :premises (t535 t536 a167))
% 79.25/79.56  (step t538 (cl (or (not (tptp.segmentP tptp.nil tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t534 t537))
% 79.25/79.56  (step t539 (cl (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t527 a7 t427 t538))
% 79.25/79.56  (step t540 (cl (not (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t495 t524 t59 t539))
% 79.25/79.56  (step t541 (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (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)
% 79.25/79.57  (anchor :step t542)
% 79.25/79.57  (assume t542.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))))
% 79.25/79.57  (step t542.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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule forall_inst :args ((:= U (tptp.skaf48 tptp.nil tptp.nil)) (:= V tptp.sk4) (:= W tptp.sk3) (:= X (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))))
% 79.25/79.57  (step t542.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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule or :premises (t542.t1))
% 79.25/79.57  (step t542.t3 (cl (or (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t542.t2 t542.a0))
% 79.25/79.57  (step t542 (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule subproof :discharge (t542.a0))
% 79.25/79.57  (step t543 (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (or (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t541 t542))
% 79.25/79.57  (step t544 (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (not (or (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule implies_neg2)
% 79.25/79.57  (step t545 (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) (=> (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule resolution :premises (t543 t544))
% 79.25/79.57  (step t546 (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4)))) :rule contraction :premises (t545))
% 79.25/79.57  (step t547 (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.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule implies :premises (t546))
% 79.25/79.57  (step t548 (cl (or (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4)) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (tptp.segmentP (tptp.app (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)) tptp.sk3) tptp.sk4))) :rule resolution :premises (t547 a171))
% 79.25/79.57  (step t549 (cl (not (tptp.segmentP (tptp.skaf48 tptp.nil tptp.nil) tptp.sk4))) :rule resolution :premises (t429 a187 a188 t437 t456 t540 t548))
% 79.25/79.57  (step t550 (cl (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule or_pos)
% 79.25/79.57  (step t551 (cl (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule reordering :premises (t550))
% 79.25/79.57  (step t552 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule implies_neg1)
% 79.25/79.57  (anchor :step t553)
% 79.25/79.57  (assume t553.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 79.25/79.57  (step t553.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule forall_inst :args ((:= U (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil)) (:= V (tptp.skaf48 tptp.nil tptp.nil))))
% 79.25/79.57  (step t553.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule or :premises (t553.t1))
% 79.25/79.57  (step t553.t3 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t553.t2 t553.a0))
% 79.25/79.57  (step t553 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule subproof :discharge (t553.a0))
% 79.25/79.57  (step t554 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t552 t553))
% 79.25/79.57  (step t555 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (not (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule implies_neg2)
% 79.25/79.57  (step t556 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule resolution :premises (t554 t555))
% 79.25/79.57  (step t557 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))))) :rule contraction :premises (t556))
% 79.25/79.57  (step t558 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule implies :premises (t557))
% 79.25/79.57  (step t559 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule equiv_pos2)
% 79.25/79.57  (anchor :step t560 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 79.25/79.57  (step t560.t1 (cl (= U U)) :rule refl)
% 79.25/79.57  (step t560.t2 (cl (= V V)) :rule refl)
% 79.25/79.57  (step t560.t3 (cl (= (= (tptp.app U V) tptp.nil) (= tptp.nil (tptp.app U V)))) :rule all_simplify)
% 79.25/79.57  (step t560.t4 (cl (= (not (= (tptp.app U V) tptp.nil)) (not (= tptp.nil (tptp.app U V))))) :rule cong :premises (t560.t3))
% 79.25/79.57  (step t560.t5 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 79.25/79.57  (step t560.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.57  (step t560.t7 (cl (= (= tptp.nil V) (= tptp.nil V))) :rule refl)
% 79.25/79.57  (step t560.t8 (cl (= (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule cong :premises (t560.t4 t560.t5 t560.t6 t560.t7))
% 79.25/79.57  (step t560 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))) :rule bind)
% 79.25/79.57  (step t561 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.app U V))) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V)))) :rule resolution :premises (t559 t560 a118))
% 79.25/79.57  (step t562 (cl (or (not (= tptp.nil (tptp.app (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil) (tptp.skaf48 tptp.nil tptp.nil)))) (not (tptp.ssList (tptp.skaf48 tptp.nil tptp.nil))) (not (tptp.ssList (tptp.app (tptp.skaf47 tptp.nil tptp.nil) tptp.nil))) (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil)))) :rule resolution :premises (t558 t561))
% 79.25/79.57  (step t563 (cl (= tptp.nil (tptp.skaf48 tptp.nil tptp.nil))) :rule resolution :premises (t551 t539 t437 t456 t562))
% 79.25/79.57  (step t564 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t412 t427 t549 t563))
% 79.25/79.57  (step t565 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) :rule implies_neg1)
% 79.25/79.57  (anchor :step t566)
% 79.25/79.57  (assume t566.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 79.25/79.57  (step t566.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.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 79.25/79.57  (step t566.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) :rule or :premises (t566.t1))
% 79.25/79.57  (step t566.t3 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t566.t2 t566.a0))
% 79.25/79.57  (step t566 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) :rule subproof :discharge (t566.a0))
% 79.25/79.57  (step t567 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t565 t566))
% 79.25/79.57  (step t568 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) (not (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 79.25/79.57  (step t569 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t567 t568))
% 79.25/79.57  (step t570 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4)))) :rule contraction :premises (t569))
% 79.25/79.57  (step t571 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) :rule implies :premises (t570))
% 79.25/79.57  (step t572 (cl (or (not (tptp.ssList tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)) (= tptp.nil tptp.sk4))) :rule resolution :premises (t571 a75))
% 79.25/79.57  (step t573 (cl (tptp.ssItem (tptp.hd tptp.sk4))) :rule resolution :premises (t347 a188 t564 t572))
% 79.25/79.57  (step t574 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) :rule implies_neg1)
% 79.25/79.57  (anchor :step t575)
% 79.25/79.57  (assume t575.a0 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 79.25/79.57  (step t575.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk4))))
% 79.25/79.57  (step t575.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule or :premises (t575.t1))
% 79.25/79.57  (step t575.t3 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t575.t2 t575.a0))
% 79.25/79.57  (step t575 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule subproof :discharge (t575.a0))
% 79.25/79.57  (step t576 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t574 t575))
% 79.25/79.57  (step t577 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule implies_neg2)
% 79.25/79.57  (step t578 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t576 t577))
% 79.25/79.57  (step t579 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule contraction :premises (t578))
% 79.25/79.57  (step t580 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies :premises (t579))
% 79.25/79.57  (step t581 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t580 a66))
% 79.25/79.57  (step t582 (cl (tptp.totalorderedP (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t345 t573 t581))
% 79.25/79.57  (step t583 (cl (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4)) :rule or_pos)
% 79.25/79.57  (step t584 (cl (not (tptp.ssList tptp.sk4)) (= tptp.nil tptp.sk4) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t583))
% 79.25/79.57  (step t585 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule implies_neg1)
% 79.25/79.57  (anchor :step t586)
% 79.25/79.57  (assume t586.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))
% 79.25/79.57  (step t586.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4)))) :rule forall_inst :args ((:= U tptp.sk4)))
% 79.25/79.57  (step t586.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) :rule or :premises (t586.t1))
% 79.25/79.57  (step t586.t3 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) :rule resolution :premises (t586.t2 t586.a0))
% 79.25/79.57  (step t586 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) :rule subproof :discharge (t586.a0))
% 79.25/79.57  (step t587 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) :rule resolution :premises (t585 t586))
% 79.25/79.57  (step t588 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) (not (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 79.25/79.57  (step t589 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t587 t588))
% 79.25/79.57  (step t590 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4)))) :rule contraction :premises (t589))
% 79.25/79.57  (step t591 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) :rule implies :premises (t590))
% 79.25/79.57  (step t592 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule equiv_pos2)
% 79.25/79.57  (anchor :step t593 :args ((U $$unsorted) (:= U U)))
% 79.25/79.57  (step t593.t1 (cl (= U U)) :rule refl)
% 79.25/79.57  (step t593.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 79.25/79.57  (step t593.t3 (cl (= (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))))) :rule all_simplify)
% 79.25/79.57  (step t593.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 79.25/79.57  (step t593.t5 (cl (= (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule cong :premises (t593.t2 t593.t3 t593.t4))
% 79.25/79.57  (step t593 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))) :rule bind)
% 79.25/79.57  (step t594 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule resolution :premises (t592 t593 a108))
% 79.25/79.57  (step t595 (cl (or (not (tptp.ssList tptp.sk4)) (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4))) (= tptp.nil tptp.sk4))) :rule resolution :premises (t591 t594))
% 79.25/79.57  (step t596 (cl (= tptp.sk4 (tptp.cons (tptp.skaf83 tptp.sk4) (tptp.skaf82 tptp.sk4)))) :rule resolution :premises (t584 a188 t564 t595))
% 79.25/79.57  (step t597 (cl) :rule resolution :premises (t343 t582 t596))
% 79.25/79.57  
% 79.25/79.58  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.BYXbkpOMzB/cvc5---1.0.5_11208.smt2
% 79.25/79.58  % cvc5---1.0.5 exiting
% 79.25/79.58  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------