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

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

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

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