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