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