TSTP Solution File: SWC004-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWC004-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 17:59:49 EDT 2024
% Result : Unsatisfiable 1.08s 1.25s
% Output : Proof 1.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC004-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.15 % Command : do_cvc5 %s %d
% 0.16/0.37 % Computer : n023.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 26 15:05:24 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.23/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.23/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.08/1.25 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.DfgADNYNg3/cvc5---1.0.5_16646.smt2
% 1.08/1.25 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.DfgADNYNg3/cvc5---1.0.5_16646.smt2
% 1.08/1.27 (assume a0 (tptp.equalelemsP tptp.nil))
% 1.08/1.27 (assume a1 (tptp.duplicatefreeP tptp.nil))
% 1.08/1.27 (assume a2 (tptp.strictorderedP tptp.nil))
% 1.08/1.27 (assume a3 (tptp.totalorderedP tptp.nil))
% 1.08/1.27 (assume a4 (tptp.strictorderP tptp.nil))
% 1.08/1.27 (assume a5 (tptp.totalorderP tptp.nil))
% 1.08/1.27 (assume a6 (tptp.cyclefreeP tptp.nil))
% 1.08/1.27 (assume a7 (tptp.ssList tptp.nil))
% 1.08/1.27 (assume a8 (tptp.ssItem tptp.skac3))
% 1.08/1.27 (assume a9 (tptp.ssItem tptp.skac2))
% 1.08/1.27 (assume a10 (not (tptp.singletonP tptp.nil)))
% 1.08/1.27 (assume a11 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf83 U))))
% 1.08/1.27 (assume a12 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf82 U))))
% 1.08/1.27 (assume a13 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf81 U))))
% 1.08/1.27 (assume a14 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf80 U))))
% 1.08/1.27 (assume a15 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf79 U))))
% 1.08/1.27 (assume a16 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf78 U))))
% 1.08/1.27 (assume a17 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf77 U))))
% 1.08/1.27 (assume a18 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf76 U))))
% 1.08/1.27 (assume a19 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf75 U))))
% 1.08/1.27 (assume a20 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf74 U))))
% 1.08/1.27 (assume a21 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf73 U))))
% 1.08/1.27 (assume a22 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf72 U))))
% 1.08/1.27 (assume a23 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf71 U))))
% 1.08/1.27 (assume a24 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf70 U))))
% 1.08/1.27 (assume a25 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf69 U))))
% 1.08/1.27 (assume a26 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf68 U))))
% 1.08/1.27 (assume a27 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf67 U))))
% 1.08/1.27 (assume a28 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf66 U))))
% 1.08/1.27 (assume a29 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf65 U))))
% 1.08/1.27 (assume a30 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf64 U))))
% 1.08/1.27 (assume a31 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf63 U))))
% 1.08/1.27 (assume a32 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf62 U))))
% 1.08/1.27 (assume a33 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf61 U))))
% 1.08/1.27 (assume a34 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf60 U))))
% 1.08/1.27 (assume a35 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf59 U))))
% 1.08/1.27 (assume a36 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf58 U))))
% 1.08/1.27 (assume a37 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf57 U))))
% 1.08/1.27 (assume a38 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf56 U))))
% 1.08/1.27 (assume a39 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf55 U))))
% 1.08/1.27 (assume a40 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf54 U))))
% 1.08/1.27 (assume a41 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf53 U))))
% 1.08/1.27 (assume a42 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf52 U))))
% 1.08/1.27 (assume a43 (forall ((U $$unsorted)) (tptp.ssList (tptp.skaf51 U))))
% 1.08/1.27 (assume a44 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf50 U))))
% 1.08/1.27 (assume a45 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf49 U))))
% 1.08/1.27 (assume a46 (forall ((U $$unsorted)) (tptp.ssItem (tptp.skaf44 U))))
% 1.08/1.27 (assume a47 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf48 U V))))
% 1.08/1.27 (assume a48 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf47 U V))))
% 1.08/1.27 (assume a49 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf46 U V))))
% 1.08/1.27 (assume a50 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf45 U V))))
% 1.08/1.27 (assume a51 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf43 U V))))
% 1.08/1.27 (assume a52 (forall ((U $$unsorted) (V $$unsorted)) (tptp.ssList (tptp.skaf42 U V))))
% 1.08/1.27 (assume a53 (not (= tptp.skac3 tptp.skac2)))
% 1.08/1.27 (assume a54 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.geq U U))))
% 1.08/1.27 (assume a55 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U tptp.nil))))
% 1.08/1.27 (assume a56 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.segmentP U U))))
% 1.08/1.27 (assume a57 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U tptp.nil))))
% 1.08/1.27 (assume a58 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.rearsegP U U))))
% 1.08/1.27 (assume a59 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U tptp.nil))))
% 1.08/1.27 (assume a60 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.frontsegP U U))))
% 1.08/1.27 (assume a61 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.leq U U))))
% 1.08/1.27 (assume a62 (forall ((U $$unsorted)) (or (not (tptp.lt U U)) (not (tptp.ssItem U)))))
% 1.08/1.27 (assume a63 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.equalelemsP (tptp.cons U tptp.nil)))))
% 1.08/1.27 (assume a64 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.duplicatefreeP (tptp.cons U tptp.nil)))))
% 1.08/1.27 (assume a65 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderedP (tptp.cons U tptp.nil)))))
% 1.08/1.27 (assume a66 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderedP (tptp.cons U tptp.nil)))))
% 1.08/1.27 (assume a67 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.strictorderP (tptp.cons U tptp.nil)))))
% 1.08/1.27 (assume a68 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.totalorderP (tptp.cons U tptp.nil)))))
% 1.08/1.27 (assume a69 (forall ((U $$unsorted)) (or (not (tptp.ssItem U)) (tptp.cyclefreeP (tptp.cons U tptp.nil)))))
% 1.08/1.27 (assume a70 (forall ((U $$unsorted)) (or (not (tptp.memberP tptp.nil U)) (not (tptp.ssItem U)))))
% 1.08/1.27 (assume a71 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (tptp.duplicatefreeP U) (tptp.ssItem V))))
% 1.08/1.27 (assume a72 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app U tptp.nil) U))))
% 1.08/1.27 (assume a73 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.app tptp.nil U) U))))
% 1.08/1.27 (assume a74 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.08/1.27 (assume a75 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.08/1.27 (assume a76 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssList (tptp.tl U)) (= tptp.nil U))))
% 1.08/1.27 (assume a77 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.ssItem (tptp.hd U)) (= tptp.nil U))))
% 1.08/1.27 (assume a78 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.segmentP tptp.nil U))))
% 1.08/1.27 (assume a79 (forall ((U $$unsorted)) (or (not (tptp.segmentP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.08/1.27 (assume a80 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.rearsegP tptp.nil U))))
% 1.08/1.27 (assume a81 (forall ((U $$unsorted)) (or (not (tptp.rearsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.08/1.27 (assume a82 (forall ((U $$unsorted)) (or (not (= tptp.nil U)) (not (tptp.ssList U)) (tptp.frontsegP tptp.nil U))))
% 1.08/1.27 (assume a83 (forall ((U $$unsorted)) (or (not (tptp.frontsegP tptp.nil U)) (not (tptp.ssList U)) (= tptp.nil U))))
% 1.08/1.27 (assume a84 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.ssList (tptp.app V U)))))
% 1.08/1.27 (assume a85 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.08/1.27 (assume a86 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf50 U) (tptp.skaf49 U)))))
% 1.08/1.27 (assume a87 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (tptp.cyclefreeP U) (tptp.leq (tptp.skaf49 U) (tptp.skaf50 U)))))
% 1.08/1.27 (assume a88 (forall ((U $$unsorted)) (or (not (= (tptp.skaf79 U) (tptp.skaf78 U))) (not (tptp.ssList U)) (tptp.equalelemsP U))))
% 1.08/1.27 (assume a89 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf69 U) (tptp.skaf70 U))) (not (tptp.ssList U)) (tptp.strictorderedP U))))
% 1.08/1.27 (assume a90 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf64 U) (tptp.skaf65 U))) (not (tptp.ssList U)) (tptp.totalorderedP U))))
% 1.08/1.27 (assume a91 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf60 U) (tptp.skaf59 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.08/1.27 (assume a92 (forall ((U $$unsorted)) (or (not (tptp.lt (tptp.skaf59 U) (tptp.skaf60 U))) (not (tptp.ssList U)) (tptp.strictorderP U))))
% 1.08/1.27 (assume a93 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf55 U) (tptp.skaf54 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.08/1.27 (assume a94 (forall ((U $$unsorted)) (or (not (tptp.leq (tptp.skaf54 U) (tptp.skaf55 U))) (not (tptp.ssList U)) (tptp.totalorderP U))))
% 1.08/1.27 (assume a95 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.tl (tptp.cons U V)) V))))
% 1.08/1.27 (assume a96 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (= (tptp.hd (tptp.cons U V)) U))))
% 1.08/1.27 (assume a97 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.08/1.27 (assume a98 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) V)) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.08/1.27 (assume a99 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))))
% 1.08/1.27 (assume a100 (forall ((U $$unsorted)) (or (not (tptp.singletonP U)) (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf44 U) tptp.nil) U))))
% 1.08/1.27 (assume a101 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssItem V)) (tptp.neq V U) (= V U))))
% 1.08/1.27 (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))))
% 1.08/1.27 (assume a103 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.hd U) (tptp.tl U)) U) (= tptp.nil U))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (assume a108 (forall ((U $$unsorted)) (or (not (tptp.ssList U)) (= (tptp.cons (tptp.skaf83 U) (tptp.skaf82 U)) U) (= tptp.nil U))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (assume a110 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.lt U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (assume a114 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssList V)) (not (tptp.ssList U)))))
% 1.08/1.27 (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))))
% 1.08/1.27 (assume a116 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= U V)) (not (tptp.neq U V)) (not (tptp.ssItem V)) (not (tptp.ssItem U)))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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))))
% 1.08/1.27 (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)))))
% 1.08/1.27 (assume a185 (tptp.ssList tptp.sk1))
% 1.08/1.27 (assume a186 (tptp.ssList tptp.sk2))
% 1.08/1.27 (assume a187 (tptp.ssList tptp.sk3))
% 1.08/1.27 (assume a188 (tptp.ssList tptp.sk4))
% 1.08/1.27 (assume a189 (= tptp.sk2 tptp.sk4))
% 1.08/1.27 (assume a190 (= tptp.sk1 tptp.sk3))
% 1.08/1.27 (assume a191 (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)))
% 1.08/1.27 (assume a192 (or (tptp.neq tptp.sk2 tptp.nil) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.08/1.27 (assume a193 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= (tptp.app A C) tptp.sk1)) (not (tptp.neq B tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))))
% 1.08/1.27 (assume a194 (or (tptp.ssItem tptp.sk5) (tptp.neq tptp.sk2 tptp.nil)))
% 1.08/1.27 (assume a195 (or (tptp.ssList tptp.sk6) (tptp.neq tptp.sk2 tptp.nil)))
% 1.08/1.27 (assume a196 (or (tptp.ssList tptp.sk7) (tptp.neq tptp.sk2 tptp.nil)))
% 1.08/1.27 (assume a197 (or (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)))
% 1.08/1.27 (assume a198 (or (= (tptp.app tptp.sk6 tptp.sk7) tptp.sk3) (tptp.neq tptp.sk2 tptp.nil)))
% 1.08/1.27 (assume a199 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= (tptp.app A C) tptp.sk1)) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))))
% 1.08/1.27 (assume a200 (or (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.08/1.27 (assume a201 (or (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.08/1.27 (assume a202 (or (tptp.ssList tptp.sk7) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.08/1.27 (assume a203 (or (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.08/1.27 (assume a204 (or (= (tptp.app tptp.sk6 tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))))
% 1.08/1.27 (step t1 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t2)
% 1.08/1.27 (assume t2.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))
% 1.08/1.27 (step t2.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.nil) (:= V (tptp.cons tptp.sk5 tptp.nil))))
% 1.08/1.27 (step t2.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t2.t1))
% 1.08/1.27 (step t2.t3 (cl (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t2.t2 t2.a0))
% 1.08/1.27 (step t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t2.a0))
% 1.08/1.27 (step t3 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t1 t2))
% 1.08/1.27 (step t4 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 1.08/1.27 (step t5 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t3 t4))
% 1.08/1.27 (step t6 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t5))
% 1.08/1.27 (step t7 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t6))
% 1.08/1.27 (step t8 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 1.08/1.27 (step t9 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t8))
% 1.08/1.27 (step t10 (cl (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule or_pos)
% 1.08/1.27 (step t11 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule reordering :premises (t10))
% 1.08/1.27 (step t12 (cl (tptp.ssItem tptp.sk5) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a200))
% 1.08/1.27 (step t13 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssItem tptp.sk5)) :rule reordering :premises (t12))
% 1.08/1.27 (step t14 (cl (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule and_neg)
% 1.08/1.27 (step t15 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t16)
% 1.08/1.27 (assume t16.a0 (= tptp.sk2 tptp.sk4))
% 1.08/1.27 (assume t16.a1 (tptp.neq tptp.sk2 tptp.nil))
% 1.08/1.27 (step t16.t1 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t16.t2)
% 1.08/1.27 (assume t16.t2.a0 (tptp.neq tptp.sk2 tptp.nil))
% 1.08/1.27 (assume t16.t2.a1 (= tptp.sk2 tptp.sk4))
% 1.08/1.27 (step t16.t2.t1 (cl (= (= (tptp.neq tptp.sk4 tptp.nil) true) (tptp.neq tptp.sk4 tptp.nil))) :rule equiv_simplify)
% 1.08/1.27 (step t16.t2.t2 (cl (not (= (tptp.neq tptp.sk4 tptp.nil) true)) (tptp.neq tptp.sk4 tptp.nil)) :rule equiv1 :premises (t16.t2.t1))
% 1.08/1.27 (step t16.t2.t3 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t16.t2.a1))
% 1.08/1.27 (step t16.t2.t4 (cl (= tptp.nil tptp.nil)) :rule refl)
% 1.08/1.27 (step t16.t2.t5 (cl (= (tptp.neq tptp.sk4 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) :rule cong :premises (t16.t2.t3 t16.t2.t4))
% 1.08/1.27 (step t16.t2.t6 (cl (= (= (tptp.neq tptp.sk2 tptp.nil) true) (tptp.neq tptp.sk2 tptp.nil))) :rule equiv_simplify)
% 1.08/1.27 (step t16.t2.t7 (cl (= (tptp.neq tptp.sk2 tptp.nil) true) (not (tptp.neq tptp.sk2 tptp.nil))) :rule equiv2 :premises (t16.t2.t6))
% 1.08/1.27 (step t16.t2.t8 (cl (= (tptp.neq tptp.sk2 tptp.nil) true)) :rule resolution :premises (t16.t2.t7 t16.t2.a0))
% 1.08/1.27 (step t16.t2.t9 (cl (= (tptp.neq tptp.sk4 tptp.nil) true)) :rule trans :premises (t16.t2.t5 t16.t2.t8))
% 1.08/1.27 (step t16.t2.t10 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t16.t2.t2 t16.t2.t9))
% 1.08/1.27 (step t16.t2 (cl (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t16.t2.a0 t16.t2.a1))
% 1.08/1.27 (step t16.t3 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 1.08/1.27 (step t16.t4 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.08/1.27 (step t16.t5 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t16.t2 t16.t3 t16.t4))
% 1.08/1.27 (step t16.t6 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t16.t5))
% 1.08/1.27 (step t16.t7 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t16.t6))
% 1.08/1.27 (step t16.t8 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t16.t1 t16.t7))
% 1.08/1.27 (step t16.t9 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 1.08/1.27 (step t16.t10 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t16.t8 t16.t9))
% 1.08/1.27 (step t16.t11 (cl (=> (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t16.t10))
% 1.08/1.27 (step t16.t12 (cl (not (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t16.t11))
% 1.08/1.27 (step t16.t13 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 1.08/1.27 (step t16.t14 (cl (and (tptp.neq tptp.sk2 tptp.nil) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t16.t13 t16.a1 t16.a0))
% 1.08/1.27 (step t16.t15 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t16.t12 t16.t14))
% 1.08/1.27 (step t16 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule subproof :discharge (t16.a0 t16.a1))
% 1.08/1.27 (step t17 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.08/1.27 (step t18 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule and_pos)
% 1.08/1.27 (step t19 (cl (tptp.neq tptp.sk4 tptp.nil) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)))) :rule resolution :premises (t16 t17 t18))
% 1.08/1.27 (step t20 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule reordering :premises (t19))
% 1.08/1.27 (step t21 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule contraction :premises (t20))
% 1.08/1.27 (step t22 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t15 t21))
% 1.08/1.27 (step t23 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule implies_neg2)
% 1.08/1.27 (step t24 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule resolution :premises (t22 t23))
% 1.08/1.27 (step t25 (cl (=> (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil))) :rule contraction :premises (t24))
% 1.08/1.27 (step t26 (cl (not (and (= tptp.sk2 tptp.sk4) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk4 tptp.nil)) :rule implies :premises (t25))
% 1.08/1.27 (step t27 (cl (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t14 t26))
% 1.08/1.27 (step t28 (cl (tptp.neq tptp.sk4 tptp.nil) (not (= tptp.sk2 tptp.sk4)) (not (tptp.neq tptp.sk2 tptp.nil))) :rule reordering :premises (t27))
% 1.08/1.27 (step t29 (cl (not (= (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))) (not (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil))) (tptp.neq tptp.sk2 tptp.nil)) :rule equiv_pos2)
% 1.08/1.27 (step t30 (cl (= (or (tptp.neq tptp.sk2 tptp.nil) (tptp.neq tptp.sk2 tptp.nil)) (tptp.neq tptp.sk2 tptp.nil))) :rule all_simplify)
% 1.08/1.27 (step t31 (cl (tptp.neq tptp.sk2 tptp.nil)) :rule resolution :premises (t29 t30 a191))
% 1.08/1.27 (step t32 (cl (tptp.neq tptp.sk4 tptp.nil)) :rule resolution :premises (t28 a189 t31))
% 1.08/1.27 (step t33 (cl (tptp.ssItem tptp.sk5)) :rule resolution :premises (t13 t32))
% 1.08/1.27 (step t34 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t35)
% 1.08/1.27 (assume t35.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))))
% 1.08/1.27 (step t35.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 1.08/1.27 (step t35.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule or :premises (t35.t1))
% 1.08/1.27 (step t35.t3 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t35.t2 t35.a0))
% 1.08/1.27 (step t35 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule subproof :discharge (t35.a0))
% 1.08/1.27 (step t36 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t34 t35))
% 1.08/1.27 (step t37 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (not (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule implies_neg2)
% 1.08/1.27 (step t38 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t36 t37))
% 1.08/1.27 (step t39 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V)))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))))) :rule contraction :premises (t38))
% 1.08/1.27 (step t40 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssItem U)) (not (tptp.ssList V)) (tptp.ssList (tptp.cons U V))))) (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule implies :premises (t39))
% 1.08/1.27 (step t41 (cl (or (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)) (tptp.ssList (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t40 a85))
% 1.08/1.27 (step t42 (cl (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) :rule resolution :premises (t11 a7 t33 t41))
% 1.08/1.27 (step t43 (cl (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))) :rule or_pos)
% 1.08/1.27 (step t44 (cl (not (tptp.ssList tptp.nil)) (not (tptp.ssItem tptp.sk5)) (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule reordering :premises (t43))
% 1.08/1.27 (step t45 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t46)
% 1.08/1.27 (assume t46.a0 (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))
% 1.08/1.27 (step t46.t1 (cl (or (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule forall_inst :args ((:= U tptp.sk5) (:= V tptp.nil)))
% 1.08/1.27 (step t46.t2 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule or :premises (t46.t1))
% 1.08/1.27 (step t46.t3 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t46.t2 t46.a0))
% 1.08/1.27 (step t46 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule subproof :discharge (t46.a0))
% 1.08/1.27 (step t47 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t45 t46))
% 1.08/1.27 (step t48 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (not (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule implies_neg2)
% 1.08/1.27 (step t49 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule resolution :premises (t47 t48))
% 1.08/1.27 (step t50 (cl (=> (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil))))) :rule contraction :premises (t49))
% 1.08/1.27 (step t51 (cl (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule implies :premises (t50))
% 1.08/1.27 (step t52 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule equiv_pos2)
% 1.08/1.27 (anchor :step t53 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.08/1.27 (step t53.t1 (cl (= U U)) :rule refl)
% 1.08/1.27 (step t53.t2 (cl (= V V)) :rule refl)
% 1.08/1.27 (step t53.t3 (cl (= (= (tptp.cons U V) tptp.nil) (= tptp.nil (tptp.cons U V)))) :rule all_simplify)
% 1.08/1.27 (step t53.t4 (cl (= (not (= (tptp.cons U V) tptp.nil)) (not (= tptp.nil (tptp.cons U V))))) :rule cong :premises (t53.t3))
% 1.08/1.27 (step t53.t5 (cl (= (not (tptp.ssItem U)) (not (tptp.ssItem U)))) :rule refl)
% 1.08/1.27 (step t53.t6 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.08/1.27 (step t53.t7 (cl (= (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V))) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule cong :premises (t53.t4 t53.t5 t53.t6))
% 1.08/1.27 (step t53 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (= (tptp.cons U V) tptp.nil)) (not (tptp.ssItem U)) (not (tptp.ssList V)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V)))))) :rule bind)
% 1.08/1.27 (step t54 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (= tptp.nil (tptp.cons U V))) (not (tptp.ssItem U)) (not (tptp.ssList V))))) :rule resolution :premises (t52 t53 a97))
% 1.08/1.27 (step t55 (cl (or (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssItem tptp.sk5)) (not (tptp.ssList tptp.nil)))) :rule resolution :premises (t51 t54))
% 1.08/1.27 (step t56 (cl (not (= tptp.nil (tptp.cons tptp.sk5 tptp.nil)))) :rule resolution :premises (t44 a7 t33 t55))
% 1.08/1.27 (step t57 (cl (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule or_pos)
% 1.08/1.27 (step t58 (cl (not (tptp.ssList tptp.sk6)) (not (tptp.ssList tptp.sk7)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule reordering :premises (t57))
% 1.08/1.27 (step t59 (cl (tptp.ssList tptp.sk6) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a201))
% 1.08/1.27 (step t60 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk6)) :rule reordering :premises (t59))
% 1.08/1.27 (step t61 (cl (tptp.ssList tptp.sk6)) :rule resolution :premises (t60 t32))
% 1.08/1.27 (step t62 (cl (tptp.ssList tptp.sk7) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (a202))
% 1.08/1.27 (step t63 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (tptp.ssList tptp.sk7)) :rule reordering :premises (t62))
% 1.08/1.27 (step t64 (cl (tptp.ssList tptp.sk7)) :rule resolution :premises (t63 t32))
% 1.08/1.27 (step t65 (cl (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule and_neg)
% 1.08/1.27 (step t66 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t67)
% 1.08/1.27 (assume t67.a0 (= tptp.sk2 tptp.sk4))
% 1.08/1.27 (assume t67.a1 (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))
% 1.08/1.27 (step t67.t1 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t67.t2)
% 1.08/1.27 (assume t67.t2.a0 (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))
% 1.08/1.27 (assume t67.t2.a1 (= tptp.sk2 tptp.sk4))
% 1.08/1.27 (step t67.t2.t1 (cl (= tptp.sk4 tptp.sk2)) :rule symm :premises (t67.t2.a1))
% 1.08/1.27 (step t67.t2.t2 (cl (= tptp.sk2 tptp.sk4)) :rule symm :premises (t67.t2.t1))
% 1.08/1.27 (step t67.t2.t3 (cl (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk4)) :rule symm :premises (t67.t2.a0))
% 1.08/1.27 (step t67.t2.t4 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule symm :premises (t67.t2.t3))
% 1.08/1.27 (step t67.t2.t5 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule trans :premises (t67.t2.t2 t67.t2.t4))
% 1.08/1.27 (step t67.t2 (cl (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule subproof :discharge (t67.t2.a0 t67.t2.a1))
% 1.08/1.27 (step t67.t3 (cl (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule and_pos)
% 1.08/1.27 (step t67.t4 (cl (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.08/1.27 (step t67.t5 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)))) :rule resolution :premises (t67.t2 t67.t3 t67.t4))
% 1.08/1.27 (step t67.t6 (cl (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule reordering :premises (t67.t5))
% 1.08/1.27 (step t67.t7 (cl (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule contraction :premises (t67.t6))
% 1.08/1.27 (step t67.t8 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule resolution :premises (t67.t1 t67.t7))
% 1.08/1.27 (step t67.t9 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule implies_neg2)
% 1.08/1.27 (step t67.t10 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (=> (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t67.t8 t67.t9))
% 1.08/1.27 (step t67.t11 (cl (=> (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule contraction :premises (t67.t10))
% 1.08/1.27 (step t67.t12 (cl (not (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule implies :premises (t67.t11))
% 1.08/1.27 (step t67.t13 (cl (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 tptp.sk4))) :rule and_neg)
% 1.08/1.27 (step t67.t14 (cl (and (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (= tptp.sk2 tptp.sk4))) :rule resolution :premises (t67.t13 t67.a1 t67.a0))
% 1.08/1.27 (step t67.t15 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule resolution :premises (t67.t12 t67.t14))
% 1.08/1.27 (step t67 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule subproof :discharge (t67.a0 t67.a1))
% 1.08/1.27 (step t68 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.sk2 tptp.sk4)) :rule and_pos)
% 1.08/1.27 (step t69 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule and_pos)
% 1.08/1.27 (step t70 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))))) :rule resolution :premises (t67 t68 t69))
% 1.08/1.27 (step t71 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule reordering :premises (t70))
% 1.08/1.27 (step t72 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule contraction :premises (t71))
% 1.08/1.27 (step t73 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule resolution :premises (t66 t72))
% 1.08/1.27 (step t74 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule implies_neg2)
% 1.08/1.27 (step t75 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule resolution :premises (t73 t74))
% 1.08/1.27 (step t76 (cl (=> (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule contraction :premises (t75))
% 1.08/1.27 (step t77 (cl (not (and (= tptp.sk2 tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule implies :premises (t76))
% 1.08/1.27 (step t78 (cl (not (= tptp.sk2 tptp.sk4)) (not (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule resolution :premises (t65 t77))
% 1.08/1.27 (step t79 (cl (not (= (or (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 1.08/1.27 (step t80 (cl (= (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk4) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)))) :rule all_simplify)
% 1.08/1.27 (step t81 (cl (= (not (tptp.neq tptp.sk4 tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule refl)
% 1.08/1.27 (step t82 (cl (= (or (= (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7) tptp.sk4) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t80 t81))
% 1.08/1.27 (step t83 (cl (or (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t79 t82 a203))
% 1.08/1.27 (step t84 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t83))
% 1.08/1.27 (step t85 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule reordering :premises (t84))
% 1.08/1.27 (step t86 (cl (= tptp.sk4 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule resolution :premises (t85 t32))
% 1.08/1.27 (step t87 (cl (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) :rule resolution :premises (t78 a189 t86))
% 1.08/1.27 (step t88 (cl (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) :rule and_neg)
% 1.08/1.27 (step t89 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t90)
% 1.08/1.27 (assume t90.a0 (= tptp.sk1 tptp.sk3))
% 1.08/1.27 (assume t90.a1 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))
% 1.08/1.27 (step t90.t1 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t90.t2)
% 1.08/1.27 (assume t90.t2.a0 (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))
% 1.08/1.27 (assume t90.t2.a1 (= tptp.sk1 tptp.sk3))
% 1.08/1.27 (step t90.t2.t1 (cl (= tptp.sk3 tptp.sk1)) :rule symm :premises (t90.t2.a1))
% 1.08/1.27 (step t90.t2.t2 (cl (= tptp.sk1 tptp.sk3)) :rule symm :premises (t90.t2.t1))
% 1.08/1.27 (step t90.t2.t3 (cl (= (tptp.app tptp.sk6 tptp.sk7) tptp.sk3)) :rule symm :premises (t90.t2.a0))
% 1.08/1.27 (step t90.t2.t4 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) :rule symm :premises (t90.t2.t3))
% 1.08/1.27 (step t90.t2.t5 (cl (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule trans :premises (t90.t2.t2 t90.t2.t4))
% 1.08/1.27 (step t90.t2 (cl (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (not (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule subproof :discharge (t90.t2.a0 t90.t2.a1))
% 1.08/1.27 (step t90.t3 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) :rule and_pos)
% 1.08/1.27 (step t90.t4 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.08/1.27 (step t90.t5 (cl (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)) (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)))) :rule resolution :premises (t90.t2 t90.t3 t90.t4))
% 1.08/1.27 (step t90.t6 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule reordering :premises (t90.t5))
% 1.08/1.27 (step t90.t7 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule contraction :premises (t90.t6))
% 1.08/1.27 (step t90.t8 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule resolution :premises (t90.t1 t90.t7))
% 1.08/1.27 (step t90.t9 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)))) :rule implies_neg2)
% 1.08/1.27 (step t90.t10 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (=> (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)))) :rule resolution :premises (t90.t8 t90.t9))
% 1.08/1.27 (step t90.t11 (cl (=> (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)))) :rule contraction :premises (t90.t10))
% 1.08/1.27 (step t90.t12 (cl (not (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule implies :premises (t90.t11))
% 1.08/1.27 (step t90.t13 (cl (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (not (= tptp.sk1 tptp.sk3))) :rule and_neg)
% 1.08/1.27 (step t90.t14 (cl (and (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (= tptp.sk1 tptp.sk3))) :rule resolution :premises (t90.t13 t90.a1 t90.a0))
% 1.08/1.27 (step t90.t15 (cl (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule resolution :premises (t90.t12 t90.t14))
% 1.08/1.27 (step t90 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule subproof :discharge (t90.a0 t90.a1))
% 1.08/1.27 (step t91 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) (= tptp.sk1 tptp.sk3)) :rule and_pos)
% 1.08/1.27 (step t92 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) :rule and_pos)
% 1.08/1.27 (step t93 (cl (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))))) :rule resolution :premises (t90 t91 t92))
% 1.08/1.27 (step t94 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule reordering :premises (t93))
% 1.08/1.27 (step t95 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule contraction :premises (t94))
% 1.08/1.27 (step t96 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule resolution :premises (t89 t95))
% 1.08/1.27 (step t97 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)))) :rule implies_neg2)
% 1.08/1.27 (step t98 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)))) :rule resolution :premises (t96 t97))
% 1.08/1.27 (step t99 (cl (=> (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7)))) :rule contraction :premises (t98))
% 1.08/1.27 (step t100 (cl (not (and (= tptp.sk1 tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule implies :premises (t99))
% 1.08/1.27 (step t101 (cl (not (= tptp.sk1 tptp.sk3)) (not (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule resolution :premises (t88 t100))
% 1.08/1.27 (step t102 (cl (not (= (or (= (tptp.app tptp.sk6 tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))))) (not (or (= (tptp.app tptp.sk6 tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule equiv_pos2)
% 1.08/1.27 (step t103 (cl (= (= (tptp.app tptp.sk6 tptp.sk7) tptp.sk3) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)))) :rule all_simplify)
% 1.08/1.27 (step t104 (cl (= (or (= (tptp.app tptp.sk6 tptp.sk7) tptp.sk3) (not (tptp.neq tptp.sk4 tptp.nil))) (or (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t103 t81))
% 1.08/1.27 (step t105 (cl (or (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil)))) :rule resolution :premises (t102 t104 a204))
% 1.08/1.27 (step t106 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7)) (not (tptp.neq tptp.sk4 tptp.nil))) :rule or :premises (t105))
% 1.08/1.27 (step t107 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) :rule reordering :premises (t106))
% 1.08/1.27 (step t108 (cl (= tptp.sk3 (tptp.app tptp.sk6 tptp.sk7))) :rule resolution :premises (t107 t32))
% 1.08/1.27 (step t109 (cl (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) :rule resolution :premises (t101 a190 t108))
% 1.08/1.27 (step t110 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) :rule implies_neg1)
% 1.08/1.27 (anchor :step t111)
% 1.08/1.27 (assume t111.a0 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))))
% 1.08/1.27 (step t111.t1 (cl (or (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule forall_inst :args ((:= A tptp.sk6) (:= B (tptp.cons tptp.sk5 tptp.nil)) (:= C tptp.sk7)))
% 1.08/1.27 (step t111.t2 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule or :premises (t111.t1))
% 1.08/1.27 (step t111.t3 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule resolution :premises (t111.t2 t111.a0))
% 1.08/1.27 (step t111 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule subproof :discharge (t111.a0))
% 1.08/1.27 (step t112 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule resolution :premises (t110 t111))
% 1.08/1.27 (step t113 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (not (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule implies_neg2)
% 1.08/1.27 (step t114 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule resolution :premises (t112 t113))
% 1.08/1.27 (step t115 (cl (=> (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil))))) :rule contraction :premises (t114))
% 1.08/1.27 (step t116 (cl (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule implies :premises (t115))
% 1.08/1.27 (step t117 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))))) :rule hole :args ((forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (= A A) (= C C) (= B B)))
% 1.08/1.27 (step t118 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))))) :rule equiv2 :premises (t117))
% 1.08/1.27 (step t119 (cl (not (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= (tptp.app A C) tptp.sk1)) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))))) (not (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= (tptp.app A C) tptp.sk1)) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))))) :rule equiv_pos2)
% 1.08/1.27 (anchor :step t120 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (C $$unsorted) (:= C C)))
% 1.08/1.27 (step t120.t1 (cl (= A A)) :rule refl)
% 1.08/1.27 (step t120.t2 (cl (= B B)) :rule refl)
% 1.08/1.27 (step t120.t3 (cl (= C C)) :rule refl)
% 1.08/1.27 (step t120.t4 (cl (= (not (tptp.ssList A)) (not (tptp.ssList A)))) :rule refl)
% 1.08/1.27 (step t120.t5 (cl (= (not (tptp.ssList B)) (not (tptp.ssList B)))) :rule refl)
% 1.08/1.27 (step t120.t6 (cl (= (not (tptp.ssList C)) (not (tptp.ssList C)))) :rule refl)
% 1.08/1.27 (step t120.t7 (cl (= (= (tptp.app (tptp.app A B) C) tptp.sk2) (= tptp.sk2 (tptp.app (tptp.app A B) C)))) :rule all_simplify)
% 1.08/1.27 (step t120.t8 (cl (= (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))))) :rule cong :premises (t120.t7))
% 1.08/1.27 (step t120.t9 (cl (= (= (tptp.app A C) tptp.sk1) (= tptp.sk1 (tptp.app A C)))) :rule all_simplify)
% 1.08/1.27 (step t120.t10 (cl (= (not (= (tptp.app A C) tptp.sk1)) (not (= tptp.sk1 (tptp.app A C))))) :rule cong :premises (t120.t9))
% 1.08/1.27 (step t120.t11 (cl (= (not (tptp.neq B tptp.nil)) (not (tptp.neq B tptp.nil)))) :rule refl)
% 1.08/1.27 (step t120.t12 (cl (= (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= (tptp.app A C) tptp.sk1)) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil))))) :rule cong :premises (t120.t4 t120.t5 t120.t6 t120.t8 t120.t10 t120.t11 t81))
% 1.08/1.27 (step t120 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= (tptp.app A C) tptp.sk1)) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))))) :rule bind)
% 1.08/1.27 (step t121 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))))) :rule all_simplify)
% 1.08/1.27 (step t122 (cl (= (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= (tptp.app (tptp.app A B) C) tptp.sk2)) (not (= (tptp.app A C) tptp.sk1)) (not (tptp.neq B tptp.nil)) (not (tptp.neq tptp.sk4 tptp.nil)))) (or (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))))) :rule trans :premises (t120 t121))
% 1.08/1.27 (step t123 (cl (or (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil)))))) :rule resolution :premises (t119 t122 a199))
% 1.08/1.27 (step t124 (cl (not (tptp.neq tptp.sk4 tptp.nil)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) :rule or :premises (t123))
% 1.08/1.27 (step t125 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) :rule resolution :premises (t124 t32))
% 1.08/1.27 (step t126 (cl (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ssList A)) (not (tptp.ssList B)) (not (tptp.ssList C)) (not (= tptp.sk2 (tptp.app (tptp.app A B) C))) (not (= tptp.sk1 (tptp.app A C))) (not (tptp.neq B tptp.nil))))) :rule resolution :premises (t118 t125))
% 1.08/1.27 (step t127 (cl (or (not (tptp.ssList tptp.sk6)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (not (tptp.ssList tptp.sk7)) (not (= tptp.sk2 (tptp.app (tptp.app tptp.sk6 (tptp.cons tptp.sk5 tptp.nil)) tptp.sk7))) (not (= tptp.sk1 (tptp.app tptp.sk6 tptp.sk7))) (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil)))) :rule resolution :premises (t116 t126))
% 1.08/1.27 (step t128 (cl (not (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil))) :rule resolution :premises (t58 t61 t64 t42 t87 t109 t127))
% 1.08/1.27 (step t129 (cl (not (or (not (tptp.ssList tptp.nil)) (not (tptp.ssList (tptp.cons tptp.sk5 tptp.nil))) (tptp.neq (tptp.cons tptp.sk5 tptp.nil) tptp.nil) (= tptp.nil (tptp.cons tptp.sk5 tptp.nil))))) :rule resolution :premises (t9 a7 t42 t56 t128))
% 1.08/1.27 (step t130 (cl (not (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) (not (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule equiv_pos2)
% 1.08/1.27 (anchor :step t131 :args ((U $$unsorted) (:= U U) (V $$unsorted) (:= V V)))
% 1.08/1.27 (step t131.t1 (cl (= U U)) :rule refl)
% 1.08/1.27 (step t131.t2 (cl (= V V)) :rule refl)
% 1.08/1.27 (step t131.t3 (cl (= (not (tptp.ssList U)) (not (tptp.ssList U)))) :rule refl)
% 1.08/1.27 (step t131.t4 (cl (= (not (tptp.ssList V)) (not (tptp.ssList V)))) :rule refl)
% 1.08/1.27 (step t131.t5 (cl (= (tptp.neq V U) (tptp.neq V U))) :rule refl)
% 1.08/1.27 (step t131.t6 (cl (= (= V U) (= U V))) :rule all_simplify)
% 1.08/1.27 (step t131.t7 (cl (= (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule cong :premises (t131.t3 t131.t4 t131.t5 t131.t6))
% 1.08/1.27 (step t131 (cl (= (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= V U))) (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V))))) :rule bind)
% 1.08/1.27 (step t132 (cl (forall ((U $$unsorted) (V $$unsorted)) (or (not (tptp.ssList U)) (not (tptp.ssList V)) (tptp.neq V U) (= U V)))) :rule resolution :premises (t130 t131 a99))
% 1.08/1.27 (step t133 (cl) :rule resolution :premises (t7 t129 t132))
% 1.08/1.27
% 1.08/1.28 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.DfgADNYNg3/cvc5---1.0.5_16646.smt2
% 1.08/1.28 % cvc5---1.0.5 exiting
% 1.08/1.28 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------