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