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

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

% Result   : Unsatisfiable 1.88s 2.12s
% Output   : Proof 1.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.15  % Problem    : SWC366-1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/0.16  % Command    : do_cvc5 %s %d
% 0.15/0.37  % Computer : n027.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Sun May 26 14:46:24 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.36/0.56  %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.56  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.88/2.12  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.EF1zbhLTs9/cvc5---1.0.5_25248.smt2
% 1.88/2.12  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.EF1zbhLTs9/cvc5---1.0.5_25248.smt2
% 1.98/2.18  (assume a0 (tptp.equalelemsP tptp.nil))
% 1.98/2.18  (assume a1 (tptp.duplicatefreeP tptp.nil))
% 1.98/2.18  (assume a2 (tptp.strictorderedP tptp.nil))
% 1.98/2.18  (assume a3 (tptp.totalorderedP tptp.nil))
% 1.98/2.18  (assume a4 (tptp.strictorderP tptp.nil))
% 1.98/2.18  (assume a5 (tptp.totalorderP tptp.nil))
% 1.98/2.18  (assume a6 (tptp.cyclefreeP tptp.nil))
% 1.98/2.18  (assume a7 (tptp.ssList tptp.nil))
% 1.98/2.18  (assume a8 (tptp.ssItem tptp.skac3))
% 1.98/2.18  (assume a9 (tptp.ssItem tptp.skac2))
% 1.98/2.18  (assume a10 (not (tptp.singletonP tptp.nil)))
% 1.98/2.18  (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 1.98/2.18  (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 1.98/2.18  (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 1.98/2.18  (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 1.98/2.18  (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 1.98/2.18  (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 1.98/2.18  (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 1.98/2.18  (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 1.98/2.18  (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 1.98/2.18  (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 1.98/2.18  (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 1.98/2.18  (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 1.98/2.18  (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 1.98/2.18  (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 1.98/2.18  (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 1.98/2.18  (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 1.98/2.18  (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 1.98/2.18  (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 1.98/2.18  (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 1.98/2.18  (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 1.98/2.18  (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 1.98/2.18  (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 1.98/2.18  (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 1.98/2.18  (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 1.98/2.18  (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 1.98/2.18  (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 1.98/2.18  (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 1.98/2.18  (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 1.98/2.18  (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 1.98/2.18  (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 1.98/2.18  (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 1.98/2.18  (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 1.98/2.18  (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 1.98/2.18  (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 1.98/2.18  (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 1.98/2.18  (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 1.98/2.18  (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 1.98/2.18  (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 1.98/2.18  (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 1.98/2.18  (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 1.98/2.18  (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 1.98/2.18  (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 1.98/2.18  (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 1.98/2.18  (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 1.98/2.18  (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 1.98/2.18  (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 1.98/2.18  (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 1.98/2.18  (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 1.98/2.18  (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 1.98/2.18  (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 1.98/2.18  (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 1.98/2.18  (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 1.98/2.18  (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 1.98/2.18  (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 1.98/2.18  (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 1.98/2.18  (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 1.98/2.18  (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 1.98/2.18  (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 1.98/2.18  (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 1.98/2.18  (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 1.98/2.18  (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 1.98/2.18  (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 1.98/2.18  (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 1.98/2.18  (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.98/2.18  (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.98/2.18  (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.98/2.18  (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.98/2.18  (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 1.98/2.18  (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.98/2.18  (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 1.98/2.18  (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.98/2.18  (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 1.98/2.18  (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.98/2.18  (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 1.98/2.18  (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.98/2.18  (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 1.98/2.18  (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 1.98/2.18  (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 1.98/2.18  (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 1.98/2.18  (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 1.98/2.18  (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.98/2.18  (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.98/2.18  (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.98/2.18  (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.98/2.18  (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 1.98/2.18  (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 1.98/2.18  (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.98/2.18  (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.98/2.18  (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 1.98/2.18  (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 1.98/2.18  (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 1.98/2.18  (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 1.98/2.18  (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 1.98/2.18  (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 1.98/2.18  (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 1.98/2.18  (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 1.98/2.18  (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 1.98/2.18  (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 1.98/2.18  (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 1.98/2.18  (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.98/2.18  (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 1.98/2.18  (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 1.98/2.18  (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 1.98/2.18  (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 1.98/2.18  (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 1.98/2.18  (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.98/2.18  (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.98/2.18  (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 1.98/2.18  (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 1.98/2.18  (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 1.98/2.18  (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 1.98/2.18  (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 1.98/2.18  (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 1.98/2.18  (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 1.98/2.18  (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 1.98/2.18  (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.98/2.18  (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.98/2.18  (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 1.98/2.18  (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 1.98/2.18  (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 1.98/2.18  (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 1.98/2.18  (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 1.98/2.18  (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 1.98/2.18  (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 1.98/2.18  (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 1.98/2.18  (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 1.98/2.18  (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 1.98/2.18  (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 1.98/2.18  (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 1.98/2.18  (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 1.98/2.18  (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 1.98/2.18  (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 1.98/2.18  (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 1.98/2.18  (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 1.98/2.18  (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 1.98/2.18  (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 1.98/2.18  (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 1.98/2.18  (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 1.98/2.18  (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 1.98/2.18  (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 1.98/2.18  (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 1.98/2.18  (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 1.98/2.18  (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 1.98/2.18  (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 1.98/2.18  (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 1.98/2.18  (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 1.98/2.18  (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 1.98/2.18  (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 1.98/2.18  (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 1.98/2.18  (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 1.98/2.18  (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 1.98/2.18  (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 1.98/2.18  (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 1.98/2.18  (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 1.98/2.18  (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 1.98/2.18  (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 1.98/2.18  (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 1.98/2.18  (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 1.98/2.18  (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 1.98/2.18  (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 1.98/2.18  (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 1.98/2.18  (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 1.98/2.18  (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 1.98/2.18  (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 1.98/2.18  (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 1.98/2.18  (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 1.98/2.18  (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 1.98/2.18  (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 1.98/2.18  (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 1.98/2.18  (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 1.98/2.18  (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 1.98/2.18  (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 1.98/2.18  (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 1.98/2.18  (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 1.98/2.18  (assume a185 (tptp.ssList tptp.sk1))
% 1.98/2.18  (assume a186 (tptp.ssList tptp.sk2))
% 1.98/2.18  (assume a187 (tptp.ssList tptp.sk3))
% 1.98/2.18  (assume a188 (tptp.ssList tptp.sk4))
% 1.98/2.18  (assume a189 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume a190 (= tptp.sk1 tptp.sk3))
% 1.98/2.18  (assume a191 (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)))
% 1.98/2.18  (assume a192 (or (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.98/2.18  (assume a193 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= (tptp.app B tptp.sk3) A)) (not (tptp.ssItem C)) (not (= (tptp.cons C tptp.nil) B)) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.nil))))
% 1.98/2.18  (assume a194 (or (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (tptp.neq tptp.sk2 tptp.nil)))
% 1.98/2.18  (assume a195 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= (tptp.app B tptp.sk3) A)) (not (tptp.ssItem C)) (not (= (tptp.cons C tptp.nil) B)) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)))))
% 1.98/2.18  (assume a196 (or (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.98/2.18  (step t1 (cl (not (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))) :rule or_pos)
% 1.98/2.18  (step t2 (cl (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)) (not (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule reordering :premises (t1))
% 1.98/2.18  (step t3 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule equiv_pos2)
% 1.98/2.18  (step t4 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 1.98/2.18  (step t5 (cl (= (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk1 tptp.sk3)))) :rule refl)
% 1.98/2.18  (step t6 (cl (= (= (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1)) true) (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1)))) :rule equiv_simplify)
% 1.98/2.18  (step t7 (cl (not (= (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1)) true)) (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule equiv1 :premises (t6))
% 1.98/2.18  (step t8 (cl (= (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1)) (= (tptp.rearsegP tptp.sk2 tptp.sk1) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1)))))) :rule all_simplify)
% 1.98/2.18  (step t9 (cl (= (tptp.rearsegP tptp.sk2 tptp.sk1) (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule refl)
% 1.98/2.18  (step t10 (cl (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule all_simplify)
% 1.98/2.18  (step t11 (cl (= (= (tptp.rearsegP tptp.sk2 tptp.sk1) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1)))) (= (tptp.rearsegP tptp.sk2 tptp.sk1) (tptp.rearsegP tptp.sk2 tptp.sk1)))) :rule cong :premises (t9 t10))
% 1.98/2.18  (step t12 (cl (= (= (tptp.rearsegP tptp.sk2 tptp.sk1) (tptp.rearsegP tptp.sk2 tptp.sk1)) true)) :rule all_simplify)
% 1.98/2.18  (step t13 (cl (= (= (tptp.rearsegP tptp.sk2 tptp.sk1) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1)))) true)) :rule trans :premises (t11 t12))
% 1.98/2.18  (step t14 (cl (= (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1)) true)) :rule trans :premises (t8 t13))
% 1.98/2.18  (step t15 (cl (= (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule resolution :premises (t7 t14))
% 1.98/2.18  (step t16 (cl (= (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule refl)
% 1.98/2.18  (step t17 (cl (= (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule refl)
% 1.98/2.18  (step t18 (cl (= (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule refl)
% 1.98/2.18  (step t19 (cl (= (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule refl)
% 1.98/2.18  (step t20 (cl (= (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule refl)
% 1.98/2.18  (step t21 (cl (= (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule refl)
% 1.98/2.18  (step t22 (cl (= (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule refl)
% 1.98/2.18  (step t23 (cl (= (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule refl)
% 1.98/2.18  (step t24 (cl (= (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule refl)
% 1.98/2.18  (step t25 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))))) :rule cong :premises (t4 t5 t15 t16 t17 t18 t19 t20 t21 t22 t23 t24))
% 1.98/2.18  (step t26 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule and_neg)
% 1.98/2.18  (step t27 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t28)
% 1.98/2.18  (assume t28.a0 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t28.a1 (= tptp.sk1 tptp.sk3))
% 1.98/2.18  (assume t28.a2 (not (tptp.rearsegP tptp.sk2 tptp.sk1)))
% 1.98/2.18  (assume t28.a3 (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))
% 1.98/2.18  (assume t28.a4 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t28.a5 (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))
% 1.98/2.18  (assume t28.a6 (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))
% 1.98/2.18  (assume t28.a7 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t28.a8 (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))
% 1.98/2.18  (assume t28.a9 (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))
% 1.98/2.18  (assume t28.a10 (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))
% 1.98/2.18  (step t28.t1 (cl (=> (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t28.t2)
% 1.98/2.18  (assume t28.t2.a0 (not (tptp.rearsegP tptp.sk2 tptp.sk1)))
% 1.98/2.18  (assume t28.t2.a1 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t28.t2.a2 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t28.t2.a3 (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))
% 1.98/2.18  (assume t28.t2.a4 (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))
% 1.98/2.18  (assume t28.t2.a5 (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))
% 1.98/2.18  (assume t28.t2.a6 (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))
% 1.98/2.18  (assume t28.t2.a7 (= tptp.sk1 tptp.sk3))
% 1.98/2.18  (assume t28.t2.a8 (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))
% 1.98/2.18  (assume t28.t2.a9 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t28.t2.a10 (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))
% 1.98/2.18  (step t28.t2.t1 (cl (= (= (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)) false) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule equiv_simplify)
% 1.98/2.18  (step t28.t2.t2 (cl (not (= (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)) false)) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule equiv1 :premises (t28.t2.t1))
% 1.98/2.18  (step t28.t2.t3 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t28.t2.a2))
% 1.98/2.18  (step t28.t2.t4 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule symm :premises (t28.t2.a1))
% 1.98/2.18  (step t28.t2.t5 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule trans :premises (t28.t2.t3 t28.t2.t4))
% 1.98/2.18  (step t28.t2.t6 (cl (= (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (tptp.skaf82 tptp.sk2))) :rule symm :premises (t28.t2.a10))
% 1.98/2.18  (step t28.t2.t7 (cl (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule symm :premises (t28.t2.t6))
% 1.98/2.18  (step t28.t2.t8 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t28.t2.a9))
% 1.98/2.18  (step t28.t2.t9 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t28.t2.t8))
% 1.98/2.18  (step t28.t2.t10 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk4)) :rule trans :premises (t28.t2.t4 t28.t2.t9))
% 1.98/2.18  (step t28.t2.t11 (cl (= (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (tptp.tl tptp.sk4))) :rule cong :premises (t28.t2.t10))
% 1.98/2.18  (step t28.t2.t12 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) tptp.sk4)) :rule symm :premises (t28.t2.a8))
% 1.98/2.18  (step t28.t2.t13 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule symm :premises (t28.t2.t12))
% 1.98/2.18  (step t28.t2.t14 (cl (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule refl)
% 1.98/2.18  (step t28.t2.t15 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t28.t2.a7))
% 1.98/2.18  (step t28.t2.t16 (cl (= (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) :rule symm :premises (t28.t2.a6))
% 1.98/2.18  (step t28.t2.t17 (cl (= tptp.sk3 (tptp.skaf45 tptp.sk1 tptp.nil))) :rule trans :premises (t28.t2.t15 t28.t2.a3 t28.t2.t16))
% 1.98/2.18  (step t28.t2.t18 (cl (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule cong :premises (t28.t2.t14 t28.t2.t17))
% 1.98/2.18  (step t28.t2.t19 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule trans :premises (t28.t2.t13 t28.t2.t18))
% 1.98/2.18  (step t28.t2.t20 (cl (= (tptp.tl tptp.sk4) (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule cong :premises (t28.t2.t19))
% 1.98/2.18  (step t28.t2.t21 (cl (= (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)) (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule symm :premises (t28.t2.a5))
% 1.98/2.18  (step t28.t2.t22 (cl (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule symm :premises (t28.t2.t21))
% 1.98/2.18  (step t28.t2.t23 (cl (= (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) tptp.nil)) :rule symm :premises (t28.t2.a4))
% 1.98/2.18  (step t28.t2.t24 (cl (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) :rule refl)
% 1.98/2.18  (step t28.t2.t25 (cl (= (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule cong :premises (t28.t2.t23 t28.t2.t24))
% 1.98/2.18  (step t28.t2.t26 (cl (= (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)) tptp.sk1)) :rule symm :premises (t28.t2.a3))
% 1.98/2.18  (step t28.t2.t27 (cl (= (tptp.skaf82 tptp.sk2) tptp.sk1)) :rule trans :premises (t28.t2.t7 t28.t2.t11 t28.t2.t20 t28.t2.t22 t28.t2.t25 t28.t2.t26))
% 1.98/2.18  (step t28.t2.t28 (cl (= (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)) (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule cong :premises (t28.t2.t5 t28.t2.t27))
% 1.98/2.18  (step t28.t2.t29 (cl (= (= (tptp.rearsegP tptp.sk2 tptp.sk1) false) (not (tptp.rearsegP tptp.sk2 tptp.sk1)))) :rule equiv_simplify)
% 1.98/2.18  (step t28.t2.t30 (cl (= (tptp.rearsegP tptp.sk2 tptp.sk1) false) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1)))) :rule equiv2 :premises (t28.t2.t29))
% 1.98/2.18  (step t28.t2.t31 (cl (not (not (not (tptp.rearsegP tptp.sk2 tptp.sk1)))) (tptp.rearsegP tptp.sk2 tptp.sk1)) :rule not_not)
% 1.98/2.18  (step t28.t2.t32 (cl (= (tptp.rearsegP tptp.sk2 tptp.sk1) false) (tptp.rearsegP tptp.sk2 tptp.sk1)) :rule resolution :premises (t28.t2.t30 t28.t2.t31))
% 1.98/2.18  (step t28.t2.t33 (cl (= (tptp.rearsegP tptp.sk2 tptp.sk1) false)) :rule resolution :premises (t28.t2.t32 t28.t2.a0))
% 1.98/2.18  (step t28.t2.t34 (cl (= (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)) false)) :rule trans :premises (t28.t2.t28 t28.t2.t33))
% 1.98/2.18  (step t28.t2.t35 (cl (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t28.t2.t2 t28.t2.t34))
% 1.98/2.18  (step t28.t2 (cl (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 tptp.sk4)) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t28.t2.a0 t28.t2.a1 t28.t2.a2 t28.t2.a3 t28.t2.a4 t28.t2.a5 t28.t2.a6 t28.t2.a7 t28.t2.a8 t28.t2.a9 t28.t2.a10))
% 1.98/2.18  (step t28.t3 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule and_pos)
% 1.98/2.18  (step t28.t4 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t28.t5 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t28.t6 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t28.t7 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t28.t8 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t28.t9 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t28.t10 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.98/2.18  (step t28.t11 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule and_pos)
% 1.98/2.18  (step t28.t12 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t28.t13 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule and_pos)
% 1.98/2.18  (step t28.t14 (cl (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule resolution :premises (t28.t2 t28.t3 t28.t4 t28.t5 t28.t6 t28.t7 t28.t8 t28.t9 t28.t10 t28.t11 t28.t12 t28.t13))
% 1.98/2.18  (step t28.t15 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t28.t14))
% 1.98/2.18  (step t28.t16 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t28.t15))
% 1.98/2.18  (step t28.t17 (cl (=> (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t28.t1 t28.t16))
% 1.98/2.18  (step t28.t18 (cl (=> (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 1.98/2.18  (step t28.t19 (cl (=> (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (=> (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t28.t17 t28.t18))
% 1.98/2.18  (step t28.t20 (cl (=> (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t28.t19))
% 1.98/2.18  (step t28.t21 (cl (not (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t28.t20))
% 1.98/2.18  (step t28.t22 (cl (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 tptp.sk4)) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule and_neg)
% 1.98/2.18  (step t28.t23 (cl (and (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= tptp.sk1 tptp.sk3) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 tptp.sk4) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t28.t22 t28.a2 t28.a4 t28.a7 t28.a8 t28.a5 t28.a10 t28.a9 t28.a1 t28.a3 t28.a0 t28.a6))
% 1.98/2.18  (step t28.t24 (cl (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t28.t21 t28.t23))
% 1.98/2.18  (step t28 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t28.a0 t28.a1 t28.a2 t28.a3 t28.a4 t28.a5 t28.a6 t28.a7 t28.a8 t28.a9 t28.a10))
% 1.98/2.18  (step t29 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t30 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.98/2.18  (step t31 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule and_pos)
% 1.98/2.18  (step t32 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule and_pos)
% 1.98/2.18  (step t33 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t34 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t35 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule and_pos)
% 1.98/2.18  (step t36 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t37 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t38 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t39 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule and_pos)
% 1.98/2.18  (step t40 (cl (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule resolution :premises (t28 t29 t30 t31 t32 t33 t34 t35 t36 t37 t38 t39))
% 1.98/2.18  (step t41 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t40))
% 1.98/2.18  (step t42 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t41))
% 1.98/2.18  (step t43 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t27 t42))
% 1.98/2.18  (step t44 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 1.98/2.18  (step t45 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t43 t44))
% 1.98/2.18  (step t46 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t45))
% 1.98/2.18  (step t47 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk1 tptp.sk3) (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t46))
% 1.98/2.18  (step t48 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t26 t47))
% 1.98/2.18  (step t49 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 1.98/2.18  (step t50 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= tptp.sk1 tptp.sk3)))) :rule or_neg)
% 1.98/2.18  (step t51 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))))) :rule or_neg)
% 1.98/2.18  (step t52 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule or_neg)
% 1.98/2.18  (step t53 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule or_neg)
% 1.98/2.18  (step t54 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule or_neg)
% 1.98/2.18  (step t55 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule or_neg)
% 1.98/2.18  (step t56 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule or_neg)
% 1.98/2.18  (step t57 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule or_neg)
% 1.98/2.18  (step t58 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule or_neg)
% 1.98/2.18  (step t59 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule or_neg)
% 1.98/2.18  (step t60 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule or_neg)
% 1.98/2.18  (step t61 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t48 t49 t50 t51 t52 t53 t54 t55 t56 t57 t58 t59 t60))
% 1.98/2.18  (step t62 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (not (tptp.rearsegP tptp.sk2 tptp.sk1))) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t61))
% 1.98/2.18  (step t63 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t3 t25 t62))
% 1.98/2.18  (step t64 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (tptp.rearsegP tptp.sk2 tptp.sk1) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule or :premises (t63))
% 1.98/2.18  (step t65 (cl (tptp.rearsegP tptp.sk2 tptp.sk1) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t64))
% 1.98/2.18  (step t66 (cl (not (tptp.rearsegP tptp.sk2 tptp.sk1)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a196))
% 1.98/2.18  (step t67 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule reordering :premises (t66))
% 1.98/2.18  (step t68 (cl (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule and_neg)
% 1.98/2.18  (step t69 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t70)
% 1.98/2.18  (assume t70.a0 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t70.a1 (tptp.neq tptp.sk2 tptp.nil))
% 1.98/2.18  (step t70.t1 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t70.t2)
% 1.98/2.18  (assume t70.t2.a0 (tptp.neq tptp.sk2 tptp.nil))
% 1.98/2.18  (assume t70.t2.a1 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (step t70.t2.t1 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) true) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_simplify)
% 1.98/2.18  (step t70.t2.t2 (cl (not (= (tptp.neq tptp.sk4 tptp.nil) true)) (tptp.neq tptp.sk4 tptp.nil)) :rule equiv1 :premises (t70.t2.t1))
% 1.98/2.18  (step t70.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t70.t2.a1))
% 1.98/2.18  (step t70.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t70.t2.t3))
% 1.98/2.18  (step t70.t2.t5 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t70.t2.t4))
% 1.98/2.18  (step t70.t2.t6 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.98/2.18  (step t70.t2.t7 (cl (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) :rule cong :premises (t70.t2.t5 t70.t2.t6))
% 1.98/2.18  (step t70.t2.t8 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 1.98/2.18  (step t70.t2.t9 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t70.t2.t8))
% 1.98/2.18  (step t70.t2.t10 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t70.t2.t9 t70.t2.a0))
% 1.98/2.18  (step t70.t2.t11 (cl (= (tptp.neq tptp.sk4 tptp.nil) true)) :rule trans :premises (t70.t2.t7 t70.t2.t10))
% 1.98/2.18  (step t70.t2.t12 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t70.t2.t2 t70.t2.t11))
% 1.98/2.18  (step t70.t2 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t70.t2.a0 t70.t2.a1))
% 1.98/2.18  (step t70.t3 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 1.98/2.18  (step t70.t4 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t70.t5 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t70.t2 t70.t3 t70.t4))
% 1.98/2.18  (step t70.t6 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t70.t5))
% 1.98/2.18  (step t70.t7 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t70.t6))
% 1.98/2.18  (step t70.t8 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t70.t1 t70.t7))
% 1.98/2.18  (step t70.t9 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 1.98/2.18  (step t70.t10 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t70.t8 t70.t9))
% 1.98/2.18  (step t70.t11 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t70.t10))
% 1.98/2.18  (step t70.t12 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t70.t11))
% 1.98/2.18  (step t70.t13 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 1.98/2.18  (step t70.t14 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t70.t13 t70.a1 t70.a0))
% 1.98/2.18  (step t70.t15 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t70.t12 t70.t14))
% 1.98/2.18  (step t70 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t70.a0 t70.a1))
% 1.98/2.18  (step t71 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t72 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 1.98/2.18  (step t73 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t70 t71 t72))
% 1.98/2.18  (step t74 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t73))
% 1.98/2.18  (step t75 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t74))
% 1.98/2.18  (step t76 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t69 t75))
% 1.98/2.18  (step t77 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 1.98/2.18  (step t78 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t76 t77))
% 1.98/2.18  (step t79 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t78))
% 1.98/2.18  (step t80 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t79))
% 1.98/2.18  (step t81 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t68 t80))
% 1.98/2.18  (step t82 (cl (tptp.neq tptp.sk4 tptp.nil) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t81))
% 1.98/2.18  (step t83 (cl (not (= (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))) (not (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule equiv_pos2)
% 1.98/2.18  (step t84 (cl (= (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))) :rule all_simplify)
% 1.98/2.18  (step t85 (cl (tptp.neq tptp.sk2 tptp.nil)) :rule resolution :premises (t83 t84 a191))
% 1.98/2.18  (step t86 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t82 a189 t85))
% 1.98/2.18  (step t87 (cl (not (tptp.rearsegP tptp.sk2 tptp.sk1))) :rule resolution :premises (t67 t86))
% 1.98/2.18  (step t88 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= (tptp.app B tptp.sk3) A)) (not (tptp.ssItem C)) (not (= (tptp.cons C tptp.nil) B)) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= (tptp.app B tptp.sk3) A)) (not (tptp.ssItem C)) (not (= (tptp.cons C tptp.nil) B)) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil))))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))))) :rule equiv_pos2)
% 1.98/2.18  (anchor :step t89 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 1.98/2.18  (step t89.t1 (cl (= A A)) :rule refl)
% 1.98/2.18  (step t89.t2 (cl (= B B)) :rule refl)
% 1.98/2.18  (step t89.t3 (cl (= C C)) :rule refl)
% 1.98/2.18  (step t89.t4 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 1.98/2.18  (step t89.t5 (cl (= (= tptp.sk4 A) (= tptp.sk4 A))) :rule refl)
% 1.98/2.18  (step t89.t6 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 1.98/2.18  (step t89.t7 (cl (= (= (tptp.app B tptp.sk3) A) (= A (tptp.app B tptp.sk3)))) :rule all_simplify)
% 1.98/2.18  (step t89.t8 (cl (= (not (= (tptp.app B tptp.sk3) A)) (not (= A (tptp.app B tptp.sk3))))) :rule cong :premises (t89.t7))
% 1.98/2.18  (step t89.t9 (cl (= (not (tptp.ssItem C)) (not (tptp.ssItem C)))) :rule refl)
% 1.98/2.18  (step t89.t10 (cl (= (= (tptp.cons C tptp.nil) B) (= B (tptp.cons C tptp.nil)))) :rule all_simplify)
% 1.98/2.18  (step t89.t11 (cl (= (not (= (tptp.cons C tptp.nil) B)) (not (= B (tptp.cons C tptp.nil))))) :rule cong :premises (t89.t10))
% 1.98/2.18  (step t89.t12 (cl (= (not (= (tptp.hd tptp.sk4) C)) (not (= (tptp.hd tptp.sk4) C)))) :rule refl)
% 1.98/2.18  (step t89.t13 (cl (= (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.nil tptp.sk4)))) :rule refl)
% 1.98/2.18  (step t89.t14 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 1.98/2.18  (step t89.t15 (cl (= (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= (tptp.app B tptp.sk3) A)) (not (tptp.ssItem C)) (not (= (tptp.cons C tptp.nil) B)) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil))) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t89.t4 t89.t5 t89.t6 t89.t8 t89.t9 t89.t11 t89.t12 t89.t13 t89.t14))
% 1.98/2.18  (step t89 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= (tptp.app B tptp.sk3) A)) (not (tptp.ssItem C)) (not (= (tptp.cons C tptp.nil) B)) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)))))) :rule bind)
% 1.98/2.18  (step t90 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C))))))) :rule all_simplify)
% 1.98/2.18  (step t91 (cl (= (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.nil tptp.sk4)))) :rule refl)
% 1.98/2.18  (step t92 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 1.98/2.18  (step t93 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C)))) (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= (tptp.hd tptp.sk4) (tptp.hd tptp.sk4)))))) :rule all_simplify)
% 1.98/2.18  (step t94 (cl (= (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule refl)
% 1.98/2.18  (step t95 (cl (= (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule refl)
% 1.98/2.18  (step t96 (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)
% 1.98/2.18  (step t97 (cl (= (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) true)) :rule all_simplify)
% 1.98/2.18  (step t98 (cl (= (not (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not true))) :rule cong :premises (t97))
% 1.98/2.18  (step t99 (cl (= (not true) false)) :rule all_simplify)
% 1.98/2.18  (step t100 (cl (= (not (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) false)) :rule trans :premises (t98 t99))
% 1.98/2.18  (step t101 (cl (= (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssItem (tptp.hd tptp.sk4))))) :rule refl)
% 1.98/2.18  (step t102 (cl (= (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true)) :rule all_simplify)
% 1.98/2.18  (step t103 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not true))) :rule cong :premises (t102))
% 1.98/2.18  (step t104 (cl (= (not (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) false)) :rule trans :premises (t103 t99))
% 1.98/2.18  (step t105 (cl (= (= (tptp.hd tptp.sk4) (tptp.hd tptp.sk4)) true)) :rule all_simplify)
% 1.98/2.18  (step t106 (cl (= (not (= (tptp.hd tptp.sk4) (tptp.hd tptp.sk4))) (not true))) :rule cong :premises (t105))
% 1.98/2.18  (step t107 (cl (= (not (= (tptp.hd tptp.sk4) (tptp.hd tptp.sk4))) false)) :rule trans :premises (t106 t99))
% 1.98/2.18  (step t108 (cl (= (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= (tptp.hd tptp.sk4) (tptp.hd tptp.sk4)))) (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) false (not (tptp.ssItem (tptp.hd tptp.sk4))) false false))) :rule cong :premises (t94 t95 t96 t100 t101 t104 t107))
% 1.98/2.18  (step t109 (cl (= (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) false (not (tptp.ssItem (tptp.hd tptp.sk4))) false false) (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) :rule all_simplify)
% 1.98/2.18  (step t110 (cl (= (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3) (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (= (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= (tptp.hd tptp.sk4) (tptp.hd tptp.sk4)))) (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) :rule trans :premises (t108 t109))
% 1.98/2.18  (step t111 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C)))) (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) :rule trans :premises (t93 t110))
% 1.98/2.18  (step t112 (cl (= (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C))))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))))))) :rule cong :premises (t91 t92 t111))
% 1.98/2.18  (step t113 (cl (= (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (or (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) :rule all_simplify)
% 1.98/2.18  (step t114 (cl (= (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C))))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) :rule trans :premises (t112 t113))
% 1.98/2.18  (step t115 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= A (tptp.app B tptp.sk3))) (not (tptp.ssItem C)) (not (= B (tptp.cons C tptp.nil))) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) :rule trans :premises (t90 t114))
% 1.98/2.18  (step t116 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (= tptp.sk4 A) (not (tptp.ssList B)) (not (= (tptp.app B tptp.sk3) A)) (not (tptp.ssItem C)) (not (= (tptp.cons C tptp.nil) B)) (not (= (tptp.hd tptp.sk4) C)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))))) :rule trans :premises (t89 t115))
% 1.98/2.18  (step t117 (cl (or (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))))) :rule resolution :premises (t88 t116 a195))
% 1.98/2.18  (step t118 (cl (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))) :rule or :premises (t117))
% 1.98/2.18  (step t119 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.nil tptp.sk4)) (not (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4)))) :rule reordering :premises (t118))
% 1.98/2.18  (step t120 (cl (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))) (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)) :rule or_pos)
% 1.98/2.18  (step t121 (cl (tptp.neq tptp.nil tptp.sk4) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk4)) (= tptp.nil tptp.sk4) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)))) :rule reordering :premises (t120))
% 1.98/2.18  (step t122 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4)))) :rule equiv_pos2)
% 1.98/2.18  (step t123 (cl (= (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true) (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule equiv_simplify)
% 1.98/2.18  (step t124 (cl (not (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true)) (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule equiv1 :premises (t123))
% 1.98/2.18  (step t125 (cl (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))))) :rule all_simplify)
% 1.98/2.18  (step t126 (cl (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2))) :rule refl)
% 1.98/2.18  (step t127 (cl (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule all_simplify)
% 1.98/2.18  (step t128 (cl (= (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))) (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)))) :rule cong :premises (t126 t127))
% 1.98/2.18  (step t129 (cl (= (= (= tptp.nil tptp.sk2) (= tptp.nil tptp.sk2)) true)) :rule all_simplify)
% 1.98/2.18  (step t130 (cl (= (= (= tptp.nil tptp.sk2) (not (not (= tptp.nil tptp.sk2)))) true)) :rule trans :premises (t128 t129))
% 1.98/2.18  (step t131 (cl (= (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2)) true)) :rule trans :premises (t125 t130))
% 1.98/2.18  (step t132 (cl (= (not (not (= tptp.nil tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t124 t131))
% 1.98/2.18  (step t133 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 1.98/2.18  (step t134 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))))) :rule cong :premises (t4 t132 t133))
% 1.98/2.18  (step t135 (cl (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2)))) :rule and_neg)
% 1.98/2.18  (step t136 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t137)
% 1.98/2.18  (assume t137.a0 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t137.a1 (not (= tptp.nil tptp.sk2)))
% 1.98/2.18  (step t137.t1 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t137.t2)
% 1.98/2.18  (assume t137.t2.a0 (not (= tptp.nil tptp.sk2)))
% 1.98/2.18  (assume t137.t2.a1 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (step t137.t2.t1 (cl (= (= (= tptp.nil tptp.sk4) false) (not (= tptp.nil tptp.sk4)))) :rule equiv_simplify)
% 1.98/2.18  (step t137.t2.t2 (cl (not (= (= tptp.nil tptp.sk4) false)) (not (= tptp.nil tptp.sk4))) :rule equiv1 :premises (t137.t2.t1))
% 1.98/2.18  (step t137.t2.t3 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.98/2.18  (step t137.t2.t4 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t137.t2.a1))
% 1.98/2.18  (step t137.t2.t5 (cl (= (= tptp.nil tptp.sk4) (= tptp.nil tptp.sk2))) :rule cong :premises (t137.t2.t3 t137.t2.t4))
% 1.98/2.18  (step t137.t2.t6 (cl (= (= (= tptp.nil tptp.sk2) false) (not (= tptp.nil tptp.sk2)))) :rule equiv_simplify)
% 1.98/2.18  (step t137.t2.t7 (cl (= (= tptp.nil tptp.sk2) false) (not (not (= tptp.nil tptp.sk2)))) :rule equiv2 :premises (t137.t2.t6))
% 1.98/2.18  (step t137.t2.t8 (cl (not (not (not (= tptp.nil tptp.sk2)))) (= tptp.nil tptp.sk2)) :rule not_not)
% 1.98/2.18  (step t137.t2.t9 (cl (= (= tptp.nil tptp.sk2) false) (= tptp.nil tptp.sk2)) :rule resolution :premises (t137.t2.t7 t137.t2.t8))
% 1.98/2.18  (step t137.t2.t10 (cl (= (= tptp.nil tptp.sk2) false)) :rule resolution :premises (t137.t2.t9 t137.t2.a0))
% 1.98/2.18  (step t137.t2.t11 (cl (= (= tptp.nil tptp.sk4) false)) :rule trans :premises (t137.t2.t5 t137.t2.t10))
% 1.98/2.18  (step t137.t2.t12 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t137.t2.t2 t137.t2.t11))
% 1.98/2.18  (step t137.t2 (cl (not (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) :rule subproof :discharge (t137.t2.a0 t137.t2.a1))
% 1.98/2.18  (step t137.t3 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk2))) :rule and_pos)
% 1.98/2.18  (step t137.t4 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t137.t5 (cl (not (= tptp.nil tptp.sk4)) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t137.t2 t137.t3 t137.t4))
% 1.98/2.18  (step t137.t6 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t137.t5))
% 1.98/2.18  (step t137.t7 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t137.t6))
% 1.98/2.18  (step t137.t8 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t137.t1 t137.t7))
% 1.98/2.18  (step t137.t9 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 1.98/2.18  (step t137.t10 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4))) (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t137.t8 t137.t9))
% 1.98/2.18  (step t137.t11 (cl (=> (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t137.t10))
% 1.98/2.18  (step t137.t12 (cl (not (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule implies :premises (t137.t11))
% 1.98/2.18  (step t137.t13 (cl (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 1.98/2.18  (step t137.t14 (cl (and (not (= tptp.nil tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t137.t13 t137.a1 t137.a0))
% 1.98/2.18  (step t137.t15 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t137.t12 t137.t14))
% 1.98/2.18  (step t137 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) :rule subproof :discharge (t137.a0 t137.a1))
% 1.98/2.18  (step t138 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t139 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk2))) :rule and_pos)
% 1.98/2.18  (step t140 (cl (not (= tptp.nil tptp.sk4)) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))))) :rule resolution :premises (t137 t138 t139))
% 1.98/2.18  (step t141 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule reordering :premises (t140))
% 1.98/2.18  (step t142 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule contraction :premises (t141))
% 1.98/2.18  (step t143 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t136 t142))
% 1.98/2.18  (step t144 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule implies_neg2)
% 1.98/2.18  (step t145 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t143 t144))
% 1.98/2.18  (step t146 (cl (=> (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t145))
% 1.98/2.18  (step t147 (cl (not (and (= tptp.sk2 tptp.sk4) (not (= tptp.nil tptp.sk2)))) (not (= tptp.nil tptp.sk4))) :rule implies :premises (t146))
% 1.98/2.18  (step t148 (cl (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t135 t147))
% 1.98/2.18  (step t149 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 1.98/2.18  (step t150 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (not (= tptp.nil tptp.sk2))))) :rule or_neg)
% 1.98/2.18  (step t151 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 1.98/2.18  (step t152 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4))) (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t148 t149 t150 t151))
% 1.98/2.18  (step t153 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (not (= tptp.nil tptp.sk2))) (not (= tptp.nil tptp.sk4)))) :rule contraction :premises (t152))
% 1.98/2.18  (step t154 (cl (or (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4)))) :rule resolution :premises (t122 t134 t153))
% 1.98/2.18  (step t155 (cl (not (= tptp.sk2 tptp.sk4)) (= tptp.nil tptp.sk2) (not (= tptp.nil tptp.sk4))) :rule or :premises (t154))
% 1.98/2.18  (step t156 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (tptp.neq tptp.sk2 tptp.sk2)))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (tptp.neq tptp.sk2 tptp.sk2))) :rule equiv_pos2)
% 1.98/2.18  (step t157 (cl (= (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule refl)
% 1.98/2.18  (step t158 (cl (= (not (= tptp.nil tptp.sk2)) (not (= tptp.nil tptp.sk2)))) :rule refl)
% 1.98/2.18  (step t159 (cl (= (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true) (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv_simplify)
% 1.98/2.18  (step t160 (cl (not (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true)) (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule equiv1 :premises (t159))
% 1.98/2.18  (step t161 (cl (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule all_simplify)
% 1.98/2.18  (step t162 (cl (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2))) :rule refl)
% 1.98/2.18  (step t163 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule all_simplify)
% 1.98/2.18  (step t164 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2)))) :rule cong :premises (t162 t163))
% 1.98/2.18  (step t165 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule all_simplify)
% 1.98/2.18  (step t166 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) true)) :rule trans :premises (t164 t165))
% 1.98/2.18  (step t167 (cl (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule trans :premises (t161 t166))
% 1.98/2.18  (step t168 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t160 t167))
% 1.98/2.18  (step t169 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (tptp.neq tptp.sk2 tptp.sk2)))) :rule cong :premises (t4 t157 t158 t168))
% 1.98/2.18  (step t170 (cl (not (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))))) (not (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule equiv_pos2)
% 1.98/2.18  (step t171 (cl (= (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule refl)
% 1.98/2.18  (step t172 (cl (= (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule equiv_simplify)
% 1.98/2.18  (step t173 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule equiv2 :premises (t172))
% 1.98/2.18  (step t174 (cl (not (not (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule not_not)
% 1.98/2.18  (step t175 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t173 t174))
% 1.98/2.18  (step t176 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t177)
% 1.98/2.18  (assume t177.a0 (tptp.neq tptp.sk2 tptp.nil))
% 1.98/2.18  (assume t177.a1 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t177.a2 (= tptp.nil tptp.sk2))
% 1.98/2.18  (assume t177.a3 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 1.98/2.18  (step t177.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 1.98/2.18  (step t177.t2 (cl (= (= false true) false)) :rule all_simplify)
% 1.98/2.18  (step t177.t3 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv_simplify)
% 1.98/2.18  (step t177.t4 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv2 :premises (t177.t3))
% 1.98/2.18  (step t177.t5 (cl (not (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.sk2)) :rule not_not)
% 1.98/2.18  (step t177.t6 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (tptp.neq tptp.sk2 tptp.sk2)) :rule resolution :premises (t177.t4 t177.t5))
% 1.98/2.18  (step t177.t7 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false)) :rule resolution :premises (t177.t6 t177.a3))
% 1.98/2.18  (step t177.t8 (cl (= false (tptp.neq tptp.sk2 tptp.sk2))) :rule symm :premises (t177.t7))
% 1.98/2.18  (step t177.t9 (cl (= tptp.sk2 tptp.nil)) :rule symm :premises (t177.a2))
% 1.98/2.18  (step t177.t10 (cl (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk4 tptp.nil))) :rule cong :premises (t177.a1 t177.t9))
% 1.98/2.18  (step t177.t11 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t177.a1))
% 1.98/2.18  (step t177.t12 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.98/2.18  (step t177.t13 (cl (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) :rule cong :premises (t177.t11 t177.t12))
% 1.98/2.18  (step t177.t14 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 1.98/2.18  (step t177.t15 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t177.t14))
% 1.98/2.18  (step t177.t16 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t177.t15 t177.a0))
% 1.98/2.18  (step t177.t17 (cl (= false true)) :rule trans :premises (t177.t8 t177.t10 t177.t13 t177.t16))
% 1.98/2.18  (step t177.t18 (cl false) :rule resolution :premises (t177.t1 t177.t2 t177.t17))
% 1.98/2.18  (step t177 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) false) :rule subproof :discharge (t177.a0 t177.a1 t177.a2 t177.a3))
% 1.98/2.18  (step t178 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 1.98/2.18  (step t179 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t180 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 1.98/2.18  (step t181 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 1.98/2.18  (step t182 (cl false (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t177 t178 t179 t180 t181))
% 1.98/2.18  (step t183 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) false) :rule reordering :premises (t182))
% 1.98/2.18  (step t184 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) false) :rule contraction :premises (t183))
% 1.98/2.18  (step t185 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) false) :rule resolution :premises (t176 t184))
% 1.98/2.18  (step t186 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not false)) :rule implies_neg2)
% 1.98/2.18  (step t187 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule resolution :premises (t185 t186))
% 1.98/2.18  (step t188 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule contraction :premises (t187))
% 1.98/2.18  (step t189 (cl (= (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule implies_simplify)
% 1.98/2.18  (step t190 (cl (not (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule equiv1 :premises (t189))
% 1.98/2.18  (step t191 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t188 t190))
% 1.98/2.18  (step t192 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule resolution :premises (t175 t191))
% 1.98/2.18  (step t193 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false))) :rule cong :premises (t171 t192))
% 1.98/2.18  (step t194 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule all_simplify)
% 1.98/2.18  (step t195 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule trans :premises (t193 t194))
% 1.98/2.18  (step t196 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t197)
% 1.98/2.18  (assume t197.a0 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t197.a1 (tptp.neq tptp.sk2 tptp.nil))
% 1.98/2.18  (assume t197.a2 (= tptp.nil tptp.sk2))
% 1.98/2.18  (assume t197.a3 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 1.98/2.18  (step t197.t1 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule and_neg)
% 1.98/2.18  (step t197.t2 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t197.t1 t197.a1 t197.a0 t197.a2 t197.a3))
% 1.98/2.18  (step t197 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule subproof :discharge (t197.a0 t197.a1 t197.a2 t197.a3))
% 1.98/2.18  (step t198 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t199 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 1.98/2.18  (step t200 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.nil tptp.sk2)) :rule and_pos)
% 1.98/2.18  (step t201 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 1.98/2.18  (step t202 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t197 t198 t199 t200 t201))
% 1.98/2.18  (step t203 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule reordering :premises (t202))
% 1.98/2.18  (step t204 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule contraction :premises (t203))
% 1.98/2.18  (step t205 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t196 t204))
% 1.98/2.18  (step t206 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule implies_neg2)
% 1.98/2.18  (step t207 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t205 t206))
% 1.98/2.18  (step t208 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule contraction :premises (t207))
% 1.98/2.18  (step t209 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk2) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t170 t195 t208))
% 1.98/2.18  (step t210 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule not_and :premises (t209))
% 1.98/2.18  (step t211 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 1.98/2.18  (step t212 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule or_neg)
% 1.98/2.18  (step t213 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (= tptp.nil tptp.sk2)))) :rule or_neg)
% 1.98/2.18  (step t214 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule or_neg)
% 1.98/2.18  (step t215 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t210 t211 t212 t213 t214))
% 1.98/2.18  (step t216 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule contraction :premises (t215))
% 1.98/2.18  (step t217 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t156 t169 t216))
% 1.98/2.18  (step t218 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk2)) (tptp.neq tptp.sk2 tptp.sk2)) :rule or :premises (t217))
% 1.98/2.18  (step t219 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.sk2) (not (= tptp.nil tptp.sk2))) :rule reordering :premises (t218))
% 1.98/2.18  (step t220 (cl (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))) :rule or_pos)
% 1.98/2.18  (step t221 (cl (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.sk2)) (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule reordering :premises (t220))
% 1.98/2.18  (step t222 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t223)
% 1.98/2.18  (assume t223.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 1.98/2.18  (step t223.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule forall_inst :args ((:= V tptp.sk2)))
% 1.98/2.18  (step t223.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule or :premises (t223.t1))
% 1.98/2.18  (step t223.t3 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t223.t2 t223.a0))
% 1.98/2.18  (step t223 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule subproof :discharge (t223.a0))
% 1.98/2.18  (step t224 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t222 t223))
% 1.98/2.18  (step t225 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule implies_neg2)
% 1.98/2.18  (step t226 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule resolution :premises (t224 t225))
% 1.98/2.18  (step t227 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule contraction :premises (t226))
% 1.98/2.18  (step t228 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule implies :premises (t227))
% 1.98/2.18  (step t229 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U))))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 1.98/2.18  (step t230 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))))) :rule all_simplify)
% 1.98/2.18  (anchor :step t231 :args ((V $$unsorted) (:= V V)))
% 1.98/2.18  (step t231.t1 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t231.t2 (cl (= (= V V) true)) :rule all_simplify)
% 1.98/2.18  (step t231.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t231.t2))
% 1.98/2.18  (step t231.t4 (cl (= (not (= V V)) false)) :rule trans :premises (t231.t3 t99))
% 1.98/2.18  (step t231.t5 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 1.98/2.18  (step t231.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t231.t7 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))))) :rule cong :premises (t231.t4 t231.t5 t231.t6 t231.t6))
% 1.98/2.18  (step t231.t8 (cl (= (or false (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule all_simplify)
% 1.98/2.18  (step t231.t9 (cl (= (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V))) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule trans :premises (t231.t7 t231.t8))
% 1.98/2.18  (step t231 (cl (= (forall ((V $$unsorted)) (or (not (= V V)) (not (tptp.neq V V)) (not (tptp.ssList V)) (not (tptp.ssList V)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule bind)
% 1.98/2.18  (step t232 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))) :rule trans :premises (t230 t231))
% 1.98/2.18  (step t233 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t229 t232 a114))
% 1.98/2.18  (step t234 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t228 t233))
% 1.98/2.18  (step t235 (cl (not (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t221 a186 t234))
% 1.98/2.18  (step t236 (cl (not (= tptp.nil tptp.sk2))) :rule resolution :premises (t219 t235 t85 a189))
% 1.98/2.18  (step t237 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t155 a189 t236))
% 1.98/2.18  (step t238 (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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))))) (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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)))) :rule equiv_pos2)
% 1.98/2.18  (step t239 (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)
% 1.98/2.18  (step t240 (cl (= (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.sk4)))) :rule refl)
% 1.98/2.18  (step t241 (cl (= (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.nil)))) :rule refl)
% 1.98/2.18  (step t242 (cl (= (tptp.neq tptp.nil tptp.sk4) (tptp.neq tptp.nil tptp.sk4))) :rule refl)
% 1.98/2.18  (step t243 (cl (= (= tptp.sk4 tptp.nil) (= tptp.nil tptp.sk4))) :rule all_simplify)
% 1.98/2.18  (step t244 (cl (= (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil)) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)))) :rule cong :premises (t240 t241 t242 t243))
% 1.98/2.18  (step t245 (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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))))) :rule cong :premises (t239 t244))
% 1.98/2.18  (step t246 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t247)
% 1.98/2.18  (assume t247.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 1.98/2.18  (step t247.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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk4) (:= V tptp.nil)))
% 1.98/2.18  (step t247.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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) :rule or :premises (t247.t1))
% 1.98/2.18  (step t247.t3 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) :rule resolution :premises (t247.t2 t247.a0))
% 1.98/2.18  (step t247 (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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) :rule subproof :discharge (t247.a0))
% 1.98/2.18  (step t248 (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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) :rule resolution :premises (t246 t247))
% 1.98/2.18  (step t249 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) (not (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil)))) :rule implies_neg2)
% 1.98/2.18  (step t250 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil)))) :rule resolution :premises (t248 t249))
% 1.98/2.18  (step t251 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.sk4 tptp.nil)))) :rule contraction :premises (t250))
% 1.98/2.18  (step t252 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4)))) :rule resolution :premises (t238 t245 t251))
% 1.98/2.18  (step t253 (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.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))) :rule implies :premises (t252))
% 1.98/2.18  (step t254 (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)
% 1.98/2.18  (anchor :step t255 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.98/2.18  (step t255.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t255.t2 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t255.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.98/2.18  (step t255.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t255.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 1.98/2.18  (step t255.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 1.98/2.18  (step t255.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 (t255.t3 t255.t4 t255.t5 t255.t6))
% 1.98/2.18  (step t255 (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)
% 1.98/2.18  (step t256 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t254 t255 a99))
% 1.98/2.18  (step t257 (cl (or (not (tptp.ssList tptp.sk4)) (not (tptp.ssList tptp.nil)) (tptp.neq tptp.nil tptp.sk4) (= tptp.nil tptp.sk4))) :rule resolution :premises (t253 t256))
% 1.98/2.18  (step t258 (cl (tptp.neq tptp.nil tptp.sk4)) :rule resolution :premises (t121 a7 a188 t237 t257))
% 1.98/2.18  (step t259 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule or_pos)
% 1.98/2.18  (step t260 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssList tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule reordering :premises (t259))
% 1.98/2.18  (step t261 (cl (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule or_pos)
% 1.98/2.18  (step t262 (cl (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule reordering :premises (t261))
% 1.98/2.18  (step t263 (cl (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem (tptp.hd tptp.sk2)))) :rule and_neg)
% 1.98/2.18  (step t264 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4))) (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t265)
% 1.98/2.18  (assume t265.a0 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t265.a1 (tptp.ssItem (tptp.hd tptp.sk2)))
% 1.98/2.18  (step t265.t1 (cl (=> (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4))) (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t265.t2)
% 1.98/2.18  (assume t265.t2.a0 (tptp.ssItem (tptp.hd tptp.sk2)))
% 1.98/2.18  (assume t265.t2.a1 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (step t265.t2.t1 (cl (= (= (tptp.ssItem (tptp.hd tptp.sk4)) true) (tptp.ssItem (tptp.hd tptp.sk4)))) :rule equiv_simplify)
% 1.98/2.18  (step t265.t2.t2 (cl (not (= (tptp.ssItem (tptp.hd tptp.sk4)) true)) (tptp.ssItem (tptp.hd tptp.sk4))) :rule equiv1 :premises (t265.t2.t1))
% 1.98/2.18  (step t265.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t265.t2.a1))
% 1.98/2.18  (step t265.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t265.t2.t3))
% 1.98/2.18  (step t265.t2.t5 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t265.t2.t4))
% 1.98/2.18  (step t265.t2.t6 (cl (= (tptp.hd tptp.sk4) (tptp.hd tptp.sk2))) :rule cong :premises (t265.t2.t5))
% 1.98/2.18  (step t265.t2.t7 (cl (= (tptp.ssItem (tptp.hd tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule cong :premises (t265.t2.t6))
% 1.98/2.18  (step t265.t2.t8 (cl (= (= (tptp.ssItem (tptp.hd tptp.sk2)) true) (tptp.ssItem (tptp.hd tptp.sk2)))) :rule equiv_simplify)
% 1.98/2.18  (step t265.t2.t9 (cl (= (tptp.ssItem (tptp.hd tptp.sk2)) true) (not (tptp.ssItem (tptp.hd tptp.sk2)))) :rule equiv2 :premises (t265.t2.t8))
% 1.98/2.18  (step t265.t2.t10 (cl (= (tptp.ssItem (tptp.hd tptp.sk2)) true)) :rule resolution :premises (t265.t2.t9 t265.t2.a0))
% 1.98/2.18  (step t265.t2.t11 (cl (= (tptp.ssItem (tptp.hd tptp.sk4)) true)) :rule trans :premises (t265.t2.t7 t265.t2.t10))
% 1.98/2.18  (step t265.t2.t12 (cl (tptp.ssItem (tptp.hd tptp.sk4))) :rule resolution :premises (t265.t2.t2 t265.t2.t11))
% 1.98/2.18  (step t265.t2 (cl (not (tptp.ssItem (tptp.hd tptp.sk2))) (not (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4))) :rule subproof :discharge (t265.t2.a0 t265.t2.a1))
% 1.98/2.18  (step t265.t3 (cl (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule and_pos)
% 1.98/2.18  (step t265.t4 (cl (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t265.t5 (cl (tptp.ssItem (tptp.hd tptp.sk4)) (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t265.t2 t265.t3 t265.t4))
% 1.98/2.18  (step t265.t6 (cl (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule reordering :premises (t265.t5))
% 1.98/2.18  (step t265.t7 (cl (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule contraction :premises (t265.t6))
% 1.98/2.18  (step t265.t8 (cl (=> (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule resolution :premises (t265.t1 t265.t7))
% 1.98/2.18  (step t265.t9 (cl (=> (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssItem (tptp.hd tptp.sk4)))) :rule implies_neg2)
% 1.98/2.18  (step t265.t10 (cl (=> (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4))) (=> (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)))) :rule resolution :premises (t265.t8 t265.t9))
% 1.98/2.18  (step t265.t11 (cl (=> (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)) (tptp.ssItem (tptp.hd tptp.sk4)))) :rule contraction :premises (t265.t10))
% 1.98/2.18  (step t265.t12 (cl (not (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule implies :premises (t265.t11))
% 1.98/2.18  (step t265.t13 (cl (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem (tptp.hd tptp.sk2))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 1.98/2.18  (step t265.t14 (cl (and (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t265.t13 t265.a1 t265.a0))
% 1.98/2.18  (step t265.t15 (cl (tptp.ssItem (tptp.hd tptp.sk4))) :rule resolution :premises (t265.t12 t265.t14))
% 1.98/2.18  (step t265 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule subproof :discharge (t265.a0 t265.a1))
% 1.98/2.18  (step t266 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t267 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) (tptp.ssItem (tptp.hd tptp.sk2))) :rule and_pos)
% 1.98/2.18  (step t268 (cl (tptp.ssItem (tptp.hd tptp.sk4)) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))))) :rule resolution :premises (t265 t266 t267))
% 1.98/2.18  (step t269 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule reordering :premises (t268))
% 1.98/2.18  (step t270 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule contraction :premises (t269))
% 1.98/2.18  (step t271 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule resolution :premises (t264 t270))
% 1.98/2.18  (step t272 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssItem (tptp.hd tptp.sk4)))) :rule implies_neg2)
% 1.98/2.18  (step t273 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4)))) :rule resolution :premises (t271 t272))
% 1.98/2.18  (step t274 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4)))) :rule contraction :premises (t273))
% 1.98/2.18  (step t275 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssItem (tptp.hd tptp.sk2)))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule implies :premises (t274))
% 1.98/2.18  (step t276 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem (tptp.hd tptp.sk2))) (tptp.ssItem (tptp.hd tptp.sk4))) :rule resolution :premises (t263 t275))
% 1.98/2.18  (step t277 (cl (tptp.ssItem (tptp.hd tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssItem (tptp.hd tptp.sk2)))) :rule reordering :premises (t276))
% 1.98/2.18  (step t278 (cl (not (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2)) :rule or_pos)
% 1.98/2.18  (step t279 (cl (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2) (not (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2)))) :rule reordering :premises (t278))
% 1.98/2.18  (step t280 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t281)
% 1.98/2.18  (assume t281.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.98/2.18  (step t281.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.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 1.98/2.18  (step t281.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) :rule or :premises (t281.t1))
% 1.98/2.18  (step t281.t3 (cl (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) :rule resolution :premises (t281.t2 t281.a0))
% 1.98/2.18  (step t281 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) :rule subproof :discharge (t281.a0))
% 1.98/2.18  (step t282 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) :rule resolution :premises (t280 t281))
% 1.98/2.18  (step t283 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2)))) :rule implies_neg2)
% 1.98/2.18  (step t284 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t282 t283))
% 1.98/2.18  (step t285 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2)))) :rule contraction :premises (t284))
% 1.98/2.18  (step t286 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U)))) (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) :rule implies :premises (t285))
% 1.98/2.18  (step t287 (cl (or (not (tptp.ssList tptp.sk2)) (tptp.ssItem (tptp.hd tptp.sk2)) (= tptp.nil tptp.sk2))) :rule resolution :premises (t286 a75))
% 1.98/2.18  (step t288 (cl (tptp.ssItem (tptp.hd tptp.sk2))) :rule resolution :premises (t279 a186 t236 t287))
% 1.98/2.18  (step t289 (cl (tptp.ssItem (tptp.hd tptp.sk4))) :rule resolution :premises (t277 a189 t288))
% 1.98/2.18  (step t290 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd 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)
% 1.98/2.18  (anchor :step t291)
% 1.98/2.18  (assume t291.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.98/2.18  (step t291.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk4)) (:= V tptp.nil)))
% 1.98/2.18  (step t291.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule or :premises (t291.t1))
% 1.98/2.18  (step t291.t3 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t291.t2 t291.a0))
% 1.98/2.18  (step t291 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule subproof :discharge (t291.a0))
% 1.98/2.18  (step t292 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t290 t291))
% 1.98/2.18  (step t293 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule implies_neg2)
% 1.98/2.18  (step t294 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd 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.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t292 t293))
% 1.98/2.18  (step t295 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule contraction :premises (t294))
% 1.98/2.18  (step t296 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule implies :premises (t295))
% 1.98/2.18  (step t297 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t296 a85))
% 1.98/2.18  (step t298 (cl (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule resolution :premises (t262 a7 t289 t297))
% 1.98/2.18  (step t299 (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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (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.ssList (tptp.app V U))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t300)
% 1.98/2.18  (assume t300.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 1.98/2.18  (step t300.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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule forall_inst :args ((:= U tptp.sk3) (:= V (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))
% 1.98/2.18  (step t300.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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule or :premises (t300.t1))
% 1.98/2.18  (step t300.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule resolution :premises (t300.t2 t300.a0))
% 1.98/2.18  (step t300 (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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule subproof :discharge (t300.a0))
% 1.98/2.18  (step t301 (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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule resolution :premises (t299 t300))
% 1.98/2.18  (step t302 (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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule implies_neg2)
% 1.98/2.18  (step t303 (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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (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.ssList (tptp.app V U)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule resolution :premises (t301 t302))
% 1.98/2.18  (step t304 (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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))))) :rule contraction :premises (t303))
% 1.98/2.18  (step t305 (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.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule implies :premises (t304))
% 1.98/2.18  (step t306 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3)))) :rule resolution :premises (t305 a84))
% 1.98/2.18  (step t307 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule resolution :premises (t260 t298 a187 t306))
% 1.98/2.18  (step t308 (cl (= tptp.sk4 (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) tptp.sk3))) :rule resolution :premises (t119 t86 t258 t307 t298 t289))
% 1.98/2.18  (step t309 (cl (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)) :rule or_pos)
% 1.98/2.18  (step t310 (cl (not (tptp.ssList tptp.sk2)) (= tptp.nil tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule reordering :premises (t309))
% 1.98/2.18  (step t311 (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t312)
% 1.98/2.18  (assume t312.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U))))
% 1.98/2.18  (step t312.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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 1.98/2.18  (step t312.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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule or :premises (t312.t1))
% 1.98/2.18  (step t312.t3 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t312.t2 t312.a0))
% 1.98/2.18  (step t312 (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule subproof :discharge (t312.a0))
% 1.98/2.18  (step t313 (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t311 t312))
% 1.98/2.18  (step t314 (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (not (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule implies_neg2)
% 1.98/2.18  (step t315 (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) (=> (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule resolution :premises (t313 t314))
% 1.98/2.18  (step t316 (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2)))) :rule contraction :premises (t315))
% 1.98/2.18  (step t317 (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.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule implies :premises (t316))
% 1.98/2.18  (step t318 (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)
% 1.98/2.18  (anchor :step t319 :args ((U $$unsorted) (:= U U)))
% 1.98/2.18  (step t319.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t319.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.98/2.18  (step t319.t3 (cl (= (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))))) :rule all_simplify)
% 1.98/2.18  (step t319.t4 (cl (= (= tptp.nil U) (= tptp.nil U))) :rule refl)
% 1.98/2.18  (step t319.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 (t319.t2 t319.t3 t319.t4))
% 1.98/2.18  (step t319 (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)
% 1.98/2.18  (step t320 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U))) (= tptp.nil U)))) :rule resolution :premises (t318 t319 a108))
% 1.98/2.18  (step t321 (cl (or (not (tptp.ssList tptp.sk2)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= tptp.nil tptp.sk2))) :rule resolution :premises (t317 t320))
% 1.98/2.18  (step t322 (cl (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t310 a186 t236 t321))
% 1.98/2.18  (step t323 (cl (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule or_pos)
% 1.98/2.18  (step t324 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem (tptp.hd tptp.sk4))) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule reordering :premises (t323))
% 1.98/2.18  (step t325 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t326)
% 1.98/2.18  (assume t326.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))
% 1.98/2.18  (step t326.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk4)) (:= V tptp.nil)))
% 1.98/2.18  (step t326.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule or :premises (t326.t1))
% 1.98/2.18  (step t326.t3 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t326.t2 t326.a0))
% 1.98/2.18  (step t326 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule subproof :discharge (t326.a0))
% 1.98/2.18  (step t327 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t325 t326))
% 1.98/2.18  (step t328 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (not (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule implies_neg2)
% 1.98/2.18  (step t329 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule resolution :premises (t327 t328))
% 1.98/2.18  (step t330 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))))) :rule contraction :premises (t329))
% 1.98/2.18  (step t331 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule implies :premises (t330))
% 1.98/2.18  (step t332 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule equiv_pos2)
% 1.98/2.18  (anchor :step t333 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.98/2.18  (step t333.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t333.t2 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t333.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 1.98/2.18  (step t333.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t333.t5 (cl (= (= (tptp.tl (tptp.cons U V)) V) (= V (tptp.tl (tptp.cons U V))))) :rule all_simplify)
% 1.98/2.18  (step t333.t6 (cl (= (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule cong :premises (t333.t3 t333.t4 t333.t5))
% 1.98/2.18  (step t333 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))) :rule bind)
% 1.98/2.18  (step t334 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule resolution :premises (t332 t333 a95))
% 1.98/2.18  (step t335 (cl (or (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)) (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))) :rule resolution :premises (t331 t334))
% 1.98/2.18  (step t336 (cl (= tptp.nil (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t324 a7 t289 t335))
% 1.98/2.18  (step t337 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule or_pos)
% 1.98/2.18  (step t338 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule reordering :premises (t337))
% 1.98/2.18  (step t339 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t340)
% 1.98/2.18  (assume t340.a0 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 1.98/2.18  (step t340.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 1.98/2.18  (step t340.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule or :premises (t340.t1))
% 1.98/2.18  (step t340.t3 (cl (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t340.t2 t340.a0))
% 1.98/2.18  (step t340 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule subproof :discharge (t340.a0))
% 1.98/2.18  (step t341 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t339 t340))
% 1.98/2.18  (step t342 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule implies_neg2)
% 1.98/2.18  (step t343 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule resolution :premises (t341 t342))
% 1.98/2.18  (step t344 (cl (=> (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))) (tptp.ssItem (tptp.skaf83 tptp.sk2)))) :rule contraction :premises (t343))
% 1.98/2.18  (step t345 (cl (not (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U)))) (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule implies :premises (t344))
% 1.98/2.18  (step t346 (cl (tptp.ssItem (tptp.skaf83 tptp.sk2))) :rule resolution :premises (t345 a11))
% 1.98/2.18  (step t347 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t348)
% 1.98/2.18  (assume t348.a0 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 1.98/2.18  (step t348.t1 (cl (or (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule forall_inst :args ((:= U tptp.sk2)))
% 1.98/2.18  (step t348.t2 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule or :premises (t348.t1))
% 1.98/2.18  (step t348.t3 (cl (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t348.t2 t348.a0))
% 1.98/2.18  (step t348 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule subproof :discharge (t348.a0))
% 1.98/2.18  (step t349 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t347 t348))
% 1.98/2.18  (step t350 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule implies_neg2)
% 1.98/2.18  (step t351 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2))) (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t349 t350))
% 1.98/2.18  (step t352 (cl (=> (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))) (tptp.ssList (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t351))
% 1.98/2.18  (step t353 (cl (not (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U)))) (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule implies :premises (t352))
% 1.98/2.18  (step t354 (cl (tptp.ssList (tptp.skaf82 tptp.sk2))) :rule resolution :premises (t353 a12))
% 1.98/2.18  (step t355 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t356)
% 1.98/2.18  (assume t356.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))))
% 1.98/2.18  (step t356.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk2)) (:= V (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (step t356.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule or :premises (t356.t1))
% 1.98/2.18  (step t356.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t356.t2 t356.a0))
% 1.98/2.18  (step t356 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule subproof :discharge (t356.a0))
% 1.98/2.18  (step t357 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t355 t356))
% 1.98/2.18  (step t358 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule implies_neg2)
% 1.98/2.18  (step t359 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule resolution :premises (t357 t358))
% 1.98/2.18  (step t360 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule contraction :premises (t359))
% 1.98/2.18  (step t361 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= V (tptp.tl (tptp.cons U V)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies :premises (t360))
% 1.98/2.18  (step t362 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t361 t334))
% 1.98/2.18  (step t363 (cl (= (tptp.skaf82 tptp.sk2) (tptp.tl (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t338 t346 t354 t362))
% 1.98/2.18  (step t364 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule or_pos)
% 1.98/2.18  (step t365 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule reordering :premises (t364))
% 1.98/2.18  (step t366 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (=> (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (=> (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule equiv_pos2)
% 1.98/2.18  (step t367 (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)
% 1.98/2.18  (step t368 (cl (= (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))))) :rule refl)
% 1.98/2.18  (step t369 (cl (= (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))))) :rule refl)
% 1.98/2.18  (step t370 (cl (= (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule all_simplify)
% 1.98/2.18  (step t371 (cl (= (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule cong :premises (t368 t369 t370))
% 1.98/2.18  (step t372 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (=> (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))))) :rule cong :premises (t367 t371))
% 1.98/2.18  (step t373 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (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)
% 1.98/2.18  (anchor :step t374)
% 1.98/2.18  (assume t374.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)))))
% 1.98/2.18  (step t374.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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk2)) (:= V (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (step t374.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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule or :premises (t374.t1))
% 1.98/2.18  (step t374.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t374.t2 t374.a0))
% 1.98/2.18  (step t374 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule subproof :discharge (t374.a0))
% 1.98/2.18  (step t375 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t373 t374))
% 1.98/2.18  (step t376 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies_neg2)
% 1.98/2.18  (step t377 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (=> (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t375 t376))
% 1.98/2.18  (step t378 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule contraction :premises (t377))
% 1.98/2.18  (step t379 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t366 t372 t378))
% 1.98/2.18  (step t380 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies :premises (t379))
% 1.98/2.18  (step t381 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t380 a119))
% 1.98/2.18  (step t382 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t365 t346 t354 t381))
% 1.98/2.18  (step t383 (cl (not (or (not (tptp.frontsegP tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (tptp.frontsegP tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule or_pos)
% 1.98/2.18  (step t384 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (not (tptp.frontsegP tptp.sk1 tptp.nil)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (not (or (not (tptp.frontsegP tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule reordering :premises (t383))
% 1.98/2.18  (step t385 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil)) :rule or_pos)
% 1.98/2.18  (step t386 (cl (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil) (not (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil)))) :rule reordering :premises (t385))
% 1.98/2.18  (step t387 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t388)
% 1.98/2.18  (assume t388.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 1.98/2.18  (step t388.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 1.98/2.18  (step t388.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) :rule or :premises (t388.t1))
% 1.98/2.18  (step t388.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) :rule resolution :premises (t388.t2 t388.a0))
% 1.98/2.18  (step t388 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) :rule subproof :discharge (t388.a0))
% 1.98/2.18  (step t389 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) :rule resolution :premises (t387 t388))
% 1.98/2.18  (step t390 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil)))) :rule implies_neg2)
% 1.98/2.18  (step t391 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil)))) :rule resolution :premises (t389 t390))
% 1.98/2.18  (step t392 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil)))) :rule contraction :premises (t391))
% 1.98/2.18  (step t393 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil)))) (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) :rule implies :premises (t392))
% 1.98/2.18  (step t394 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.frontsegP tptp.sk1 tptp.nil))) :rule resolution :premises (t393 a59))
% 1.98/2.18  (step t395 (cl (tptp.frontsegP tptp.sk1 tptp.nil)) :rule resolution :premises (t386 a185 t394))
% 1.98/2.18  (step t396 (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t397)
% 1.98/2.18  (assume t397.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))
% 1.98/2.18  (step t397.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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule forall_inst :args ((:= U tptp.sk1) (:= V tptp.nil)))
% 1.98/2.18  (step t397.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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule or :premises (t397.t1))
% 1.98/2.18  (step t397.t3 (cl (or (not (tptp.frontsegP tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t397.t2 t397.a0))
% 1.98/2.18  (step t397 (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule subproof :discharge (t397.a0))
% 1.98/2.18  (step t398 (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (or (not (tptp.frontsegP tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t396 t397))
% 1.98/2.18  (step t399 (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (or (not (tptp.frontsegP tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule implies_neg2)
% 1.98/2.18  (step t400 (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (=> (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule resolution :premises (t398 t399))
% 1.98/2.18  (step t401 (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule contraction :premises (t400))
% 1.98/2.18  (step t402 (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.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule implies :premises (t401))
% 1.98/2.18  (step t403 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V)))))) :rule equiv_pos2)
% 1.98/2.18  (anchor :step t404 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.98/2.18  (step t404.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t404.t2 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t404.t3 (cl (= (not (tptp.frontsegP U V)) (not (tptp.frontsegP U V)))) :rule refl)
% 1.98/2.18  (step t404.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t404.t5 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.98/2.18  (step t404.t6 (cl (= (= (tptp.app V (tptp.skaf45 U V)) U) (= U (tptp.app V (tptp.skaf45 U V))))) :rule all_simplify)
% 1.98/2.18  (step t404.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 (t404.t3 t404.t4 t404.t5 t404.t6))
% 1.98/2.18  (step t404 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= U (tptp.app V (tptp.skaf45 U V))))))) :rule bind)
% 1.98/2.18  (step t405 (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 (t403 t404 a131))
% 1.98/2.18  (step t406 (cl (or (not (tptp.frontsegP tptp.sk1 tptp.nil)) (not (tptp.ssList tptp.nil)) (not (tptp.ssList tptp.sk1)) (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t402 t405))
% 1.98/2.18  (step t407 (cl (= tptp.sk1 (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule resolution :premises (t384 a7 a185 t395 t406))
% 1.98/2.18  (step t408 (cl (not (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule or_pos)
% 1.98/2.18  (step t409 (cl (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))) (not (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule reordering :premises (t408))
% 1.98/2.18  (step t410 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t411)
% 1.98/2.18  (assume t411.a0 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 1.98/2.18  (step t411.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule forall_inst :args ((:= U tptp.sk1) (:= V tptp.nil)))
% 1.98/2.18  (step t411.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) :rule or :premises (t411.t1))
% 1.98/2.18  (step t411.t3 (cl (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) :rule resolution :premises (t411.t2 t411.a0))
% 1.98/2.18  (step t411 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) :rule subproof :discharge (t411.a0))
% 1.98/2.18  (step t412 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) :rule resolution :premises (t410 t411))
% 1.98/2.18  (step t413 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule implies_neg2)
% 1.98/2.18  (step t414 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule resolution :premises (t412 t413))
% 1.98/2.18  (step t415 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule contraction :premises (t414))
% 1.98/2.18  (step t416 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V)))) (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) :rule implies :premises (t415))
% 1.98/2.18  (step t417 (cl (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) :rule resolution :premises (t416 a50))
% 1.98/2.18  (step t418 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t419)
% 1.98/2.18  (assume t419.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))
% 1.98/2.18  (step t419.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.skaf45 tptp.sk1 tptp.nil))))
% 1.98/2.18  (step t419.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule or :premises (t419.t1))
% 1.98/2.18  (step t419.t3 (cl (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t419.t2 t419.a0))
% 1.98/2.18  (step t419 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule subproof :discharge (t419.a0))
% 1.98/2.18  (step t420 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t418 t419))
% 1.98/2.18  (step t421 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule implies_neg2)
% 1.98/2.18  (step t422 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule resolution :premises (t420 t421))
% 1.98/2.18  (step t423 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule contraction :premises (t422))
% 1.98/2.18  (step t424 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule implies :premises (t423))
% 1.98/2.18  (step t425 (cl (not (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U)))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule equiv_pos2)
% 1.98/2.18  (anchor :step t426 :args ((U $$unsorted) (:= U U)))
% 1.98/2.18  (step t426.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t426.t2 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.98/2.18  (step t426.t3 (cl (= (= (tptp.app tptp.nil U) U) (= U (tptp.app tptp.nil U)))) :rule all_simplify)
% 1.98/2.18  (step t426.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 (t426.t2 t426.t3))
% 1.98/2.18  (step t426 (cl (= (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U)))))) :rule bind)
% 1.98/2.18  (step t427 (cl (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= U (tptp.app tptp.nil U))))) :rule resolution :premises (t425 t426 a73))
% 1.98/2.18  (step t428 (cl (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t424 t427))
% 1.98/2.18  (step t429 (cl (= (tptp.skaf45 tptp.sk1 tptp.nil) (tptp.app tptp.nil (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule resolution :premises (t409 t417 t428))
% 1.98/2.18  (step t430 (cl (not (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule or_pos)
% 1.98/2.18  (step t431 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))) (not (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule reordering :premises (t430))
% 1.98/2.18  (step t432 (cl (not (or (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 1.98/2.18  (step t433 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (or (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t432))
% 1.98/2.18  (step t434 (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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd 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)
% 1.98/2.18  (anchor :step t435)
% 1.98/2.18  (assume t435.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.98/2.18  (step t435.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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U (tptp.hd tptp.sk4)) (:= V tptp.nil)))
% 1.98/2.18  (step t435.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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule or :premises (t435.t1))
% 1.98/2.18  (step t435.t3 (cl (or (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t435.t2 t435.a0))
% 1.98/2.18  (step t435 (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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t435.a0))
% 1.98/2.18  (step t436 (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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t434 t435))
% 1.98/2.18  (step t437 (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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 1.98/2.18  (step t438 (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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd 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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t436 t437))
% 1.98/2.18  (step t439 (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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t438))
% 1.98/2.18  (step t440 (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.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t439))
% 1.98/2.18  (step t441 (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)
% 1.98/2.18  (anchor :step t442 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.98/2.18  (step t442.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t442.t2 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t442.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 1.98/2.18  (step t442.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t442.t3))
% 1.98/2.18  (step t442.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 1.98/2.18  (step t442.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t442.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 (t442.t4 t442.t5 t442.t6))
% 1.98/2.18  (step t442 (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)
% 1.98/2.18  (step t443 (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 (t441 t442 a97))
% 1.98/2.18  (step t444 (cl (or (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (tptp.ssItem (tptp.hd tptp.sk4))) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t440 t443))
% 1.98/2.18  (step t445 (cl (not (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule resolution :premises (t433 a7 t289 t444))
% 1.98/2.18  (step t446 (cl (=> (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)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (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))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t447)
% 1.98/2.18  (assume t447.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 1.98/2.18  (step t447.t1 (cl (or (not (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))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule forall_inst :args ((:= U (tptp.skaf45 tptp.sk1 tptp.nil)) (:= V (tptp.cons (tptp.hd tptp.sk4) tptp.nil))))
% 1.98/2.18  (step t447.t2 (cl (not (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))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule or :premises (t447.t1))
% 1.98/2.18  (step t447.t3 (cl (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t447.t2 t447.a0))
% 1.98/2.18  (step t447 (cl (not (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))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule subproof :discharge (t447.a0))
% 1.98/2.18  (step t448 (cl (=> (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)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t446 t447))
% 1.98/2.18  (step t449 (cl (=> (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)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (not (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule implies_neg2)
% 1.98/2.18  (step t450 (cl (=> (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)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) (=> (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)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule resolution :premises (t448 t449))
% 1.98/2.18  (step t451 (cl (=> (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)))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))))) :rule contraction :premises (t450))
% 1.98/2.18  (step t452 (cl (not (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))))) (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule implies :premises (t451))
% 1.98/2.18  (step t453 (cl (or (not (tptp.ssList (tptp.skaf45 tptp.sk1 tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (= tptp.nil (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil))))) :rule resolution :premises (t452 a132))
% 1.98/2.18  (step t454 (cl (= (tptp.tl (tptp.app (tptp.cons (tptp.hd tptp.sk4) tptp.nil) (tptp.skaf45 tptp.sk1 tptp.nil))) (tptp.app (tptp.tl (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (tptp.skaf45 tptp.sk1 tptp.nil)))) :rule resolution :premises (t431 t298 t445 t417 t453))
% 1.98/2.18  (step t455 (cl (not (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t65 t87 a189 a190 t308 t322 t336 t363 t382 t407 t429 t454))
% 1.98/2.18  (step t456 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule and_neg)
% 1.98/2.18  (step t457 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t458)
% 1.98/2.18  (assume t458.a0 (tptp.ssList tptp.sk2))
% 1.98/2.18  (assume t458.a1 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t458.a2 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (step t458.t1 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t458.t2)
% 1.98/2.18  (assume t458.t2.a0 (tptp.ssList tptp.sk2))
% 1.98/2.18  (assume t458.t2.a1 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t458.t2.a2 (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (step t458.t2.t1 (cl (= (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) true) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule equiv_simplify)
% 1.98/2.18  (step t458.t2.t2 (cl (not (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) true)) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule equiv1 :premises (t458.t2.t1))
% 1.98/2.18  (step t458.t2.t3 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule symm :premises (t458.t2.a2))
% 1.98/2.18  (step t458.t2.t4 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule symm :premises (t458.t2.a1))
% 1.98/2.18  (step t458.t2.t5 (cl (= (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule trans :premises (t458.t2.t3 t458.t2.t4))
% 1.98/2.18  (step t458.t2.t6 (cl (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (tptp.ssList tptp.sk2))) :rule cong :premises (t458.t2.t5))
% 1.98/2.18  (step t458.t2.t7 (cl (= (= (tptp.ssList tptp.sk2) true) (tptp.ssList tptp.sk2))) :rule equiv_simplify)
% 1.98/2.18  (step t458.t2.t8 (cl (= (tptp.ssList tptp.sk2) true) (not (tptp.ssList tptp.sk2))) :rule equiv2 :premises (t458.t2.t7))
% 1.98/2.18  (step t458.t2.t9 (cl (= (tptp.ssList tptp.sk2) true)) :rule resolution :premises (t458.t2.t8 t458.t2.a0))
% 1.98/2.18  (step t458.t2.t10 (cl (= (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) true)) :rule trans :premises (t458.t2.t6 t458.t2.t9))
% 1.98/2.18  (step t458.t2.t11 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t458.t2.t2 t458.t2.t10))
% 1.98/2.18  (step t458.t2 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t458.t2.a0 t458.t2.a1 t458.t2.a2))
% 1.98/2.18  (step t458.t3 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 1.98/2.18  (step t458.t4 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t458.t5 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t458.t6 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t458.t2 t458.t3 t458.t4 t458.t5))
% 1.98/2.18  (step t458.t7 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t458.t6))
% 1.98/2.18  (step t458.t8 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t458.t7))
% 1.98/2.18  (step t458.t9 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t458.t1 t458.t8))
% 1.98/2.18  (step t458.t10 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 1.98/2.18  (step t458.t11 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t458.t9 t458.t10))
% 1.98/2.18  (step t458.t12 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t458.t11))
% 1.98/2.18  (step t458.t13 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t458.t12))
% 1.98/2.18  (step t458.t14 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule and_neg)
% 1.98/2.18  (step t458.t15 (cl (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t458.t14 t458.a0 t458.a1 t458.a2))
% 1.98/2.18  (step t458.t16 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t458.t13 t458.t15))
% 1.98/2.18  (step t458 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t458.a0 t458.a1 t458.a2))
% 1.98/2.18  (step t459 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList tptp.sk2)) :rule and_pos)
% 1.98/2.18  (step t460 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t461 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t462 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t458 t459 t460 t461))
% 1.98/2.18  (step t463 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule reordering :premises (t462))
% 1.98/2.18  (step t464 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule contraction :premises (t463))
% 1.98/2.18  (step t465 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t457 t464))
% 1.98/2.18  (step t466 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 1.98/2.18  (step t467 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t465 t466))
% 1.98/2.18  (step t468 (cl (=> (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t467))
% 1.98/2.18  (step t469 (cl (not (and (tptp.ssList tptp.sk2) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t468))
% 1.98/2.18  (step t470 (cl (not (tptp.ssList tptp.sk2)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t456 t469))
% 1.98/2.18  (step t471 (cl (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t470 a186 t322 t382))
% 1.98/2.18  (step t472 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t473)
% 1.98/2.18  (assume t473.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))))
% 1.98/2.18  (step t473.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule forall_inst :args ((:= U (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) (:= V (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (step t473.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule or :premises (t473.t1))
% 1.98/2.18  (step t473.t3 (cl (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t473.t2 t473.a0))
% 1.98/2.18  (step t473 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule subproof :discharge (t473.a0))
% 1.98/2.18  (step t474 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t472 t473))
% 1.98/2.18  (step t475 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (not (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule implies_neg2)
% 1.98/2.18  (step t476 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t474 t475))
% 1.98/2.18  (step t477 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2))))) :rule contraction :premises (t476))
% 1.98/2.18  (step t478 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule implies :premises (t477))
% 1.98/2.18  (step t479 (cl (not (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))))) (not (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)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) :rule equiv_pos2)
% 1.98/2.18  (anchor :step t480 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V) (W $$unsorted) (:= W W)))
% 1.98/2.18  (step t480.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t480.t2 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t480.t3 (cl (= W W)) :rule refl)
% 1.98/2.18  (step t480.t4 (cl (= (= (tptp.app U V) W) (= W (tptp.app U V)))) :rule all_simplify)
% 1.98/2.18  (step t480.t5 (cl (= (not (= (tptp.app U V) W)) (not (= W (tptp.app U V))))) :rule cong :premises (t480.t4))
% 1.98/2.18  (step t480.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.98/2.18  (step t480.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t480.t8 (cl (= (not (tptp.ssList W)) (not (tptp.ssList W)))) :rule refl)
% 1.98/2.18  (step t480.t9 (cl (= (tptp.rearsegP W V) (tptp.rearsegP W V))) :rule refl)
% 1.98/2.18  (step t480.t10 (cl (= (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V)) (or (not (= W (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V)))) :rule cong :premises (t480.t5 t480.t6 t480.t7 t480.t8 t480.t9))
% 1.98/2.18  (step t480 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))) :rule bind)
% 1.98/2.18  (step t481 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))))) :rule all_simplify)
% 1.98/2.18  (anchor :step t482 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.98/2.18  (step t482.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t482.t2 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t482.t3 (cl (= (= (tptp.app U V) (tptp.app U V)) true)) :rule all_simplify)
% 1.98/2.18  (step t482.t4 (cl (= (not (= (tptp.app U V) (tptp.app U V))) (not true))) :rule cong :premises (t482.t3))
% 1.98/2.18  (step t482.t5 (cl (= (not (= (tptp.app U V) (tptp.app U V))) false)) :rule trans :premises (t482.t4 t99))
% 1.98/2.18  (step t482.t6 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.98/2.18  (step t482.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t482.t8 (cl (= (not (tptp.ssList (tptp.app U V))) (not (tptp.ssList (tptp.app U V))))) :rule refl)
% 1.98/2.18  (step t482.t9 (cl (= (tptp.rearsegP (tptp.app U V) V) (tptp.rearsegP (tptp.app U V) V))) :rule refl)
% 1.98/2.18  (step t482.t10 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)) (or false (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) :rule cong :premises (t482.t5 t482.t6 t482.t7 t482.t8 t482.t9))
% 1.98/2.18  (step t482.t11 (cl (= (or false (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) :rule all_simplify)
% 1.98/2.18  (step t482.t12 (cl (= (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) :rule trans :premises (t482.t10 t482.t11))
% 1.98/2.18  (step t482 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))))) :rule bind)
% 1.98/2.18  (step t483 (cl (= (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= W (tptp.app U V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))))) :rule trans :premises (t481 t482))
% 1.98/2.18  (step t484 (cl (= (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))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V))))) :rule trans :premises (t480 t483))
% 1.98/2.18  (step t485 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList (tptp.app U V))) (tptp.rearsegP (tptp.app U V) V)))) :rule resolution :premises (t479 t484 a142))
% 1.98/2.18  (step t486 (cl (or (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (not (tptp.ssList (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)))) (tptp.rearsegP (tptp.app (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.skaf82 tptp.sk2)) (tptp.skaf82 tptp.sk2)))) :rule resolution :premises (t478 t485))
% 1.98/2.18  (step t487 (cl (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule and_neg)
% 1.98/2.18  (step t488 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t489)
% 1.98/2.18  (assume t489.a0 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t489.a1 (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))
% 1.98/2.18  (assume t489.a2 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t489.a3 (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))
% 1.98/2.18  (step t489.t1 (cl (=> (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t489.t2)
% 1.98/2.18  (assume t489.t2.a0 (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))
% 1.98/2.18  (assume t489.t2.a1 (= tptp.sk2 tptp.sk4))
% 1.98/2.18  (assume t489.t2.a2 (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (assume t489.t2.a3 (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))
% 1.98/2.18  (step t489.t2.t1 (cl (= (= (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) true) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule equiv_simplify)
% 1.98/2.18  (step t489.t2.t2 (cl (not (= (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) true)) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule equiv1 :premises (t489.t2.t1))
% 1.98/2.18  (step t489.t2.t3 (cl (= (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (tptp.skaf83 tptp.sk2))) :rule symm :premises (t489.t2.a3))
% 1.98/2.18  (step t489.t2.t4 (cl (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule symm :premises (t489.t2.t3))
% 1.98/2.18  (step t489.t2.t5 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk2)) :rule symm :premises (t489.t2.a2))
% 1.98/2.18  (step t489.t2.t6 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t489.t2.a1))
% 1.98/2.18  (step t489.t2.t7 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t489.t2.t6))
% 1.98/2.18  (step t489.t2.t8 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)) tptp.sk4)) :rule trans :premises (t489.t2.t5 t489.t2.t7))
% 1.98/2.18  (step t489.t2.t9 (cl (= (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (tptp.hd tptp.sk4))) :rule cong :premises (t489.t2.t8))
% 1.98/2.18  (step t489.t2.t10 (cl (= (tptp.skaf83 tptp.sk2) (tptp.hd tptp.sk4))) :rule trans :premises (t489.t2.t4 t489.t2.t9))
% 1.98/2.18  (step t489.t2.t11 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.98/2.18  (step t489.t2.t12 (cl (= (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil) (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule cong :premises (t489.t2.t10 t489.t2.t11))
% 1.98/2.18  (step t489.t2.t13 (cl (= (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule cong :premises (t489.t2.t12))
% 1.98/2.18  (step t489.t2.t14 (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)
% 1.98/2.18  (step t489.t2.t15 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)))) :rule equiv2 :premises (t489.t2.t14))
% 1.98/2.18  (step t489.t2.t16 (cl (= (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) true)) :rule resolution :premises (t489.t2.t15 t489.t2.a0))
% 1.98/2.18  (step t489.t2.t17 (cl (= (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) true)) :rule trans :premises (t489.t2.t13 t489.t2.t16))
% 1.98/2.18  (step t489.t2.t18 (cl (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule resolution :premises (t489.t2.t2 t489.t2.t17))
% 1.98/2.18  (step t489.t2 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule subproof :discharge (t489.t2.a0 t489.t2.a1 t489.t2.a2 t489.t2.a3))
% 1.98/2.18  (step t489.t3 (cl (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule and_pos)
% 1.98/2.18  (step t489.t4 (cl (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t489.t5 (cl (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t489.t6 (cl (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule and_pos)
% 1.98/2.18  (step t489.t7 (cl (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule resolution :premises (t489.t2 t489.t3 t489.t4 t489.t5 t489.t6))
% 1.98/2.18  (step t489.t8 (cl (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule reordering :premises (t489.t7))
% 1.98/2.18  (step t489.t9 (cl (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule contraction :premises (t489.t8))
% 1.98/2.18  (step t489.t10 (cl (=> (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule resolution :premises (t489.t1 t489.t9))
% 1.98/2.18  (step t489.t11 (cl (=> (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule implies_neg2)
% 1.98/2.18  (step t489.t12 (cl (=> (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (=> (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule resolution :premises (t489.t10 t489.t11))
% 1.98/2.18  (step t489.t13 (cl (=> (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule contraction :premises (t489.t12))
% 1.98/2.18  (step t489.t14 (cl (not (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule implies :premises (t489.t13))
% 1.98/2.18  (step t489.t15 (cl (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule and_neg)
% 1.98/2.18  (step t489.t16 (cl (and (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 tptp.sk4) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t489.t15 t489.a1 t489.a0 t489.a2 t489.a3))
% 1.98/2.18  (step t489.t17 (cl (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule resolution :premises (t489.t14 t489.t16))
% 1.98/2.18  (step t489 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule subproof :discharge (t489.a0 t489.a1 t489.a2 t489.a3))
% 1.98/2.18  (step t490 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.98/2.18  (step t491 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) :rule and_pos)
% 1.98/2.18  (step t492 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) :rule and_pos)
% 1.98/2.18  (step t493 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule and_pos)
% 1.98/2.18  (step t494 (cl (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule resolution :premises (t489 t490 t491 t492 t493))
% 1.98/2.18  (step t495 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule reordering :premises (t494))
% 1.98/2.18  (step t496 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule contraction :premises (t495))
% 1.98/2.18  (step t497 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule resolution :premises (t488 t496))
% 1.98/2.18  (step t498 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (not (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule implies_neg2)
% 1.98/2.18  (step t499 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule resolution :premises (t497 t498))
% 1.98/2.18  (step t500 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil)))) :rule contraction :premises (t499))
% 1.98/2.18  (step t501 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil)) (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule implies :premises (t500))
% 1.98/2.18  (step t502 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule resolution :premises (t487 t501))
% 1.98/2.18  (step t503 (cl (not (tptp.ssList (tptp.cons (tptp.hd tptp.sk4) tptp.nil))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule reordering :premises (t502))
% 1.98/2.18  (step t504 (cl (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule or_pos)
% 1.98/2.18  (step t505 (cl (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule reordering :premises (t504))
% 1.98/2.18  (step t506 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V)))))) :rule implies_neg1)
% 1.98/2.18  (anchor :step t507)
% 1.98/2.18  (assume t507.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= U (tptp.hd (tptp.cons U V))))))
% 1.98/2.18  (step t507.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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule forall_inst :args ((:= U (tptp.skaf83 tptp.sk2)) (:= V (tptp.skaf82 tptp.sk2))))
% 1.98/2.18  (step t507.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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule or :premises (t507.t1))
% 1.98/2.18  (step t507.t3 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t507.t2 t507.a0))
% 1.98/2.18  (step t507 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule subproof :discharge (t507.a0))
% 1.98/2.18  (step t508 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t506 t507))
% 1.98/2.18  (step t509 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (not (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule implies_neg2)
% 1.98/2.18  (step t510 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) (=> (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule resolution :premises (t508 t509))
% 1.98/2.18  (step t511 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))))) :rule contraction :premises (t510))
% 1.98/2.18  (step t512 (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.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule implies :premises (t511))
% 1.98/2.18  (step t513 (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)
% 1.98/2.18  (anchor :step t514 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.98/2.18  (step t514.t1 (cl (= U U)) :rule refl)
% 1.98/2.18  (step t514.t2 (cl (= V V)) :rule refl)
% 1.98/2.18  (step t514.t3 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 1.98/2.18  (step t514.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.98/2.18  (step t514.t5 (cl (= (= (tptp.hd (tptp.cons U V)) U) (= U (tptp.hd (tptp.cons U V))))) :rule all_simplify)
% 1.98/2.18  (step t514.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 (t514.t3 t514.t4 t514.t5))
% 1.98/2.18  (step t514 (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)
% 1.98/2.18  (step t515 (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 (t513 t514 a96))
% 1.98/2.18  (step t516 (cl (or (not (tptp.ssItem (tptp.skaf83 tptp.sk2))) (not (tptp.ssList (tptp.skaf82 tptp.sk2))) (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2)))))) :rule resolution :premises (t512 t515))
% 1.98/2.18  (step t517 (cl (= (tptp.skaf83 tptp.sk2) (tptp.hd (tptp.cons (tptp.skaf83 tptp.sk2) (tptp.skaf82 tptp.sk2))))) :rule resolution :premises (t505 t346 t354 t516))
% 1.98/2.18  (step t518 (cl (tptp.ssList (tptp.cons (tptp.skaf83 tptp.sk2) tptp.nil))) :rule resolution :premises (t503 t298 a189 t322 t517))
% 1.98/2.18  (step t519 (cl) :rule resolution :premises (t2 t455 t471 t486 t518 t354))
% 1.98/2.18  
% 1.98/2.19  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.EF1zbhLTs9/cvc5---1.0.5_25248.smt2
% 1.98/2.19  % cvc5---1.0.5 exiting
% 1.98/2.20  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------