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