TSTP Solution File: SWC086-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC086-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:00:18 EDT 2024
% Result : Unsatisfiable 0.47s 0.67s
% Output : Proof 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : SWC086-1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n023.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 15:23:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.47/0.67 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.tTkp3bLhgY/cvc5---1.0.5_11954.smt2
% 0.47/0.67 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.tTkp3bLhgY/cvc5---1.0.5_11954.smt2
% 0.47/0.69 (assume a0 (tptp.equalelemsP tptp.nil))
% 0.47/0.69 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 0.47/0.69 (assume a2 (tptp.strictorderedP tptp.nil))
% 0.47/0.69 (assume a3 (tptp.totalorderedP tptp.nil))
% 0.47/0.69 (assume a4 (tptp.strictorderP tptp.nil))
% 0.47/0.69 (assume a5 (tptp.totalorderP tptp.nil))
% 0.47/0.69 (assume a6 (tptp.cyclefreeP tptp.nil))
% 0.47/0.69 (assume a7 (tptp.ssList tptp.nil))
% 0.47/0.69 (assume a8 (tptp.ssItem tptp.skac3))
% 0.47/0.69 (assume a9 (tptp.ssItem tptp.skac2))
% 0.47/0.69 (assume a10 (not (tptp.singletonP tptp.nil)))
% 0.47/0.69 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 0.47/0.69 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 0.47/0.69 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 0.47/0.69 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 0.47/0.69 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 0.47/0.69 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 0.47/0.69 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 0.47/0.69 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 0.47/0.69 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 0.47/0.69 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 0.47/0.69 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 0.47/0.69 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 0.47/0.69 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 0.47/0.69 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 0.47/0.69 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 0.47/0.69 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 0.47/0.69 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 0.47/0.69 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 0.47/0.69 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 0.47/0.69 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 0.47/0.69 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 0.47/0.69 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 0.47/0.69 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 0.47/0.69 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 0.47/0.69 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 0.47/0.69 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 0.47/0.69 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 0.47/0.69 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 0.47/0.69 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 0.47/0.69 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 0.47/0.69 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 0.47/0.69 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 0.47/0.69 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 0.47/0.69 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 0.47/0.69 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 0.47/0.69 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 0.47/0.69 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 0.47/0.69 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 0.47/0.69 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 0.47/0.69 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 0.47/0.69 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 0.47/0.69 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 0.47/0.69 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 0.47/0.69 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 0.47/0.69 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 0.47/0.69 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.47/0.69 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 0.47/0.69 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 0.47/0.69 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 0.47/0.69 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 0.47/0.69 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 0.47/0.69 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 0.47/0.69 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 0.47/0.69 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 0.47/0.69 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 0.47/0.69 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 0.47/0.69 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 0.47/0.69 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 0.47/0.69 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 0.47/0.69 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 0.47/0.69 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 0.47/0.69 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 0.47/0.69 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 0.47/0.69 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.47/0.69 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.47/0.69 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 0.47/0.69 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 0.47/0.69 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 0.47/0.69 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.47/0.69 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 0.47/0.69 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.47/0.69 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 0.47/0.69 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.47/0.69 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 0.47/0.69 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 0.47/0.69 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 0.47/0.69 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 0.47/0.69 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 0.47/0.69 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 0.47/0.69 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 0.47/0.69 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.47/0.69 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 0.47/0.69 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.47/0.69 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 0.47/0.69 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 0.47/0.69 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 0.47/0.69 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.47/0.69 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 0.47/0.69 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 0.47/0.69 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 0.47/0.69 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 0.47/0.69 (assume a102 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U V))))
% 0.47/0.69 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 0.47/0.69 (assume a104 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt V U))))
% 0.47/0.69 (assume a105 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.gt V U))))
% 0.47/0.69 (assume a106 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq V U))))
% 0.47/0.69 (assume a107 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.geq V U))))
% 0.47/0.69 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 0.47/0.69 (assume a109 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.47/0.69 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.47/0.69 (assume a111 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.strictorderedP (tptp.cons V U)))))
% 0.47/0.69 (assume a112 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.totalorderedP (tptp.cons V U)))))
% 0.47/0.69 (assume a113 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)))))
% 0.47/0.69 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 0.47/0.69 (assume a115 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U tptp.nil) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.singletonP V))))
% 0.47/0.69 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 0.47/0.69 (assume a117 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil U))))
% 0.47/0.69 (assume a118 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.app U V) tptp.nil)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= tptp.nil V))))
% 0.47/0.69 (assume a119 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.app (tptp.cons U tptp.nil) V) (tptp.cons U V)))))
% 0.47/0.69 (assume a120 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.47/0.69 (assume a121 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U V) (= U V))))
% 0.47/0.69 (assume a122 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.hd (tptp.app V U)) (tptp.hd V)))))
% 0.47/0.69 (assume a123 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP V) (= tptp.nil V))))
% 0.47/0.69 (assume a124 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP V) (= tptp.nil V))))
% 0.47/0.69 (assume a125 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.47/0.69 (assume a126 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.47/0.69 (assume a127 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.47/0.69 (assume a128 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V U)) (not (tptp.ssList U)) (not (tptp.ssList V)) (= V U))))
% 0.47/0.69 (assume a129 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (tptp.ssItem U)) (not (tptp.ssItem V)) (= V U))))
% 0.47/0.69 (assume a130 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf46 U V) V) U))))
% 0.47/0.69 (assume a131 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app V (tptp.skaf45 U V)) U))))
% 0.47/0.69 (assume a132 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= (tptp.tl (tptp.app V U)) (tptp.app (tptp.tl V) U)))))
% 0.47/0.69 (assume a133 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.strictorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.lt U (tptp.hd V)) (= tptp.nil V))))
% 0.47/0.69 (assume a134 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.totalorderedP (tptp.cons U V))) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.leq U (tptp.hd V)) (= tptp.nil V))))
% 0.47/0.69 (assume a135 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP (tptp.app W U) V))))
% 0.47/0.69 (assume a136 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP (tptp.app U W) V))))
% 0.47/0.69 (assume a137 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= U V)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.memberP (tptp.cons V W) U))))
% 0.47/0.69 (assume a138 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.cons W U) V))))
% 0.47/0.69 (assume a139 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app U W) V))))
% 0.47/0.69 (assume a140 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (tptp.memberP (tptp.app W U) V))))
% 0.47/0.69 (assume a141 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.equalelemsP U) (= (tptp.app (tptp.skaf80 U) (tptp.cons (tptp.skaf78 U) (tptp.cons (tptp.skaf79 U) (tptp.skaf81 U)))) U))))
% 0.47/0.69 (assume a142 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (tptp.rearsegP W V))))
% 0.47/0.69 (assume a143 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (tptp.frontsegP W U))))
% 0.47/0.69 (assume a144 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil U)) (not (= tptp.nil V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app U V) tptp.nil))))
% 0.47/0.69 (assume a145 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.gt U V)) (not (tptp.gt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.gt U W))))
% 0.47/0.69 (assume a146 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.47/0.69 (assume a147 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.geq U V)) (not (tptp.geq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.geq U W))))
% 0.47/0.69 (assume a148 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.app (tptp.app W V) U) (tptp.app W (tptp.app V U))))))
% 0.47/0.69 (assume a149 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app U W))) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssList W)) (= V W))))
% 0.47/0.69 (assume a150 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (= (tptp.app U V) (tptp.app W V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= U W))))
% 0.47/0.69 (assume a151 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.segmentP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP U W))))
% 0.47/0.69 (assume a152 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.rearsegP U V)) (not (tptp.rearsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.rearsegP U W))))
% 0.47/0.69 (assume a153 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.frontsegP U V)) (not (tptp.frontsegP V W)) (not (tptp.ssList W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.frontsegP U W))))
% 0.47/0.69 (assume a154 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.lt U V)) (not (tptp.lt V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.lt U W))))
% 0.47/0.69 (assume a155 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V W)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (tptp.leq U W))))
% 0.47/0.69 (assume a156 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (not (tptp.ssList W)) (= (tptp.cons U (tptp.app V W)) (tptp.app (tptp.cons U V) W)))))
% 0.47/0.69 (assume a157 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.app U V) W)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (tptp.memberP V W) (tptp.memberP U W))))
% 0.47/0.69 (assume a158 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.leq U (tptp.hd V))) (not (tptp.totalorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.47/0.69 (assume a159 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.lt U (tptp.hd V))) (not (tptp.strictorderedP V)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U V)) (= tptp.nil V))))
% 0.47/0.69 (assume a160 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.memberP (tptp.cons U V) W)) (not (tptp.ssList V)) (not (tptp.ssItem U)) (not (tptp.ssItem W)) (tptp.memberP V W) (= W U))))
% 0.47/0.69 (assume a161 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (= (tptp.app (tptp.app (tptp.skaf75 U) (tptp.cons (tptp.skaf74 U) (tptp.skaf76 U))) (tptp.cons (tptp.skaf74 U) (tptp.skaf77 U))) U))))
% 0.47/0.69 (assume a162 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderedP U) (= (tptp.app (tptp.app (tptp.skaf71 U) (tptp.cons (tptp.skaf69 U) (tptp.skaf72 U))) (tptp.cons (tptp.skaf70 U) (tptp.skaf73 U))) U))))
% 0.47/0.69 (assume a163 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderedP U) (= (tptp.app (tptp.app (tptp.skaf66 U) (tptp.cons (tptp.skaf64 U) (tptp.skaf67 U))) (tptp.cons (tptp.skaf65 U) (tptp.skaf68 U))) U))))
% 0.47/0.69 (assume a164 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.strictorderP U) (= (tptp.app (tptp.app (tptp.skaf61 U) (tptp.cons (tptp.skaf59 U) (tptp.skaf62 U))) (tptp.cons (tptp.skaf60 U) (tptp.skaf63 U))) U))))
% 0.47/0.69 (assume a165 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.totalorderP U) (= (tptp.app (tptp.app (tptp.skaf56 U) (tptp.cons (tptp.skaf54 U) (tptp.skaf57 U))) (tptp.cons (tptp.skaf55 U) (tptp.skaf58 U))) U))))
% 0.47/0.69 (assume a166 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (= (tptp.app (tptp.app (tptp.skaf51 U) (tptp.cons (tptp.skaf49 U) (tptp.skaf52 U))) (tptp.cons (tptp.skaf50 U) (tptp.skaf53 U))) U))))
% 0.47/0.69 (assume a167 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList V)) (not (tptp.ssList U)) (= (tptp.app (tptp.app (tptp.skaf47 U V) V) (tptp.skaf48 V U)) U))))
% 0.47/0.69 (assume a168 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.memberP U V)) (not (tptp.ssItem V)) (not (tptp.ssList U)) (= (tptp.app (tptp.skaf42 U V) (tptp.cons V (tptp.skaf43 V U))) U))))
% 0.47/0.69 (assume a169 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= U W))))
% 0.47/0.69 (assume a170 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (not (tptp.ssList X)) (not (tptp.ssList V)) (= X V))))
% 0.47/0.69 (assume a171 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.segmentP U V)) (not (tptp.ssList W)) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (tptp.segmentP (tptp.app (tptp.app X U) W) V))))
% 0.47/0.69 (assume a172 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app (tptp.app U V) W) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssList V)) (not (tptp.ssList X)) (tptp.segmentP X V))))
% 0.47/0.69 (assume a173 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (tptp.frontsegP V X))))
% 0.47/0.69 (assume a174 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (= (tptp.app U (tptp.cons V W)) X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.ssList X)) (tptp.memberP X V))))
% 0.47/0.69 (assume a175 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP (tptp.cons U V) (tptp.cons W X))) (not (tptp.ssList X)) (not (tptp.ssList V)) (not (tptp.ssItem W)) (not (tptp.ssItem U)) (= U W))))
% 0.47/0.69 (assume a176 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.tl U) (tptp.tl V))) (not (= (tptp.hd U) (tptp.hd V))) (not (tptp.ssList U)) (not (tptp.ssList V)) (= tptp.nil V) (= U V) (= tptp.nil U))))
% 0.47/0.69 (assume a177 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted)) (or (not (tptp.frontsegP U V)) (not (= W X)) (not (tptp.ssList V)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem W)) (tptp.frontsegP (tptp.cons W U) (tptp.cons X V)))))
% 0.47/0.69 (assume a178 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons V X)) Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem V)) (not (tptp.duplicatefreeP Y)) (not (tptp.ssList Y)))))
% 0.47/0.69 (assume a179 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.app U (tptp.cons V (tptp.cons W X))) Y)) (not (tptp.ssList X)) (not (tptp.ssList U)) (not (tptp.ssItem W)) (not (tptp.ssItem V)) (not (tptp.equalelemsP Y)) (not (tptp.ssList Y)) (= V W))))
% 0.47/0.69 (assume a180 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderedP Z)) (not (tptp.ssList Z)) (tptp.lt V X))))
% 0.47/0.69 (assume a181 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderedP Z)) (not (tptp.ssList Z)) (tptp.leq V X))))
% 0.47/0.69 (assume a182 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.strictorderP Z)) (not (tptp.ssList Z)) (tptp.lt V X) (tptp.lt X V))))
% 0.47/0.69 (assume a183 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.app (tptp.app U (tptp.cons V W)) (tptp.cons X Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList W)) (not (tptp.ssList U)) (not (tptp.ssItem X)) (not (tptp.ssItem V)) (not (tptp.totalorderP Z)) (not (tptp.ssList Z)) (tptp.leq V X) (tptp.leq X V))))
% 0.47/0.69 (assume a184 (forall ((U $$unsorted) (V $$unsorted) (W $$unsorted) (X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.leq U V)) (not (tptp.leq V U)) (not (= (tptp.app (tptp.app W (tptp.cons U X)) (tptp.cons V Y)) Z)) (not (tptp.ssList Y)) (not (tptp.ssList X)) (not (tptp.ssList W)) (not (tptp.ssItem V)) (not (tptp.ssItem U)) (not (tptp.cyclefreeP Z)) (not (tptp.ssList Z)))))
% 0.47/0.69 (assume a185 (tptp.ssList tptp.sk1))
% 0.47/0.69 (assume a186 (tptp.ssList tptp.sk2))
% 0.47/0.69 (assume a187 (tptp.ssList tptp.sk3))
% 0.47/0.69 (assume a188 (tptp.ssList tptp.sk4))
% 0.47/0.69 (assume a189 (= tptp.sk2 tptp.sk4))
% 0.47/0.69 (assume a190 (= tptp.sk1 tptp.sk3))
% 0.47/0.69 (assume a191 (tptp.neq tptp.sk2 tptp.nil))
% 0.47/0.69 (assume a192 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))))
% 0.47/0.69 (assume a193 (or (= tptp.nil tptp.sk4) (tptp.neq tptp.sk3 tptp.nil)))
% 0.47/0.69 (assume a194 (or (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))
% 0.47/0.69 (assume a195 (or (= tptp.nil tptp.sk3) (tptp.neq tptp.sk3 tptp.nil)))
% 0.47/0.69 (assume a196 (or (= tptp.nil tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3)))
% 0.47/0.69 (step t1 (cl (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule and_neg)
% 0.47/0.69 (step t2 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t3)
% 0.47/0.69 (assume t3.a0 (= tptp.sk2 tptp.sk4))
% 0.47/0.69 (assume t3.a1 (tptp.segmentP tptp.sk4 tptp.sk3))
% 0.47/0.69 (step t3.t1 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.segmentP tptp.sk2 tptp.sk3)) (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t3.t2)
% 0.47/0.69 (assume t3.t2.a0 (tptp.segmentP tptp.sk4 tptp.sk3))
% 0.47/0.69 (assume t3.t2.a1 (= tptp.sk2 tptp.sk4))
% 0.47/0.69 (step t3.t2.t1 (cl (= (= (tptp.segmentP tptp.sk2 tptp.sk3) true) (tptp.segmentP tptp.sk2 tptp.sk3))) :rule equiv_simplify)
% 0.47/0.69 (step t3.t2.t2 (cl (not (= (tptp.segmentP tptp.sk2 tptp.sk3) true)) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule equiv1 :premises (t3.t2.t1))
% 0.47/0.69 (step t3.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t3.t2.a1))
% 0.47/0.69 (step t3.t2.t4 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t3.t2.t3))
% 0.47/0.69 (step t3.t2.t5 (cl (= tptp.sk3 tptp.sk3)) :rule refl)
% 0.47/0.69 (step t3.t2.t6 (cl (= (tptp.segmentP tptp.sk2 tptp.sk3) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule cong :premises (t3.t2.t4 t3.t2.t5))
% 0.47/0.69 (step t3.t2.t7 (cl (= (= (tptp.segmentP tptp.sk4 tptp.sk3) true) (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv_simplify)
% 0.47/0.69 (step t3.t2.t8 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) true) (not (tptp.segmentP tptp.sk4 tptp.sk3))) :rule equiv2 :premises (t3.t2.t7))
% 0.47/0.69 (step t3.t2.t9 (cl (= (tptp.segmentP tptp.sk4 tptp.sk3) true)) :rule resolution :premises (t3.t2.t8 t3.t2.a0))
% 0.47/0.69 (step t3.t2.t10 (cl (= (tptp.segmentP tptp.sk2 tptp.sk3) true)) :rule trans :premises (t3.t2.t6 t3.t2.t9))
% 0.47/0.69 (step t3.t2.t11 (cl (tptp.segmentP tptp.sk2 tptp.sk3)) :rule resolution :premises (t3.t2.t2 t3.t2.t10))
% 0.47/0.69 (step t3.t2 (cl (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.sk2 tptp.sk4)) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule subproof :discharge (t3.t2.a0 t3.t2.a1))
% 0.47/0.69 (step t3.t3 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule and_pos)
% 0.47/0.69 (step t3.t4 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.47/0.69 (step t3.t5 (cl (tptp.segmentP tptp.sk2 tptp.sk3) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t3.t2 t3.t3 t3.t4))
% 0.47/0.69 (step t3.t6 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule reordering :premises (t3.t5))
% 0.47/0.69 (step t3.t7 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule contraction :premises (t3.t6))
% 0.47/0.69 (step t3.t8 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.segmentP tptp.sk2 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule resolution :premises (t3.t1 t3.t7))
% 0.47/0.69 (step t3.t9 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk2 tptp.sk3))) :rule implies_neg2)
% 0.47/0.69 (step t3.t10 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.segmentP tptp.sk2 tptp.sk3)) (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.segmentP tptp.sk2 tptp.sk3))) :rule resolution :premises (t3.t8 t3.t9))
% 0.47/0.69 (step t3.t11 (cl (=> (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (tptp.segmentP tptp.sk2 tptp.sk3))) :rule contraction :premises (t3.t10))
% 0.47/0.69 (step t3.t12 (cl (not (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule implies :premises (t3.t11))
% 0.47/0.69 (step t3.t13 (cl (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 0.47/0.69 (step t3.t14 (cl (and (tptp.segmentP tptp.sk4 tptp.sk3) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t3.t13 t3.a1 t3.a0))
% 0.47/0.69 (step t3.t15 (cl (tptp.segmentP tptp.sk2 tptp.sk3)) :rule resolution :premises (t3.t12 t3.t14))
% 0.47/0.69 (step t3 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule subproof :discharge (t3.a0 t3.a1))
% 0.47/0.69 (step t4 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.47/0.69 (step t5 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule and_pos)
% 0.47/0.69 (step t6 (cl (tptp.segmentP tptp.sk2 tptp.sk3) (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)))) :rule resolution :premises (t3 t4 t5))
% 0.47/0.69 (step t7 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule reordering :premises (t6))
% 0.47/0.69 (step t8 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule contraction :premises (t7))
% 0.47/0.69 (step t9 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule resolution :premises (t2 t8))
% 0.47/0.69 (step t10 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk2 tptp.sk3))) :rule implies_neg2)
% 0.47/0.69 (step t11 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) (=> (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3))) :rule resolution :premises (t9 t10))
% 0.47/0.69 (step t12 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3))) :rule contraction :premises (t11))
% 0.47/0.69 (step t13 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3))) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule implies :premises (t12))
% 0.47/0.69 (step t14 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.segmentP tptp.sk4 tptp.sk3)) (tptp.segmentP tptp.sk2 tptp.sk3)) :rule resolution :premises (t1 t13))
% 0.47/0.69 (step t15 (cl (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))) :rule or_pos)
% 0.47/0.69 (step t16 (cl (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))))) :rule reordering :premises (t15))
% 0.47/0.69 (step t17 (cl (= tptp.nil tptp.sk4) (tptp.neq tptp.sk3 tptp.nil)) :rule or :premises (a193))
% 0.47/0.69 (step t18 (cl (not (= (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2)))) (not (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2))) :rule equiv_pos2)
% 0.47/0.69 (step t19 (cl (= (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk2 tptp.sk4)))) :rule refl)
% 0.47/0.69 (step t20 (cl (= (not (tptp.neq tptp.sk2 tptp.nil)) (not (tptp.neq tptp.sk2 tptp.nil)))) :rule refl)
% 0.47/0.69 (step t21 (cl (= (not (= tptp.nil tptp.sk4)) (not (= tptp.nil tptp.sk4)))) :rule refl)
% 0.47/0.69 (step t22 (cl (= (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true) (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv_simplify)
% 0.47/0.69 (step t23 (cl (not (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true)) (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule equiv1 :premises (t22))
% 0.47/0.69 (step t24 (cl (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule all_simplify)
% 0.47/0.69 (step t25 (cl (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2))) :rule refl)
% 0.47/0.69 (step t26 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule all_simplify)
% 0.47/0.69 (step t27 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2)))) :rule cong :premises (t25 t26))
% 0.47/0.69 (step t28 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule all_simplify)
% 0.47/0.69 (step t29 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) true)) :rule trans :premises (t27 t28))
% 0.47/0.69 (step t30 (cl (= (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2)) true)) :rule trans :premises (t24 t29))
% 0.47/0.69 (step t31 (cl (= (not (not (tptp.neq tptp.sk2 tptp.sk2))) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t23 t30))
% 0.47/0.69 (step t32 (cl (= (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2)))) :rule cong :premises (t19 t20 t21 t31))
% 0.47/0.69 (step t33 (cl (not (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) (not (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule equiv_pos2)
% 0.47/0.69 (step t34 (cl (= (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule refl)
% 0.47/0.69 (step t35 (cl (= (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule equiv_simplify)
% 0.47/0.69 (step t36 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule equiv2 :premises (t35))
% 0.47/0.69 (step t37 (cl (not (not (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule not_not)
% 0.47/0.69 (step t38 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t36 t37))
% 0.47/0.69 (step t39 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t40)
% 0.47/0.69 (assume t40.a0 (tptp.neq tptp.sk2 tptp.nil))
% 0.47/0.69 (assume t40.a1 (= tptp.nil tptp.sk4))
% 0.47/0.69 (assume t40.a2 (= tptp.sk2 tptp.sk4))
% 0.47/0.69 (assume t40.a3 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 0.47/0.69 (step t40.t1 (cl (not (= (= false true) false)) (not (= false true)) false) :rule equiv_pos2)
% 0.47/0.69 (step t40.t2 (cl (= (= false true) false)) :rule all_simplify)
% 0.47/0.69 (step t40.t3 (cl (= (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv_simplify)
% 0.47/0.69 (step t40.t4 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule equiv2 :premises (t40.t3))
% 0.47/0.69 (step t40.t5 (cl (not (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.sk2)) :rule not_not)
% 0.47/0.69 (step t40.t6 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false) (tptp.neq tptp.sk2 tptp.sk2)) :rule resolution :premises (t40.t4 t40.t5))
% 0.47/0.69 (step t40.t7 (cl (= (tptp.neq tptp.sk2 tptp.sk2) false)) :rule resolution :premises (t40.t6 t40.a3))
% 0.47/0.69 (step t40.t8 (cl (= false (tptp.neq tptp.sk2 tptp.sk2))) :rule symm :premises (t40.t7))
% 0.47/0.69 (step t40.t9 (cl (= tptp.sk2 tptp.sk2)) :rule refl)
% 0.47/0.69 (step t40.t10 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t40.a2))
% 0.47/0.69 (step t40.t11 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t40.t10))
% 0.47/0.69 (step t40.t12 (cl (= tptp.sk4 tptp.nil)) :rule symm :premises (t40.a1))
% 0.47/0.69 (step t40.t13 (cl (= tptp.sk2 tptp.nil)) :rule trans :premises (t40.t11 t40.t12))
% 0.47/0.69 (step t40.t14 (cl (= (tptp.neq tptp.sk2 tptp.sk2) (tptp.neq tptp.sk2 tptp.nil))) :rule cong :premises (t40.t9 t40.t13))
% 0.47/0.69 (step t40.t15 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 0.47/0.69 (step t40.t16 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t40.t15))
% 0.47/0.69 (step t40.t17 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t40.t16 t40.a0))
% 0.47/0.69 (step t40.t18 (cl (= false true)) :rule trans :premises (t40.t8 t40.t14 t40.t17))
% 0.47/0.69 (step t40.t19 (cl false) :rule resolution :premises (t40.t1 t40.t2 t40.t18))
% 0.47/0.69 (step t40 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) false) :rule subproof :discharge (t40.a0 t40.a1 t40.a2 t40.a3))
% 0.47/0.69 (step t41 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.47/0.69 (step t42 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 0.47/0.69 (step t43 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.47/0.69 (step t44 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 0.47/0.69 (step t45 (cl false (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t40 t41 t42 t43 t44))
% 0.47/0.69 (step t46 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) false) :rule reordering :premises (t45))
% 0.47/0.69 (step t47 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) false) :rule contraction :premises (t46))
% 0.47/0.69 (step t48 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) false) :rule resolution :premises (t39 t47))
% 0.47/0.69 (step t49 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not false)) :rule implies_neg2)
% 0.47/0.69 (step t50 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule resolution :premises (t48 t49))
% 0.47/0.69 (step t51 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule contraction :premises (t50))
% 0.47/0.69 (step t52 (cl (= (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule implies_simplify)
% 0.47/0.69 (step t53 (cl (not (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule equiv1 :premises (t52))
% 0.47/0.69 (step t54 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t51 t53))
% 0.47/0.69 (step t55 (cl (= (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false)) :rule resolution :premises (t38 t54))
% 0.47/0.69 (step t56 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false))) :rule cong :premises (t34 t55))
% 0.47/0.69 (step t57 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) false) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule all_simplify)
% 0.47/0.69 (step t58 (cl (= (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))))) :rule trans :premises (t56 t57))
% 0.47/0.69 (step t59 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t60)
% 0.47/0.69 (assume t60.a0 (= tptp.sk2 tptp.sk4))
% 0.47/0.69 (assume t60.a1 (tptp.neq tptp.sk2 tptp.nil))
% 0.47/0.69 (assume t60.a2 (= tptp.nil tptp.sk4))
% 0.47/0.69 (assume t60.a3 (not (tptp.neq tptp.sk2 tptp.sk2)))
% 0.47/0.69 (step t60.t1 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (= tptp.sk2 tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule and_neg)
% 0.47/0.69 (step t60.t2 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t60.t1 t60.a1 t60.a2 t60.a0 t60.a3))
% 0.47/0.69 (step t60 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule subproof :discharge (t60.a0 t60.a1 t60.a2 t60.a3))
% 0.47/0.69 (step t61 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 0.47/0.69 (step t62 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 0.47/0.69 (step t63 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (= tptp.nil tptp.sk4)) :rule and_pos)
% 0.47/0.69 (step t64 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2))) :rule and_pos)
% 0.47/0.69 (step t65 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t60 t61 t62 t63 t64))
% 0.47/0.69 (step t66 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule reordering :premises (t65))
% 0.47/0.69 (step t67 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule contraction :premises (t66))
% 0.47/0.69 (step t68 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule resolution :premises (t59 t67))
% 0.47/0.69 (step t69 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule implies_neg2)
% 0.47/0.69 (step t70 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2)))) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t68 t69))
% 0.47/0.69 (step t71 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (= tptp.sk2 tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule contraction :premises (t70))
% 0.47/0.69 (step t72 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil) (= tptp.nil tptp.sk4) (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t33 t58 t71))
% 0.47/0.69 (step t73 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) :rule not_and :premises (t72))
% 0.47/0.69 (step t74 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (= tptp.sk2 tptp.sk4)))) :rule or_neg)
% 0.47/0.69 (step t75 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (tptp.neq tptp.sk2 tptp.nil)))) :rule or_neg)
% 0.47/0.69 (step t76 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (= tptp.nil tptp.sk4)))) :rule or_neg)
% 0.47/0.69 (step t77 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (not (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule or_neg)
% 0.47/0.69 (step t78 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2)))) (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule resolution :premises (t73 t74 t75 t76 t77))
% 0.47/0.69 (step t79 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (not (not (tptp.neq tptp.sk2 tptp.sk2))))) :rule contraction :premises (t78))
% 0.47/0.69 (step t80 (cl (or (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t18 t32 t79))
% 0.47/0.69 (step t81 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.nil tptp.sk4)) (tptp.neq tptp.sk2 tptp.sk2)) :rule or :premises (t80))
% 0.47/0.69 (step t82 (cl (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))) :rule or_pos)
% 0.47/0.69 (step t83 (cl (not (tptp.ssList tptp.sk2)) (not (tptp.neq tptp.sk2 tptp.sk2)) (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule reordering :premises (t82))
% 0.47/0.69 (step t84 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t85)
% 0.47/0.69 (assume t85.a0 (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))))
% 0.47/0.69 (step t85.t1 (cl (or (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule forall_inst :args ((:= V tptp.sk2)))
% 0.47/0.69 (step t85.t2 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule or :premises (t85.t1))
% 0.47/0.69 (step t85.t3 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t85.t2 t85.a0))
% 0.47/0.69 (step t85 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule subproof :discharge (t85.a0))
% 0.47/0.69 (step t86 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t84 t85))
% 0.47/0.69 (step t87 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (not (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule implies_neg2)
% 0.47/0.69 (step t88 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule resolution :premises (t86 t87))
% 0.47/0.69 (step t89 (cl (=> (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V)))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2))))) :rule contraction :premises (t88))
% 0.47/0.69 (step t90 (cl (not (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule implies :premises (t89))
% 0.47/0.69 (step t91 (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.47/0.69 (step t92 (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.47/0.69 (anchor :step t93 :args ((V $$unsorted) (:= V V)))
% 0.47/0.69 (step t93.t1 (cl (= V V)) :rule refl)
% 0.47/0.69 (step t93.t2 (cl (= (= V V) true)) :rule all_simplify)
% 0.47/0.69 (step t93.t3 (cl (= (not (= V V)) (not true))) :rule cong :premises (t93.t2))
% 0.47/0.69 (step t93.t4 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.69 (step t93.t5 (cl (= (not (= V V)) false)) :rule trans :premises (t93.t3 t93.t4))
% 0.47/0.69 (step t93.t6 (cl (= (not (tptp.neq V V)) (not (tptp.neq V V)))) :rule refl)
% 0.47/0.69 (step t93.t7 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 0.47/0.69 (step t93.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 (t93.t5 t93.t6 t93.t7 t93.t7))
% 0.47/0.69 (step t93.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.47/0.69 (step t93.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 (t93.t8 t93.t9))
% 0.47/0.69 (step t93 (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.47/0.69 (step t94 (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 (t92 t93))
% 0.47/0.69 (step t95 (cl (forall ((V $$unsorted)) (or (not (tptp.neq V V)) (not (tptp.ssList V))))) :rule resolution :premises (t91 t94 a114))
% 0.47/0.69 (step t96 (cl (or (not (tptp.neq tptp.sk2 tptp.sk2)) (not (tptp.ssList tptp.sk2)))) :rule resolution :premises (t90 t95))
% 0.47/0.69 (step t97 (cl (not (tptp.neq tptp.sk2 tptp.sk2))) :rule resolution :premises (t83 a186 t96))
% 0.47/0.69 (step t98 (cl (not (= tptp.nil tptp.sk4))) :rule resolution :premises (t81 a189 a191 t97))
% 0.47/0.69 (step t99 (cl (tptp.neq tptp.sk3 tptp.nil)) :rule resolution :premises (t17 t98))
% 0.47/0.69 (step t100 (cl (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk1))) :rule and_neg)
% 0.47/0.69 (step t101 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3)) (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t102)
% 0.47/0.69 (assume t102.a0 (= tptp.sk1 tptp.sk3))
% 0.47/0.69 (assume t102.a1 (tptp.segmentP tptp.sk1 tptp.sk1))
% 0.47/0.69 (step t102.t1 (cl (=> (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3)) (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t102.t2)
% 0.47/0.69 (assume t102.t2.a0 (tptp.segmentP tptp.sk1 tptp.sk1))
% 0.47/0.69 (assume t102.t2.a1 (= tptp.sk1 tptp.sk3))
% 0.47/0.69 (step t102.t2.t1 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk3) true) (tptp.segmentP tptp.sk1 tptp.sk3))) :rule equiv_simplify)
% 0.47/0.69 (step t102.t2.t2 (cl (not (= (tptp.segmentP tptp.sk1 tptp.sk3) true)) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule equiv1 :premises (t102.t2.t1))
% 0.47/0.69 (step t102.t2.t3 (cl (= tptp.sk1 tptp.sk1)) :rule refl)
% 0.47/0.69 (step t102.t2.t4 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t102.t2.a1))
% 0.47/0.69 (step t102.t2.t5 (cl (= (tptp.segmentP tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule cong :premises (t102.t2.t3 t102.t2.t4))
% 0.47/0.69 (step t102.t2.t6 (cl (= (= (tptp.segmentP tptp.sk1 tptp.sk1) true) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule equiv_simplify)
% 0.47/0.69 (step t102.t2.t7 (cl (= (tptp.segmentP tptp.sk1 tptp.sk1) true) (not (tptp.segmentP tptp.sk1 tptp.sk1))) :rule equiv2 :premises (t102.t2.t6))
% 0.47/0.69 (step t102.t2.t8 (cl (= (tptp.segmentP tptp.sk1 tptp.sk1) true)) :rule resolution :premises (t102.t2.t7 t102.t2.a0))
% 0.47/0.69 (step t102.t2.t9 (cl (= (tptp.segmentP tptp.sk1 tptp.sk3) true)) :rule trans :premises (t102.t2.t5 t102.t2.t8))
% 0.47/0.69 (step t102.t2.t10 (cl (tptp.segmentP tptp.sk1 tptp.sk3)) :rule resolution :premises (t102.t2.t2 t102.t2.t9))
% 0.47/0.69 (step t102.t2 (cl (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule subproof :discharge (t102.t2.a0 t102.t2.a1))
% 0.47/0.69 (step t102.t3 (cl (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule and_pos)
% 0.47/0.69 (step t102.t4 (cl (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.47/0.69 (step t102.t5 (cl (tptp.segmentP tptp.sk1 tptp.sk3) (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t102.t2 t102.t3 t102.t4))
% 0.47/0.69 (step t102.t6 (cl (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule reordering :premises (t102.t5))
% 0.47/0.69 (step t102.t7 (cl (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule contraction :premises (t102.t6))
% 0.47/0.69 (step t102.t8 (cl (=> (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule resolution :premises (t102.t1 t102.t7))
% 0.47/0.69 (step t102.t9 (cl (=> (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))) :rule implies_neg2)
% 0.47/0.69 (step t102.t10 (cl (=> (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3)) (=> (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3))) :rule resolution :premises (t102.t8 t102.t9))
% 0.47/0.69 (step t102.t11 (cl (=> (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3))) :rule contraction :premises (t102.t10))
% 0.47/0.69 (step t102.t12 (cl (not (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule implies :premises (t102.t11))
% 0.47/0.69 (step t102.t13 (cl (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 0.47/0.69 (step t102.t14 (cl (and (tptp.segmentP tptp.sk1 tptp.sk1) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t102.t13 t102.a1 t102.a0))
% 0.47/0.69 (step t102.t15 (cl (tptp.segmentP tptp.sk1 tptp.sk3)) :rule resolution :premises (t102.t12 t102.t14))
% 0.47/0.69 (step t102 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule subproof :discharge (t102.a0 t102.a1))
% 0.47/0.69 (step t103 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 0.47/0.69 (step t104 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule and_pos)
% 0.47/0.69 (step t105 (cl (tptp.segmentP tptp.sk1 tptp.sk3) (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t102 t103 t104))
% 0.47/0.69 (step t106 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule reordering :premises (t105))
% 0.47/0.69 (step t107 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule contraction :premises (t106))
% 0.47/0.69 (step t108 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3)) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule resolution :premises (t101 t107))
% 0.47/0.69 (step t109 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))) :rule implies_neg2)
% 0.47/0.69 (step t110 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3)) (=> (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3))) :rule resolution :premises (t108 t109))
% 0.47/0.69 (step t111 (cl (=> (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3))) :rule contraction :premises (t110))
% 0.47/0.69 (step t112 (cl (not (and (= tptp.sk1 tptp.sk3) (tptp.segmentP tptp.sk1 tptp.sk1))) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule implies :premises (t111))
% 0.47/0.69 (step t113 (cl (not (= tptp.sk1 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk3)) :rule resolution :premises (t100 t112))
% 0.47/0.69 (step t114 (cl (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)) :rule or_pos)
% 0.47/0.69 (step t115 (cl (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule reordering :premises (t114))
% 0.47/0.69 (step t116 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t117)
% 0.47/0.69 (assume t117.a0 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 0.47/0.69 (step t117.t1 (cl (or (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule forall_inst :args ((:= U tptp.sk1)))
% 0.47/0.69 (step t117.t2 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule or :premises (t117.t1))
% 0.47/0.69 (step t117.t3 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t117.t2 t117.a0))
% 0.47/0.69 (step t117 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule subproof :discharge (t117.a0))
% 0.47/0.69 (step t118 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t116 t117))
% 0.47/0.69 (step t119 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (not (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule implies_neg2)
% 0.47/0.69 (step t120 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule resolution :premises (t118 t119))
% 0.47/0.69 (step t121 (cl (=> (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1)))) :rule contraction :premises (t120))
% 0.47/0.69 (step t122 (cl (not (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U)))) (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule implies :premises (t121))
% 0.47/0.69 (step t123 (cl (or (not (tptp.ssList tptp.sk1)) (tptp.segmentP tptp.sk1 tptp.sk1))) :rule resolution :premises (t122 a56))
% 0.47/0.69 (step t124 (cl (tptp.segmentP tptp.sk1 tptp.sk1)) :rule resolution :premises (t115 a185 t123))
% 0.47/0.69 (step t125 (cl (tptp.segmentP tptp.sk1 tptp.sk3)) :rule resolution :premises (t113 a190 t124))
% 0.47/0.69 (step t126 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) :rule implies_neg1)
% 0.47/0.69 (anchor :step t127)
% 0.47/0.69 (assume t127.a0 (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))))
% 0.47/0.69 (step t127.t1 (cl (or (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))))) :rule forall_inst :args ((:= A tptp.sk3)))
% 0.47/0.69 (step t127.t2 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) :rule or :premises (t127.t1))
% 0.47/0.69 (step t127.t3 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t127.t2 t127.a0))
% 0.47/0.69 (step t127 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) :rule subproof :discharge (t127.a0))
% 0.47/0.69 (step t128 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t126 t127))
% 0.47/0.69 (step t129 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) (not (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))))) :rule implies_neg2)
% 0.47/0.69 (step t130 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))))) :rule resolution :premises (t128 t129))
% 0.47/0.69 (step t131 (cl (=> (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A)))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3))))) :rule contraction :premises (t130))
% 0.47/0.69 (step t132 (cl (not (forall ((A $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.neq A tptp.nil)) (not (tptp.segmentP tptp.sk2 A)) (not (tptp.segmentP tptp.sk1 A))))) (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) :rule implies :premises (t131))
% 0.47/0.69 (step t133 (cl (or (not (tptp.ssList tptp.sk3)) (not (tptp.neq tptp.sk3 tptp.nil)) (not (tptp.segmentP tptp.sk2 tptp.sk3)) (not (tptp.segmentP tptp.sk1 tptp.sk3)))) :rule resolution :premises (t132 a192))
% 0.47/0.69 (step t134 (cl (not (tptp.segmentP tptp.sk2 tptp.sk3))) :rule resolution :premises (t16 a187 t99 t125 t133))
% 0.47/0.69 (step t135 (cl (= tptp.nil tptp.sk4) (tptp.segmentP tptp.sk4 tptp.sk3)) :rule or :premises (a194))
% 0.47/0.69 (step t136 (cl (tptp.segmentP tptp.sk4 tptp.sk3)) :rule resolution :premises (t135 t98))
% 0.47/0.69 (step t137 (cl) :rule resolution :premises (t14 t134 t136 a189))
% 0.47/0.69
% 0.47/0.69 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.tTkp3bLhgY/cvc5---1.0.5_11954.smt2
% 0.47/0.69 % cvc5---1.0.5 exiting
% 0.47/0.70 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------