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

% Computer : n011.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:01 EDT 2024

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

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