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

% Computer : n019.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:02:02 EDT 2024

% Result   : Unsatisfiable 0.48s 0.66s
% Output   : Proof 0.48s
% Verified : 
% SZS Type : -

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