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

% Computer : n029.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 17:59:57 EDT 2024

% Result   : Unsatisfiable 0.44s 0.67s
% Output   : Proof 0.44s
% Verified : 
% SZS Type : -

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