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

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

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

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