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