TSTP Solution File: KRS156+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : KRS156+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n002.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:17:32 EDT 2024
% Result : Theorem 0.40s 0.63s
% Output : Proof 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : KRS156+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 26 08:33:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.37/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.63 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.40/0.63 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.1hVIFWHWwx/cvc5---1.0.5_30245.smt2
% 0.40/0.63 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.1hVIFWHWwx/cvc5---1.0.5_30245.smt2
% 0.40/0.63 (assume a0 (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))))
% 0.40/0.63 (assume a1 (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))))
% 0.40/0.63 (assume a2 (forall ((X $$unsorted)) (= (tptp.cC10 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px50 X Y0)))))
% 0.40/0.63 (assume a3 (forall ((X $$unsorted)) (= (tptp.cC10 X) (and (tptp.cC2xcomp X) (tptp.cC8xcomp X)))))
% 0.40/0.63 (assume a4 (forall ((X $$unsorted)) (= (tptp.cC10xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px50 X Y))))))
% 0.40/0.63 (assume a5 (forall ((X $$unsorted)) (= (tptp.cC100 X) (and (tptp.cC98xcomp X) (tptp.cC94 X)))))
% 0.40/0.63 (assume a6 (forall ((X $$unsorted)) (= (tptp.cC102 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC100 Y))))))
% 0.40/0.63 (assume a7 (forall ((X $$unsorted)) (= (tptp.cC102 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px30 X Y0)))))
% 0.40/0.63 (assume a8 (forall ((X $$unsorted)) (= (tptp.cC102xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px30 X Y))))))
% 0.40/0.63 (assume a9 (forall ((X $$unsorted)) (= (tptp.cC104 X) (and (tptp.cC102xcomp X) (tptp.cC88 X)))))
% 0.40/0.63 (assume a10 (forall ((X $$unsorted)) (= (tptp.cC106 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC104 Y))))))
% 0.40/0.63 (assume a11 (forall ((X $$unsorted)) (= (tptp.cC106 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px31 X Y))))))
% 0.40/0.63 (assume a12 (forall ((X $$unsorted)) (= (tptp.cC106xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px31 X Y0)))))
% 0.40/0.63 (assume a13 (forall ((X $$unsorted)) (= (tptp.cC108 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px32 X Y0)))))
% 0.40/0.63 (assume a14 (forall ((X $$unsorted)) (= (tptp.cC108 X) (and (tptp.cC84 X) (tptp.cC106xcomp X)))))
% 0.40/0.63 (assume a15 (forall ((X $$unsorted)) (= (tptp.cC108xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px32 X Y))))))
% 0.40/0.63 (assume a16 (forall ((X $$unsorted)) (= (tptp.cC110 X) (and (tptp.cC62 X) (tptp.cC108xcomp X)))))
% 0.40/0.63 (assume a17 (forall ((X $$unsorted)) (= (tptp.cC110 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px33 X Y0)))))
% 0.40/0.63 (assume a18 (forall ((X $$unsorted)) (= (tptp.cC110xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px33 X Y))))))
% 0.40/0.63 (assume a19 (forall ((X $$unsorted)) (= (tptp.cC112 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px43 X Y))))))
% 0.40/0.63 (assume a20 (forall ((X $$unsorted)) (= (tptp.cC112 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC110xcomp Y))))))
% 0.40/0.63 (assume a21 (forall ((X $$unsorted)) (= (tptp.cC112xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px43 X Y0)))))
% 0.40/0.63 (assume a22 (forall ((X $$unsorted)) (= (tptp.cC114 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px34 X Y))))))
% 0.40/0.63 (assume a23 (forall ((X $$unsorted)) (= (tptp.cC114 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC112 Y))))))
% 0.40/0.63 (assume a24 (forall ((X $$unsorted)) (= (tptp.cC114xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px34 X Y0)))))
% 0.40/0.63 (assume a25 (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))))
% 0.40/0.63 (assume a26 (forall ((X $$unsorted)) (= (tptp.cC118 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.63 (assume a27 (forall ((X $$unsorted)) (= (tptp.cC118 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px36 X Y0)))))
% 0.40/0.63 (assume a28 (forall ((X $$unsorted)) (= (tptp.cC118xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px36 X Y))))))
% 0.40/0.63 (assume a29 (forall ((X $$unsorted)) (= (tptp.cC12 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px45 X Y0)))))
% 0.40/0.63 (assume a30 (forall ((X $$unsorted)) (= (tptp.cC12 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC10 Y))))))
% 0.40/0.63 (assume a31 (forall ((X $$unsorted)) (= (tptp.cC12xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px45 X Y))))))
% 0.40/0.63 (assume a32 (forall ((X $$unsorted)) (= (tptp.cC120 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC118xcomp Y))))))
% 0.40/0.63 (assume a33 (forall ((X $$unsorted)) (= (tptp.cC122 X) (and (tptp.cC2xcomp X) (tptp.cC120 X)))))
% 0.40/0.63 (assume a34 (forall ((X $$unsorted)) (= (tptp.cC124 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.63 (assume a35 (forall ((X $$unsorted)) (= (tptp.cC126 X) (and (tptp.cC2 X) (tptp.cC124 X)))))
% 0.40/0.63 (assume a36 (forall ((X $$unsorted)) (= (tptp.cC128 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px40 X Y))))))
% 0.40/0.63 (assume a37 (forall ((X $$unsorted)) (= (tptp.cC128 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC126 Y))))))
% 0.40/0.63 (assume a38 (forall ((X $$unsorted)) (= (tptp.cC128xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px40 X Y0)))))
% 0.40/0.63 (assume a39 (forall ((X $$unsorted)) (= (tptp.cC130 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px47 X Y0)))))
% 0.40/0.63 (assume a40 (forall ((X $$unsorted)) (= (tptp.cC130 X) (and (tptp.cC2xcomp X) (tptp.cC128xcomp X)))))
% 0.40/0.63 (assume a41 (forall ((X $$unsorted)) (= (tptp.cC130xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px47 X Y))))))
% 0.40/0.63 (assume a42 (forall ((X $$unsorted)) (= (tptp.cC132 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px41 X Y0)))))
% 0.40/0.63 (assume a43 (forall ((X $$unsorted)) (= (tptp.cC132 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC130 Y))))))
% 0.40/0.63 (assume a44 (forall ((X $$unsorted)) (= (tptp.cC132xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px41 X Y))))))
% 0.40/0.64 (assume a45 (forall ((X $$unsorted)) (= (tptp.cC134 X) (and (tptp.cC132xcomp X) (tptp.cC122 X)))))
% 0.40/0.64 (assume a46 (forall ((X $$unsorted)) (= (tptp.cC136 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC134 Y))))))
% 0.40/0.64 (assume a47 (forall ((X $$unsorted)) (= (tptp.cC138 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC136 Y))))))
% 0.40/0.64 (assume a48 (forall ((X $$unsorted)) (= (tptp.cC14 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC12 Y))))))
% 0.40/0.64 (assume a49 (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))))
% 0.40/0.64 (assume a50 (forall ((X $$unsorted)) (= (tptp.cC16 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a51 (forall ((X $$unsorted)) (= (tptp.cC18 X) (and (tptp.cC16 X) (tptp.cC2 X)))))
% 0.40/0.64 (assume a52 (forall ((X $$unsorted)) (= (tptp.cC2 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px1 X Y))))))
% 0.40/0.64 (assume a53 (forall ((X $$unsorted)) (= (tptp.cC2xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px1 X Y0)))))
% 0.40/0.64 (assume a54 (forall ((X $$unsorted)) (= (tptp.cC20 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px5 X Y0)))))
% 0.40/0.64 (assume a55 (forall ((X $$unsorted)) (= (tptp.cC20 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC18 Y))))))
% 0.40/0.64 (assume a56 (forall ((X $$unsorted)) (= (tptp.cC20xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px5 X Y))))))
% 0.40/0.64 (assume a57 (forall ((X $$unsorted)) (= (tptp.cC22 X) (and (tptp.cC2xcomp X) (tptp.cC20xcomp X)))))
% 0.40/0.64 (assume a58 (forall ((X $$unsorted)) (= (tptp.cC24 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC22 Y))))))
% 0.40/0.64 (assume a59 (forall ((X $$unsorted)) (= (tptp.cC24 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px6 X Y0)))))
% 0.40/0.64 (assume a60 (forall ((X $$unsorted)) (= (tptp.cC24xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px6 X Y))))))
% 0.40/0.64 (assume a61 (forall ((X $$unsorted)) (= (tptp.cC26 X) (and (tptp.cC14 X) (tptp.cC24xcomp X)))))
% 0.40/0.64 (assume a62 (forall ((X $$unsorted)) (= (tptp.cC26 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px10 X Y))))))
% 0.40/0.64 (assume a63 (forall ((X $$unsorted)) (= (tptp.cC26xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px10 X Y0)))))
% 0.40/0.64 (assume a64 (forall ((X $$unsorted)) (= (tptp.cC28 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a65 (forall ((X $$unsorted)) (= (tptp.cC28 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px49 X Y))))))
% 0.40/0.64 (assume a66 (forall ((X $$unsorted)) (= (tptp.cC28xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px49 X Y0)))))
% 0.40/0.64 (assume a67 (forall ((X $$unsorted)) (= (tptp.cC30 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC28 Y))))))
% 0.40/0.64 (assume a68 (forall ((X $$unsorted)) (= (tptp.cC30 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px44 X Y0)))))
% 0.40/0.64 (assume a69 (forall ((X $$unsorted)) (= (tptp.cC30xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px44 X Y))))))
% 0.40/0.64 (assume a70 (forall ((X $$unsorted)) (= (tptp.cC32 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px9 X Y0)))))
% 0.40/0.64 (assume a71 (forall ((X $$unsorted)) (= (tptp.cC32 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a72 (forall ((X $$unsorted)) (= (tptp.cC32xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px9 X Y))))))
% 0.40/0.64 (assume a73 (forall ((X $$unsorted)) (= (tptp.cC34 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px46 X Y))))))
% 0.40/0.64 (assume a74 (forall ((X $$unsorted)) (= (tptp.cC34 X) (and (tptp.cC32xcomp X) (tptp.cC30 X)))))
% 0.40/0.64 (assume a75 (forall ((X $$unsorted)) (= (tptp.cC34xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px46 X Y0)))))
% 0.40/0.64 (assume a76 (forall ((X $$unsorted)) (= (tptp.cC36 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px11 X Y0)))))
% 0.40/0.64 (assume a77 (forall ((X $$unsorted)) (= (tptp.cC36 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC34 Y))))))
% 0.40/0.64 (assume a78 (forall ((X $$unsorted)) (= (tptp.cC36xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px11 X Y))))))
% 0.40/0.64 (assume a79 (forall ((X $$unsorted)) (= (tptp.cC38 X) (and (tptp.cC26xcomp X) (tptp.cC36xcomp X)))))
% 0.40/0.64 (assume a80 (forall ((X $$unsorted)) (= (tptp.cC4 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a81 (forall ((X $$unsorted)) (= (tptp.cC40 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a82 (forall ((X $$unsorted)) (= (tptp.cC42 X) (and (tptp.cC2xcomp X) (tptp.cC40 X)))))
% 0.40/0.64 (assume a83 (forall ((X $$unsorted)) (= (tptp.cC44 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a84 (forall ((X $$unsorted)) (= (tptp.cC44 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px15 X Y0)))))
% 0.40/0.64 (assume a85 (forall ((X $$unsorted)) (= (tptp.cC44xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px15 X Y))))))
% 0.40/0.64 (assume a86 (forall ((X $$unsorted)) (= (tptp.cC46 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC44xcomp Y))))))
% 0.40/0.64 (assume a87 (forall ((X $$unsorted)) (= (tptp.cC48 X) (and (tptp.cC42 X) (tptp.cC46 X)))))
% 0.40/0.64 (assume a88 (forall ((X $$unsorted)) (= (tptp.cC50 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a89 (forall ((X $$unsorted)) (= (tptp.cC52 X) (and (tptp.cC2 X) (tptp.cC50 X)))))
% 0.40/0.64 (assume a90 (forall ((X $$unsorted)) (= (tptp.cC54 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px18 X Y0)))))
% 0.40/0.64 (assume a91 (forall ((X $$unsorted)) (= (tptp.cC54 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC52 Y))))))
% 0.40/0.64 (assume a92 (forall ((X $$unsorted)) (= (tptp.cC54xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px18 X Y))))))
% 0.40/0.64 (assume a93 (forall ((X $$unsorted)) (= (tptp.cC56 X) (and (tptp.cC2xcomp X) (tptp.cC54xcomp X)))))
% 0.40/0.64 (assume a94 (forall ((X $$unsorted)) (= (tptp.cC58 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC56 Y))))))
% 0.40/0.64 (assume a95 (forall ((X $$unsorted)) (= (tptp.cC58 X) (not (exists ((Y $$unsorted)) (tptp.ra_Px19 X Y))))))
% 0.40/0.64 (assume a96 (forall ((X $$unsorted)) (= (tptp.cC58xcomp X) (exists ((Y0 $$unsorted)) (tptp.ra_Px19 X Y0)))))
% 0.40/0.64 (assume a97 (forall ((X $$unsorted)) (= (tptp.cC6 X) (and (tptp.cC2 X) (tptp.cC4 X)))))
% 0.40/0.64 (assume a98 (forall ((X $$unsorted)) (= (tptp.cC60 X) (and (tptp.cC48 X) (tptp.cC58xcomp X)))))
% 0.40/0.64 (assume a99 (forall ((X $$unsorted)) (= (tptp.cC60 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px20 X Y0)))))
% 0.40/0.64 (assume a100 (forall ((X $$unsorted)) (= (tptp.cC60xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px20 X Y))))))
% 0.40/0.64 (assume a101 (forall ((X $$unsorted)) (= (tptp.cC62 X) (and (tptp.cC38 X) (tptp.cC60xcomp X)))))
% 0.40/0.64 (assume a102 (forall ((X $$unsorted)) (= (tptp.cC64 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a103 (forall ((X $$unsorted)) (= (tptp.cC66 X) (and (tptp.cC64 X) (tptp.cC2 X)))))
% 0.40/0.64 (assume a104 (forall ((X $$unsorted)) (= (tptp.cC68 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a105 (forall ((X $$unsorted)) (= (tptp.cC70 X) (and (tptp.cC2 X) (tptp.cC68 X)))))
% 0.40/0.64 (assume a106 (forall ((X $$unsorted)) (= (tptp.cC72 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC70 Y))))))
% 0.40/0.64 (assume a107 (forall ((X $$unsorted)) (= (tptp.cC74 X) (and (tptp.cC66 X) (tptp.cC72 X)))))
% 0.40/0.64 (assume a108 (forall ((X $$unsorted)) (= (tptp.cC76 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a109 (forall ((X $$unsorted)) (= (tptp.cC78 X) (and (tptp.cC2 X) (tptp.cC76 X)))))
% 0.40/0.64 (assume a110 (forall ((X $$unsorted)) (= (tptp.cC8 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC6 Y))))))
% 0.40/0.64 (assume a111 (forall ((X $$unsorted)) (= (tptp.cC8 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px2 X Y0)))))
% 0.40/0.64 (assume a112 (forall ((X $$unsorted)) (= (tptp.cC8xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px2 X Y))))))
% 0.40/0.64 (assume a113 (forall ((X $$unsorted)) (= (tptp.cC80 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px24 X Y0)))))
% 0.40/0.64 (assume a114 (forall ((X $$unsorted)) (= (tptp.cC80 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC78 Y))))))
% 0.40/0.64 (assume a115 (forall ((X $$unsorted)) (= (tptp.cC80xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px24 X Y))))))
% 0.40/0.64 (assume a116 (forall ((X $$unsorted)) (= (tptp.cC82 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC80xcomp Y))))))
% 0.40/0.64 (assume a117 (forall ((X $$unsorted)) (= (tptp.cC84 X) (and (tptp.cC82 X) (tptp.cC74 X)))))
% 0.40/0.64 (assume a118 (forall ((X $$unsorted)) (= (tptp.cC86 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a119 (forall ((X $$unsorted)) (= (tptp.cC88 X) (and (tptp.cC86 X) (tptp.cC2 X)))))
% 0.40/0.64 (assume a120 (forall ((X $$unsorted)) (= (tptp.cC90 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a121 (forall ((X $$unsorted)) (= (tptp.cC92 X) (and (tptp.cC2 X) (tptp.cC90 X)))))
% 0.40/0.64 (assume a122 (forall ((X $$unsorted)) (= (tptp.cC94 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC92 Y))))))
% 0.40/0.64 (assume a123 (forall ((X $$unsorted)) (= (tptp.cC96 X) (exists ((Y $$unsorted)) (and (tptp.rR1 X Y) (tptp.cC2xcomp Y))))))
% 0.40/0.64 (assume a124 (forall ((X $$unsorted)) (= (tptp.cC98 X) (and (tptp.cC2 X) (tptp.cC96 X)))))
% 0.40/0.64 (assume a125 (forall ((X $$unsorted)) (= (tptp.cC98 X) (exists ((Y0 $$unsorted)) (tptp.ra_Px29 X Y0)))))
% 0.40/0.64 (assume a126 (forall ((X $$unsorted)) (= (tptp.cC98xcomp X) (not (exists ((Y $$unsorted)) (tptp.ra_Px29 X Y))))))
% 0.40/0.64 (assume a127 (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))))
% 0.40/0.64 (assume a128 (tptp.cTOP tptp.iV5475))
% 0.40/0.64 (assume a129 (tptp.cowlThing tptp.iV5475))
% 0.40/0.64 (assume a130 (tptp.cC114xcomp tptp.iV5475))
% 0.40/0.64 (assume a131 (tptp.cTEST tptp.iV5475))
% 0.40/0.64 (assume a132 (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5475 X) (tptp.cC112xcomp X))))
% 0.40/0.64 (assume a133 (tptp.rR1 tptp.iV5475 tptp.iV5476))
% 0.40/0.64 (assume a134 (tptp.cowlThing tptp.iV5476))
% 0.40/0.64 (assume a135 (tptp.cC12xcomp tptp.iV5478))
% 0.40/0.64 (assume a136 (tptp.cC30xcomp tptp.iV5478))
% 0.40/0.64 (assume a137 (tptp.cC2 tptp.iV5478))
% 0.40/0.64 (assume a138 (tptp.cowlThing tptp.iV5478))
% 0.40/0.64 (assume a139 (tptp.cC118xcomp tptp.iV5478))
% 0.40/0.64 (assume a140 (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5478 X) (tptp.cC2 X))))
% 0.40/0.64 (assume a141 (tptp.cC130xcomp tptp.iV5478))
% 0.40/0.64 (assume a142 (tptp.cC34xcomp tptp.iV5478))
% 0.40/0.64 (assume a143 (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5478 X) (tptp.cC10xcomp X))))
% 0.40/0.64 (assume a144 (forall ((X $$unsorted)) (=> (tptp.rR1 tptp.iV5478 X) (tptp.cC28xcomp X))))
% 0.40/0.64 (assume a145 (not (and (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475))))
% 0.40/0.64 (assume a146 true)
% 0.40/0.64 (step t1 (cl (not (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) (not (tptp.cC140 tptp.iV5475)) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475))) :rule equiv_pos2)
% 0.40/0.64 (step t2 (cl (not (tptp.cC140 tptp.iV5475)) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)) (not (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475))))) :rule reordering :premises (t1))
% 0.40/0.64 (step t3 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X))))) :rule implies_neg1)
% 0.40/0.64 (anchor :step t4)
% 0.40/0.64 (assume t4.a0 (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))))
% 0.40/0.64 (step t4.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X))))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475))))) :rule forall_inst :args ((:= X tptp.iV5475)))
% 0.40/0.64 (step t4.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X))))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule or :premises (t4.t1))
% 0.40/0.64 (step t4.t3 (cl (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule resolution :premises (t4.t2 t4.a0))
% 0.40/0.64 (step t4 (cl (not (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X))))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule subproof :discharge (t4.a0))
% 0.40/0.64 (step t5 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule resolution :premises (t3 t4))
% 0.40/0.64 (step t6 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) (not (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475))))) :rule implies_neg2)
% 0.40/0.64 (step t7 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) (=> (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475))))) :rule resolution :premises (t5 t6))
% 0.40/0.64 (step t8 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X)))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475))))) :rule contraction :premises (t7))
% 0.40/0.64 (step t9 (cl (not (forall ((X $$unsorted)) (= (tptp.cC140 X) (and (tptp.cTOP X) (tptp.cC138 X))))) (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule implies :premises (t8))
% 0.40/0.64 (step t10 (cl (= (tptp.cC140 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule resolution :premises (t9 a49))
% 0.40/0.64 (step t11 (cl (not (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475))) (tptp.cC138 tptp.iV5475)) :rule and_pos)
% 0.40/0.64 (step t12 (cl (tptp.cC138 tptp.iV5475) (not (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule reordering :premises (t11))
% 0.40/0.64 (step t13 (cl (not (= (not (and (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475))) (not (and (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803))))))) (not (not (and (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475)))) (not (and (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))))) :rule equiv_pos2)
% 0.40/0.64 (step t14 (cl (= (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (and (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))))) :rule all_simplify)
% 0.40/0.64 (step t15 (cl (= (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))))) :rule refl)
% 0.40/0.64 (step t16 (cl (= (tptp.cC116 tptp.iV5475) (tptp.cC116 tptp.iV5475))) :rule refl)
% 0.40/0.64 (step t17 (cl (= (tptp.cC140 tptp.iV5475) (tptp.cC140 tptp.iV5475))) :rule refl)
% 0.40/0.64 (step t18 (cl (= (tptp.cowlThing tptp.iV5475) (tptp.cowlThing tptp.iV5475))) :rule refl)
% 0.40/0.64 (step t19 (cl (= (tptp.cC138 tptp.iV5475) (tptp.cC138 tptp.iV5475))) :rule refl)
% 0.40/0.64 (step t20 (cl (= (and (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475)) (and (and (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule cong :premises (t14 t15 t16 t17 t18 t19))
% 0.40/0.64 (step t21 (cl (= (and (and (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475)) (and (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))))) :rule all_simplify)
% 0.40/0.64 (step t22 (cl (= (and (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475)) (and (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))))) :rule trans :premises (t20 t21))
% 0.40/0.64 (step t23 (cl (= (not (and (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475))) (not (and (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803))))))) :rule cong :premises (t22))
% 0.40/0.64 (step t24 (cl (not (and (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (tptp.cC116 tptp.iV5475) (tptp.cC140 tptp.iV5475) (tptp.cowlThing tptp.iV5475) (tptp.cC138 tptp.iV5475) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))))) :rule resolution :premises (t13 t23 a145))
% 0.40/0.64 (step t25 (cl (not (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X))))) (not (tptp.cC116 tptp.iV5475)) (not (tptp.cC140 tptp.iV5475)) (not (tptp.cowlThing tptp.iV5475)) (not (tptp.cC138 tptp.iV5475)) (not (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798))) (not (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803))))) :rule not_and :premises (t24))
% 0.40/0.64 (step t26 (cl (not (tptp.cowlThing tptp.iV5475)) (not (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X))))) (not (tptp.cC116 tptp.iV5475)) (not (tptp.cC140 tptp.iV5475)) (not (tptp.cC138 tptp.iV5475)) (not (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798))) (not (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803))))) :rule reordering :premises (t25))
% 0.40/0.64 (step t27 (cl (= (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))))) :rule hole :args ((forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (= X X)))
% 0.40/0.64 (step t28 (cl (not (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X))))) (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X))))) :rule equiv1 :premises (t27))
% 0.40/0.64 (step t29 (cl (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))) (not (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X)))))) :rule reordering :premises (t28))
% 0.40/0.64 (step t30 (cl (forall ((X $$unsorted)) (= (tptp.xsd_string X) (not (tptp.xsd_integer X))))) :rule resolution :premises (t29 a1))
% 0.40/0.64 (step t31 (cl (not (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) (tptp.cC116 tptp.iV5475) (not (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) :rule equiv_pos1)
% 0.40/0.64 (step t32 (cl (tptp.cC116 tptp.iV5475) (not (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))) (not (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))))) :rule reordering :premises (t31))
% 0.40/0.64 (step t33 (cl (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)) (not (tptp.cTOP tptp.iV5475)) (not (tptp.cC114xcomp tptp.iV5475))) :rule and_neg)
% 0.40/0.64 (step t34 (cl (not (tptp.cTOP tptp.iV5475)) (not (tptp.cC114xcomp tptp.iV5475)) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))) :rule reordering :premises (t33))
% 0.40/0.64 (step t35 (cl (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))) :rule resolution :premises (t34 a128 a130))
% 0.40/0.64 (step t36 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X))))) :rule implies_neg1)
% 0.40/0.64 (anchor :step t37)
% 0.40/0.64 (assume t37.a0 (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))))
% 0.40/0.64 (step t37.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X))))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))))) :rule forall_inst :args ((:= X tptp.iV5475)))
% 0.40/0.64 (step t37.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X))))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) :rule or :premises (t37.t1))
% 0.40/0.64 (step t37.t3 (cl (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) :rule resolution :premises (t37.t2 t37.a0))
% 0.40/0.64 (step t37 (cl (not (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X))))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) :rule subproof :discharge (t37.a0))
% 0.40/0.64 (step t38 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) :rule resolution :premises (t36 t37))
% 0.40/0.64 (step t39 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) (not (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))))) :rule implies_neg2)
% 0.40/0.64 (step t40 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) (=> (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))))) :rule resolution :premises (t38 t39))
% 0.40/0.64 (step t41 (cl (=> (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X)))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475))))) :rule contraction :premises (t40))
% 0.40/0.64 (step t42 (cl (not (forall ((X $$unsorted)) (= (tptp.cC116 X) (and (tptp.cTOP X) (tptp.cC114xcomp X))))) (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) :rule implies :premises (t41))
% 0.40/0.64 (step t43 (cl (= (tptp.cC116 tptp.iV5475) (and (tptp.cTOP tptp.iV5475) (tptp.cC114xcomp tptp.iV5475)))) :rule resolution :premises (t42 a25))
% 0.40/0.64 (step t44 (cl (tptp.cC116 tptp.iV5475)) :rule resolution :premises (t32 t35 t43))
% 0.40/0.64 (step t45 (cl (not (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))) (tptp.cC140 tptp.iV5475)) :rule and_pos)
% 0.40/0.64 (step t46 (cl (tptp.cC140 tptp.iV5475) (not (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) :rule reordering :premises (t45))
% 0.40/0.64 (step t47 (cl (not (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) (not (tptp.cTEST tptp.iV5475)) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))) :rule equiv_pos2)
% 0.40/0.64 (step t48 (cl (not (tptp.cTEST tptp.iV5475)) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)) (not (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))))) :rule reordering :premises (t47))
% 0.40/0.64 (step t49 (cl (=> (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X))))) :rule implies_neg1)
% 0.40/0.64 (anchor :step t50)
% 0.40/0.64 (assume t50.a0 (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))))
% 0.40/0.64 (step t50.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X))))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))))) :rule forall_inst :args ((:= X tptp.iV5475)))
% 0.40/0.64 (step t50.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X))))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) :rule or :premises (t50.t1))
% 0.40/0.64 (step t50.t3 (cl (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) :rule resolution :premises (t50.t2 t50.a0))
% 0.40/0.64 (step t50 (cl (not (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X))))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) :rule subproof :discharge (t50.a0))
% 0.40/0.64 (step t51 (cl (=> (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) :rule resolution :premises (t49 t50))
% 0.40/0.64 (step t52 (cl (=> (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) (not (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))))) :rule implies_neg2)
% 0.40/0.64 (step t53 (cl (=> (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) (=> (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))))) :rule resolution :premises (t51 t52))
% 0.40/0.64 (step t54 (cl (=> (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X)))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))))) :rule contraction :premises (t53))
% 0.40/0.64 (step t55 (cl (not (forall ((X $$unsorted)) (= (tptp.cTEST X) (and (tptp.cC140 X) (tptp.cC116 X))))) (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) :rule implies :premises (t54))
% 0.40/0.64 (step t56 (cl (= (tptp.cTEST tptp.iV5475) (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475)))) :rule resolution :premises (t55 a127))
% 0.40/0.64 (step t57 (cl (and (tptp.cC140 tptp.iV5475) (tptp.cC116 tptp.iV5475))) :rule resolution :premises (t48 a131 t56))
% 0.40/0.64 (step t58 (cl (tptp.cC140 tptp.iV5475)) :rule resolution :premises (t46 t57))
% 0.40/0.64 (step t59 (cl (= (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987)) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)))) :rule hole :args ((forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987)) (= BOUND_VARIABLE_1987 BOUND_VARIABLE_2798)))
% 0.40/0.64 (step t60 (cl (not (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987))) (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798))) :rule equiv1 :premises (t59))
% 0.40/0.64 (step t61 (cl (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798)) (not (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987)))) :rule reordering :premises (t60))
% 0.40/0.64 (step t62 (cl (not (= (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (and (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987)) (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992)))))) (not (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X))))) (and (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987)) (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992))))) :rule equiv_pos2)
% 0.40/0.64 (step t63 (cl (= (forall ((X $$unsorted)) (and (tptp.cowlThing X) (not (tptp.cowlNothing X)))) (and (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987)) (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992)))))) :rule all_simplify)
% 0.40/0.64 (step t64 (cl (and (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987)) (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992))))) :rule resolution :premises (t62 t63 a0))
% 0.40/0.64 (step t65 (cl (forall ((BOUND_VARIABLE_1987 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_1987))) :rule and :premises (t64))
% 0.40/0.64 (step t66 (cl (forall ((BOUND_VARIABLE_2798 $$unsorted)) (tptp.cowlThing BOUND_VARIABLE_2798))) :rule resolution :premises (t61 t65))
% 0.40/0.64 (step t67 (cl (= (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992))) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803))))) :rule hole :args ((forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992))) (= BOUND_VARIABLE_1992 BOUND_VARIABLE_2803)))
% 0.40/0.64 (step t68 (cl (not (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992)))) (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))) :rule equiv1 :premises (t67))
% 0.40/0.64 (step t69 (cl (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803))) (not (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992))))) :rule reordering :premises (t68))
% 0.40/0.64 (step t70 (cl (forall ((BOUND_VARIABLE_1992 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_1992)))) :rule and :premises (t64))
% 0.40/0.64 (step t71 (cl (forall ((BOUND_VARIABLE_2803 $$unsorted)) (not (tptp.cowlNothing BOUND_VARIABLE_2803)))) :rule resolution :premises (t69 t70))
% 0.40/0.64 (step t72 (cl (not (tptp.cC138 tptp.iV5475))) :rule resolution :premises (t26 a129 t30 t44 t58 t66 t71))
% 0.40/0.64 (step t73 (cl (not (and (tptp.cTOP tptp.iV5475) (tptp.cC138 tptp.iV5475)))) :rule resolution :premises (t12 t72))
% 0.40/0.64 (step t74 (cl) :rule resolution :premises (t2 t10 t73 t58))
% 0.40/0.64
% 0.40/0.64 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.1hVIFWHWwx/cvc5---1.0.5_30245.smt2
% 0.40/0.64 % cvc5---1.0.5 exiting
% 0.40/0.64 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------